@conference {
	title = {Statistical modeling and performance analysis of multi-scale traffic},
	author = {Liu, Nelson X., Baras, John S.},
	year = {2003},
	month = {03/2003},
	abstract = {In this paper we propose a new statistical model for multi-scale traffic, and present an exact queueing analysis for the model. The model is based on the central moments and the marginal distributions of the cumulative traffic loads in different time scales. Only the first two moments are needed to characterize the traffic process, which greatly simplifies the representation and estimation. The queueing analysis uses a very general approach and can evaluate not only the steady state performance but also the transient queuing behavior. The analysis reveals that there exist two classes of packet losses, the absolute loss and the opportunistic loss, both of which can be examined exactly with the method. Based on the statistical model and the queueing analysis method, a compound model is constructed for the practical multiscale traffic, and its performance is evaluated from various aspects. This work provides a good basis for practical application of the multiscale traffic characterizations in network dimensioning and resource management.},
	address = {San Francisco, CA},
	booktitle = {22nd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2003},
	pages = {pp. 1837-1847}
}
@conference {
	title = {The Experimentation and Modeling of {\textquotedblleft}Satellite-Friendly{\textquotedblright} HTTP},
	author = {Bhalekar, Aniruddha., Baras, John S.},
	year = {2003},
	month = {03/2003},
	abstract = {The demand for Internet access has been characterized by an exponential growth. The introduction of high-speed satellite communication systems providing direct-to-home Internet services is a response to this increasing demand. However, such systems suffer from high delay-bandwidth product and high bit-error-rate which causes degradation in the performance of HTTP, which is a request-response type, application-layer protocol over TCP. In this paper we investigate HTTP/1.0, HTTP/1.1 and analyze different mechanisms to reduce the user-perceived delay and improve the performance of Internet delivery over satellite links. The paper also suggests other mechanisms, such as multiple parallel connections and a delta encoding implementation to overcome the above-mentioned problem. We show that there is a marked improvement in Internet browsability and user-perceived delay, using these methods.},
	address = {Baltimore, Maryland},
	booktitle = {37th Conference on Information Sciences and Systems (CISS)},
	organization = {John Hopkins University}
}
@conference {
	title = {Finite Automata Models for Anomaly Detection},
	author = {V. R. Ramezani, Yang, Shahan., Baras, John S.},
	year = {2003},
	month = {03/2003},
	abstract = {A fundamental problem in Intrusion detection is the fusion of dependent information sequences.In this paper ,we consider the fusion of two such sequences ,namely the sequence of system calls and the value of the instruction pointer.We introduce FAAD, a finite automation representation defined for the product alphabet of the two sequences where dependencies are implicitly taken into account by a matching procedure.},
	address = {Baltimore, Maryland},
	booktitle = {37th Conference on Information Sciences and Systems (CISS)},
	organization = {Johns Hopkins University}
}
@conference {
	title = {Detection and Classification of Network Intrusions Using Hidden Markov Models},
	author = {Radosavac, Svetlana., Baras, John S.},
	year = {2003},
	month = {03/2003},
	abstract = {This paper demonstrates that it is possible to model attacks with a low number of states and classify them using Hidden Markov Models with very low False Alarm rate and very few False Negatives. We also show that the models developed can be used for both detection and classification. We put emphasis on detection and classification of network intrusions and attacks using Hidden Markov Models and training on anomalous sequences. We test several algorithms, apply different rules for classification and evaluate the relative performance of these. Several of the attack examples presented exploit buffer overflow vulnerabilities, due to availability of data for such attacks. We emphasize that the purpose of our algorithms is not only the detection and classification of buffer overflows; they are designed for detecting and classifying a broad range of attacks.},
	address = {Baltimore, Maryland},
	booktitle = {37th Conference on Information Sciences and Systems (CISS)},
	organization = {Johns Hopkins University}
}
@conference {
	title = {Fault-tolerance and efficiency considerations for key distribution ~protocols in MANETs},
	author = {Striki, Maria., Baras, John S.},
	year = {2003},
	month = {03/2003},
	abstract = {In this paper we address the Fault-Tolerance and Efficiency of key distribution protocols for group communications in Mobile AdHoc Networks. Most key distribution protocols that exist today are primarily designed for wireline networks. These protocols either fail to work as intended or cannot work at all when they are applied to the demanding environment of MANETs. The main reasons for this are: frequent node failures, network partitions and merges, inefficient computational and communication capabilities of certain wireless nodes, network delay, bad quality of signal etc. We determine the framework under which protocols can efficiently work in MANETs, design new protocols or modify existing ones, so that they can be robust, scalable and applicable in this environment. We classify these protocols in two families: contributory and non-contributory. We evaluate them from the point of view of MANETs and compare their performance.},
	address = {Baltimore, Maryland},
	booktitle = {37th Conference on Information Sciences and Systems(CISS)},
	organization = {Johns Hopkins University}
}
@conference {
	title = {A Probabilistic Emergent Routing Algorithm (PERA) for Mobile Ad Hoc Networks},
	author = {Baras, John S., Mehta, Harsh.},
	year = {2003},
	month = {03/2003},
	abstract = {Mobile ad hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. In this paper we take a novel approach to the routing problem in MANETs by using swarm intelligence-inspired algorithms. The proposed algorithm uses Ant-like agents to discover and maintain paths in a MANET with dynamic topology. We present simulation results that measure the performance of our algorithm with respect to the characteristics of a MANET, the varying parameters of the algorithm itself as well as performance comparison with other well-known routing protocols.},
	address = {Sophia-Antipolis, France},
	booktitle = {WiOpt \&rsquo;03: Modeling and Optimization in Mobile, AdHoc and Wireless Networks}
}
@conference {
	title = {TORA, Verification, Proofs and Model Checking},
	author = {Yang, Shahan., Baras, John S.},
	year = {2003},
	month = {03/2003},
	address = {Sophia-Antipolis, France},
	booktitle = {WiOpt \&rsquo;03: Modeling and Optimization in Mobile, AdHoc and Wireless Networks}
}
