Lampros Kalampoukas

Learn More
We describe a new algorithm for rate allocation within the individual switches of an ATM network implementing a rate-based congestion control algorithm for Available Bit-Rate (ABR) traac. The algorithm performs an allocation in (1) time, allowing it to be applied to ATM switches supporting a large number of virtual circuits. When the total available(More)
We study the performance of TCP in an internetwork consisting of both rate-controlled and nonrate-controlled segments. A common example of such an environment occurs when the end systems are part of IP datagram networks interconnected by a rate-controlled segment, such as an ATM network using the available bit rate (ABR) service. In the absence of(More)
The sharing of a common buffer by TCP data segments and acknowledgments in a network or internet has been known to produce the effect of <i>ack compression</i>, often causing dramatic reductions in throughput. We study several schemes for improving the performance of two-way TCP traffic over asymmetric links where the bandwidths in the two directions may(More)
—We discuss a hardware implementation of an explicit rate allocation algorithm for support of Available Bit Rate (ABR) service in ATM switches. We then demonstrate the effectiveness of the algorithm at the network-level through measurements on the actual implementation in a network testbed. The rate allocation algorithm has several desirable properties ,(More)
Loss of the routing protocol messages due to network congestion can cause peering session failures in routers, leading to route flaps and routing instabilities. We study the effects of traffic overload on routing protocols by quantifying the stability and robustness properties of two common Internet routing protocols, OSPF and BGP, when the routing control(More)
  • 1