Abstract
Current IP routers are stateless: they forward individual packets based on the destination address contained in the packet header, but maintain no information about the application or flow to which a packet belongs. This stateless service model works well for best effort datagram delivery, but is grossly inadequate for applications that require quality of service guarantees, such as audio, video, or multimedia. Maintaining state for each flow is expensive because the number of concurrent flows at a router can be in the hundreds of thousands. Thus, stateful solutions such as Intserv (integrated services) have not been adopted for their lack of scalability. Motivated by this dilemma, we formulate and solve the flow aggregation problem, where we give an efficient algorithm for computing the smallest set of aggregated flows that encode the forwarding state of individual flows. Such aggregation of state information might increase the viability of Intserv-type protocols.
Subhash Suri’s research was supported by NSF under grants ANI 9813723 and CCR-9901958.
Tuomas Sandholm’s research was supported by NSF under CAREER Award IRI-9703122, Grant IRI-9610122, and Grant IIS-9800994.
Priyank Ramesh Warkhede’s research was supported by NSF under grants ANI 9813723 and ANI 9628190.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Adiseshu, S. Suri, and G. Parulkar. Detecting and resolving packet filter conflicts. In Proc. of IEEE INFOCOM, 2000.
R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource reservation protocol (RSVP)-Version 1, functional specification. RFC 2205, September 1997.
A. Brodnik, S. Carlsson, M. Degermark, and S. Pink. Small forwarding table for fast routing lookups. In Proc. of ACM SIGCOMM, 1997.
D.B. Chapman and E.D. Zwicky. Building Internet Firewalls O-Reilly & Associates, Inc., 1995.
W. Cheswick and S. Bellovin. Firewalls and Internet Security Addison-Wesley, 1995.
G. Cheung and S. McCanne. Optimal routing table design for IP address lookups under memory constraints. In Proc. of IEEE INFOCOM, 1999.
R. Daves, C. King, S. Venkatachary, and B. Zill. Constructing optimal IP routing tables. In Proc. of IEEE INFOCOM, 1999.
D. Decasper, Z. Dittia, G. Parulkar, and B. Plattner. Router plugins: A software architecture for next generation routers. In Proc. of ACM SIGCOMM, 1998.
A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Journal of Internetworking Research and Experience, pages 3–26, 1990.
T.V. Lakshman and D. Stidialis. High speed policy-based packet forwarding using efficient multi-dimensional range matching. In Proc. of ACM SIGCOMM, 1998.
Inc. Merit. Routing table snapshot, 14 Jan’ 99, Mae-East NAP. ftp://ftp.merit.edu/statistics/ipma.
J. Mitchell, D. Mount, and S. Suri. Query-sensitive ray shooting. Int. Journal of Computational Geometry & Applications, pages 317–347, 1997.
S. Shenker, R. Braden, and D. Clark. Integrated services in the Internet architechture: an overview. RFC 1633, June 1994.
V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel. Fast scalable level four switching. In Proc. of ACM SIGCOMM, 1998.
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable high speed IP routing lookups. In Proc. of ACM SIGCOMM, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suri, S., Sandholm, T., Warkhede, P.R. (2000). Optimal Flow Aggregation. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_39
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive