T. V. Lakshman

Learn More
This paper examines the performance of TCP/IP, the Internet data transport protocol, over wide-area networks (WANs) in which data traffic could coexist with real-time traffic such as voice and video. Specifically, we attempt to develop a basic understanding, using analysis and simulation, of the properties of TCP/IP in a regime where: 1) the bandwidth-delay(More)
This paper describes a mechanism we call “SRED” (Stabilized Random Early Drop). Like RED (Random Early Detection) SRED pre-emptively discards packets with a load-dependent probability when a buffer in a router in the Internet or an Intranet seems congested. SRED has an additional feature that over a wide range of load levels helps it stabilize its buffer(More)
Packet content scanning at high speed has become extremely important due to its applications in network security, network monitoring, HTTP load balancing, etc. In content scanning, the packet payload is compared against a set of patterns specified as regular expressions. In this paper, we first show that memory requirements using traditional methods are(More)
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding future requests. This problem is motivated by service provider needs for fast deployment of bandwidth guaranteed services and the consequent need in backbone networks for fast(More)
This paper present new algorithms for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding future requests. This problem is motivated by service provider needs for fast deployment of bandwidth guaranteed services. Offline routing algorithms cannot be used since they(More)
The ability to provide differentiated services to users with widely varying requirements is becoming increasingly important, and Internet Service Providers would like to provide these differentiated services using the same shared network infrastructure. The key mechanism, that enables differentiation in a connectionless network, is the packet classification(More)
Absrrucr-Tbh paper presents new algorithms. for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-bywith no a priori knowledge of future arrivals, and so necessitating use of on-line algorithms Restorabllity implies that to s u d y route a path set-up request both 90 d v e path and an(More)
We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages that can be successfully sent over the network without knowing any information regarding future message arrivals or message generation rates. From a theoretical perspective, we show(More)
In today's Internet, worms and viruses cause service disruptions with enormous economic impact. Current attack prevention mechanisms rely on end-user cooperation to install new system patches or upgrade security software, yielding slow reaction time. However, malicious attacks spread much faster than users can respond, making effective attack prevention(More)