|
|
Buffer Sizing Problem
Until quite recently, Internet routers were widely believed to
need
large buffers. Commercial routers today have huge packet buffers, often
storing millions of packets, under the assumption that large buffers
lead to good statistical multiplexing and hence efficient use of
expensive long-haul links. A widely-used rule-of-thumb states that,
because of the dynamics of TCP's congestion control mechanism, a router
needs a bandwidth-delay product of buffering, in order to fully utilize
bottleneck links. Here, bandwidth refers to the router's capacity, and
delay refers to the average two way propagation delay of packets going
through the router.
We have developed
an analytical model that suggests that router buffers of core routers
could be decreased by about two order of magnitude. This result has
been validated by thousands of ns2 simulations as well as
experiments done on Stanford's dormitory traffic, University of
Wisconsin's WAIL testbed, Internet2, and some commercial operational
backbones. This result has significant implications in router design.
If big electronic routers require only tens of thousands of packet
buffers, it could reduce their complexity, making them easier to build
and easier to scale. A typical router linecard today contains about one
million packet buffers, using many external DRAM chips. The board space
the DRAMs occupy, the pins they require, and the power they dissipate
all limit the capacity of the router. By Reducing the buffer size to
tens of thousands of pacets, then packet buffers could be incorporated
inside the network processor (or ASIC) in a small on-chip SRAM. Not
only would external memories be removed, but it would allow the use of
fast on-chip SRAM, which scales in speed much faster than DRAM.
Recently, we have shown that the under certain constraints we
can
reduce the buffer size of Internet routers even more, to just 10-20
packets without any degradation in performance. While this is an
interesting intellectual exercise in its own right, there would be
practical consequences if it were possible. It could facilitate the
building of all-optical routers. With recent advances, it is now
possible to perform all-optical switching, opening the door to routers
with huge capacity and lower power than electronic routers. Recent
advances in technology make possible optical FCFS packet buffers that
can hold a few dozen packets in an integrated opto-electronic chip.
Larger all-optical buffers remain infeasible, except with unwieldy
spools of optical fiber (that can only implement delay lines, not true
FCFS packet buffers). We are interested in exploring the feasibility of
an operational all-optical network with just a few dozen optical packet
buffers in each router.
Papers
- "Buffer Sizing in All-Optical Packet Switches"
Neda Beheshti, Yashar Ganjali, Ramesh Rajaduray, Daniel Blumenthal, and
Nick McKeown
Submitted.
- "Part III: Routers with very small buffers"
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, and Tim
Roughgarden
ACM/SIGCOMM Computer Communication Revew, 35(3):83
90, July 2005. (PDF)
Extended version: technical report TR05-HPNG-060606, High Performance
Networking Group, Stanford University, June 2005. (PDF)
- "Sizing Router Buffers"
Guido Appenzeller, Isaac Keslassy and Nick McKeown
ACM SIGCOMM 2004, Portland, August 2004. (PDF)
Talks
- "High Performance Networking with Little or No
Buffers"
CAIDA, San Diego, CA, May 5, 2005. (PPT)
Other Interesting Papers
Adaptive Routing and Congestion Control
Deflection Routing
- Costas Busch. O(Congestion+Dilation)
Hot-Potato Routing on Leveled Networks, SPAA'02, August 2002,
Winnipeg, Manitoba, Canada.
- Thierry Chich, Johanne Cohen, and Pierre Fraigniaud, Unslotted
Deflection Routing: A Practical and Efficient Protocol for Multihop
Optical Networks, IEEE/ACM Transactions on Networking, Vol. 9,
No. 1, Feb. 2001
- Bruce Hajek, and Rene L. Cruz. On
the Average Delay for Routing Subject to Independent Deflections,
IEEE Transactions on Information Theory, Vol. 39, No. 1, January 1993.
- Jingyi He, and S.H. Gary Chan. TCP
Performance with Deflection Routing in the Internet, in
Proceedings of IEEE International Conference on Networks (ICON),
Singapore, August 2002, pp. 383-388.
Congestion Control
- Lixia Zhang and Scott Shenker and David D. Clark
Observations on the Dynamics of a Congestion Control Algorithm: The
Effects of Two-Way Traffic, Proceedings of the ACM SIGCOMM,
Sep. 1991, pp. 133-147.
- Scott Shenker, Lixia Zhang, and David D. Clark. Some
Observations on the Dynamics of a Congestion Control Algorithm,
ACM SIGCOMM Computer Communication Review, Vol. 20 , No. 5, Oct. 1990,
pp. 30-39.
- Steven H. Low, Fernando Paganini, and John C. Doyle. Internet
Congestion Control, IEEE Control Systems Magazine, Vol. 22,
No. 1, February 2002, pp. 28-43.
- Raj Jain, Congestion
Control in Computer Networks: Issues and Trends IEEE Network
Magazine, Vol. 4, No. 3, May 1990, pp. 24-30.
- Seungwan Ryu, Christopher Rump, and Chunming Qiao. Advances
in Internet Congestion Control, IEEE Communications Surverys
and Tutorials, Vol. 5, No. 1, Third Quarter 2003, pp. 28-39.
|