Beyond best effort: Router architectures for the differentiated services of tomorrow's internet

IEEE Communications Magazine

Volumn 36, Issue 5, 1998, Pages 152-164

  Kumar, Vijay P ^a   Lakshman, T V ^a   Stiliadis, Dimitrios ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; WIDE AREA NETWORKS;

INTERNET SERVICE PROVIDERS (ISP); ROUTER ARCHITECTURES;

TELECOMMUNICATION SERVICES;

EID: 0032069182     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/35.668286     Document Type: Article

References (61)

1. K. C. Claffy, "Internet Traffic Characterization," Ph.D. thesis, UC San Diego, 1994.
2. K. Claffy, C. Polyzos, and H. W. Braun, "Application of Sampling Methodologies to Network Traffic Characterization," Proc. ACM SIGCOMM '93, Sept, 1993, pp. 194-203.
3. R. Jain and S. Routhier, "Packet Trains - Measurements and a New Model for Computer Network Traffic," IEEE JSAC, vol. 4, 1986, pp. 986-95.
4. K. Thomson, G. J. Miller, and R. Wilder, "Wide-Area Traffic Patterns and Characteristics," IEEE Network, Dec. 1997.
5. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% Throughput in an Input-Queued Switch," Proc. INFOCOM '96, Mar. 1996, pp. 296-302.
6. V. Fuller et al., "Classless Inter-Domain Routing," RFC1519, ftp://ds.internic.net/rfc/rfc1519.txt, June 1993.
7. L. Zhang et al., "RSVP: A New Resource Reservation Protocol," IEEE Network, vol. 7, no. 5, Sept. 1993, pp. 8-18.
8. C. Partridge, "Locality and Route Caches," NSF Wksp. on Internet Statistics Measurement and Analysis, San Diego, CA, Feb. 1996.
9. A. Asthana et al., "Design of a Gigabit IP Router," Tech. rep. 11251-911105-09TM, AT&T Bell Labs., Nov. 1991.
10. A. Asthana et al., "Towards a Gigabit IP Router," J. High-Speed Networks, vol. 1, no. 4, 1992.
11. D. Ghosal, T. V. Lakshman, and Y. Huang, "Parallel Architectures for Processing High-Speed Network Signaling Protocols," IEEE/ACM Trans. Networking, Dec. 1995, pp. 716-28.
12. K. Sklower, "A Tree-Based Routing Table for Berkeley Unix," Tech. rep., UC Berkeley, 1993.
13. W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on Longest-Matching Prefixes, IEEE/ACM Trans. Networking, vol. 4, no. 1, Feb. 1996, pp. 86-97.
14. D. C. Feldmeier, "Improving gateway performance with a routing-table cache," Proc. of IEEE INFOCOM '88, New Orleans, LI, March 1988.
15. P. Van Emde Boas, "Preserving Order in a Forest in Less than Logarithmic Time," Proc 76th IEEE Conf. Foundations of Comp. Sci., 1975, pp. 75-84.
16. P. Van Emde Boas, R. Kaas, and E. Zijlstra, "Design and Implementation of an Efficient Priority Queue," Math. Sys. Theory, vol. 10, 1977, pp. 99-127.
17. M. De Berg, M. van Kreveld, and J. Snoeyink, "Two-and Three-Dimensional Point Location in Rectangular Subdivisions," J. Algorithms, vol. 18, 1995, pp. 256-77.
18. M. Waldvogel et al., "Scalable High Speed IP Routing Lookup," Proc. ACM SIGCOMM '97, France, Sept. 1997.
19. M. Degermark et al., "Small Forwarding Tables for Fast Routing Lookups," Proc ACM SIGCOMM '97, France, Sept. 1997.
20. H.-Y. Tzeng, "Longest Prefix Search Using Compressed Trees," Tech. rep. TM, Bell Labs., under submission, 1997.
21. D. Clark, "Service Allocation Profiles," Internet draft, http://www.internic.net/internet-drafts/draft-clark-diff-svc-alloc-00.txt, 1997.
22. K. Nichols and S. Blake, "Differentiated Services Operational Model and Definitions," Internet draft, Feb. 1998. http://ds.internic.net/internet-drafts/draft-nichols-dsopdef-00.txt.
23. B. Chazelle, "How to Search in History," Info. and Control, vol. 64, 1985, pp. 77-99.
24. B. Chazelle and J. Friedman, "Point Location among Hyperplanes and Unidirectional Ray Shooting," Comp. Geometry: Theory and Apps., vol. 4, 1994, pp. 53-62.
25. K. L. Clarkson, "New Applications of Random Sampling in Computational Geometry," Discrete & Comp. Geometry, vol. 2, 1987, pp. 195-222.
26. M. H. Overmars and A. F. van der Stappen, "Range Searching and Point Location among Fat Objects," J. Algorithms, vol. 21, no. 3, 1996, pp. 629-56.
27. T. V. Lakshman and D. Stiliadis, "Packet Classification Algorithms for Gigabit Internet Routers," Tech. Rep. 113470-980202-02T, Lucent Technologies-Bell Labs., Jan. 1998; also to appear, Proc. ACM SIGCOMM '98.
28. T. V. Lakshman and D. Stiliadis, "Packet Classification Algorithms for Gigabit Internet Routers," Tech. Rep. 113470-980202-02T, Lucent Technologies-Bell Labs., Jan. 1998; also to appear, Proc. ACM SIGCOMM '98.
29. T. Li and Y. Rekhter, "Provider Architecture for Differentiated Services and Traffic Engineering (PASTE)," Internet draft, http://www.internic. net/internet-drafts/draft-li-paste-00.txt, 1998.
30. J. Boyle, RSVP Extensions for CIDR Aggregated Data Flows, Internet draft, http://www.internic.net/internet-drafts/draft-ietf-rsvp-cidr-ext-01. txt, 1997.
31. D. Estrin et al., "Protocol Independent Multicast - Sparse Mode," Protocol spec. RFC 2117, June 1997.
32. D. Waitzman, C. Partridge, and S. Deering, "Distance Vector Multicast Routing Protocol," RFC 1075, ftp://ds.internic.net/rfc/rfc1075.txt, June 1993.
33. S. J. Golestani, "A Self-Clocked Fair Queuing Scheme for Broadband Applications," Proc. IEEE INFOCOM '94, Apr. 1994, pp. 636-46.
34. D. Stiliadis and A. Varma, "Design and Analysis of Frame-Based Fair Queuing: A New Traffic Scheduling Algorithm for Packet-Switched Networks," Proc. ACM SIGMETRICS '96, http://www.cse.ucsc.edu/research/hsnlab/publications/, May 1996, pp. 104-15.
35. B. Braded et al., "Recommendations on Queue Management and Congestion Avoidance in the Internet," Internet draft. Mar. 1997.
36. B. Suter et al., "Design Considerations for Supporting TCP with Per-Flow Queuing," Proc. IEEE INFOCOM '98, San Francisco, CA, 1998.
37. B. Suter et al., "Efficient Active Queue Management for Internet routers," Proc. Interop Engineers Conf., Las Vegas, NV, May 1998.
38. D. Lin and R. Morris, "Dynamics of Random Early Detection," Proc. ACM SIGCOMM '97, Sept. 1997.
39. D. D. Clark, S. Shenker, and L. Zhang, "Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism," Proc. ACM SIGCOMM '92, Aug. 1992, pp. 14-26.
40. S. Floyd and V. Jacobson," Link Sharing and Resource Management Models for Packet Networks," IEEE/ACM Trans. Networking, vol. 3, no. 4, Aug. 1995, pp. 365-86.
41. J. C. R. Bennett and H. Zhang, "Hierarchical Packet Fair Queuing Algorithms," Proc ACM SIGCOMM '96, Palo Alto, CA, Aug. 1996, pp. 143-56.
42. D. Stiliadis and A. Varma, "A General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms," Proc. IEEE INFOCOM '97, 1997.
43. P. Newman, T. Tylon, and G. Minshall, "Flow Labelled IP: A Connectionless Approach to ATM," Proc. IEEE INFOCOM '96, San Francisco, CA, Apr. 1996, pp. 1251-60.
44. A. K. Parekh and R. G. Gallager, "A Generalized Processor Sharing Approach to Flow Control - The Single Node Case," Proc. INFOCOM '92, vol. 2, May 1992, pp. 915-24.
45. A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm," Internetworking: Res. and Experience, vol. 1, no. 1, 1990, pp. 3-26.
46. D. Stiliadis and A. Varma, "Rate-Proportional Servers: A Design Methodology for Fair Queuing Algorithms," IEEE/ACM Trans. Networking, Apr. 1998.
47. S. Shenker, L. Zhang, and D. D. Clark, "Some Observations on the Dynamics of a Congestion Control Algorithm," Comp. Commun. Rev., Oct. 1990, pp. 30-39.
48. L. Zhang, S. Shenker, and D. D. Clark, "Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic," Proc. ACM SIGCOMM '91, 1991, pp. 133-47.
49. T. V. Lakshman and U. Madhow, "The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss," IEEE/ACM Trans. Networking, June 1997.
50. S. Floyd and V. Jacobson, "Random Early Detection Gateways for Congestion Avoidance," IEEE/ACM Trans. Networking, Aug. 1993.
51. S. Floyd and V. Jacobson," "On Traffic Phase Effects in Packet Switched Gateways," Internetworking: Res. and Experience, vol. 3, no. 3, Sept. 1992, pp. 115-56.
52. L. Zhang, "A New Architecture for Packet Switching Network Protocols," Ph.D. thesis, MIT Comp. Sci., Cambridge, MA, 1989.
53. T. J. Ott, M. Mathis, and J. H. B. Kemperman, "The Stationary Behavior of Ideal TCP Congestion Avoidance," ftp://ftp.bellcore.com/pub/tjo/TCPwindow.ps, 1996.
54. T. V. Lakshman, U. Madhow, and B. Suter, "Window-Based Error Recovery and Flow Control with a Slow Acknowledgment Channel: A Study of TCP/IP Performance," Proc. IEEE INFOCOM '97, Kobe, Japan, Apr. 1997.
55. T. V. Lakshman, A. Neidhart, and T. J. Ott, "The Drop-from-Front Strategy in TCP over ATM and Its Interworking with Other Control Features," Proc. IEEE INFOCOM '96, San Francisco, CA, 1996, pp. 1242-50.
56. F. A. Tobagi, "Fast Packet Switch Architectures for Broadband Integrated Services Digital Networks," Proc. IEEE, vol. 78, no. 1, Nov. 1990, pp. 133-67.
57. F. M. Chiussi, J. G. Kneuer, and V. P. Kumar, "Low-Cost Scalable Switching Solutions for Broadband Networks," IEEE Commun. Mag., vol. 35, no. 12, Dec. 1997, pp. 36-43.
58. F. M. Chiussi, "Design, Performance and Implementation of a Three-Stage Banyan-Based Architecture with Input and Output Buffers for Large Fast Packet Switches," Tech. rep. CSL-TR-93-573, CSL, Stanford, CA, June 1993.
59. T. E. Anderson et al., "High Speed Switch Scheduling for Local Area Networks," ACM Trans. Comp. Sys., vol. 11, no. 4, Nov. 1993, pp. 319-52; also, Digital Systems Research Center tech. rep. no. 99 .
60. T. E. Anderson et al., "High Speed Switch Scheduling for Local Area Networks," ACM Trans. Comp. Sys., vol. 11, no. 4, Nov. 1993, pp. 319-52; also, Digital Systems Research Center tech. rep. no. 99 .
61. D. Stiliadis and A. Varma, "Providing Bandwidth Guarantees in an Input-Buffered Crossbar Switch," Proc. INFOCOM '95, Apr. 1995.