[ General info
| People | Papers&Presentations | Ns code | Linux code ]
Service prioritization
among different traffic classes is an important goal for the future Internet.
Conventional approaches to solving this problem consider the existing
best-effort class as the low-priority class, and attempt to develop mechanisms
that provide ``better-than-best-effort" service. We explore the opposite
approach, and devise a new distributed algorithm to realize a low-priority
service (as compared to the existing best effort) from the network endpoints.
To this end, we develop TCP Low Priority (TCP-LP), a distributed algorithm
whose goal is to utilize only the excess network bandwidth as compared to the
``fair share" of bandwidth as targeted by TCP. The key mechanisms unique
to TCP-LP congestion control are the use of one-way packet delays for
congestion indications and a TCP-transparent congestion avoidance policy.
On the other hand,
HSTCP-LP (High-Speed TCP Low Priority) is an advanced TCP version targeted
towards fast long-distance networks (i.e., networks operating at 622 Mb/s, 2.5 Gb/s, or 10 Gb/s and spanning
several countries or states).� HSTCP-LP
is a TCP-LP version with aggressive window increase policy. More details on
HSTCP-LP could be found below.�
Top
- MEE Student:
YuZen
Chen (Alumni)
Top
- TCP-LP: Low-Priority Service
via End-Point Congestion Control
A. Kuzmanovic and E. W. Knightly
Submitted to IEEE/ACM Transactions on Networking, September 2003.
Journal version of the TCP-LP paper that includes
Internet experiments.
Top
- TCP-LP: A Distributed Algorithm
for Low Priority Data Transfer
A. Kuzmanovic and E. W. Knightly
IEEE INFOCOM 2003
San Francisco, CA, April 2003
Available as ppt.
Top
- Ns-2 TCP-LP code and simulation scripts could be
found here.
Top
- An implementation of TCP-LP in Linux can be
found here.
- An implementation of HSTCP-LP in Linux can be
found here.
Top
December, 2004, Aleksandar Kuzmanovic