Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Source-level IP packet bursts: causes and effects
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Part III: routers with very small buffers
ACM SIGCOMM Computer Communication Review
Link Buffer Sizing: A New Look at the Old Problem
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
Packet Switch Architectures for Very Small Optical RAM
INTERNET '09 Proceedings of the 2009 First International Conference on Evolving Internet
| Hi-index | 0.00 |
According to a historical rule of thumb, which is widely used in routers, the buffer size of each output link of a router should be set to the product of the bandwidth and the average round-trip time. However, it is very difficult to satisfy this buffer requirement for ultra-high-speed dense wavelength division multiplexing (DWDM) networks with the current technology. Recently, many researchers have challenged the rule of thumb and have proposed various buffer sizing strategies requiring less buffer. Most of them were proposed for electronic routers with input and output buffering. However, shared buffering is a strong candidate for future DWDM optical packet switching (OPS) networks because of its high efficiency. As all links use the same buffer space, the wavelength count and nodal degree have a big impact on the size requirements of shared buffering. In this paper, we present a new buffer scaling rule showing the relationship between the number of wavelengths, nodal degree, and the required shared buffer size. By an extensive simulation study, we show that the buffer requirement increases with O(N^0^.^8^5W^0^.^8^5) for both standard TCP and paced TCP, while XCP-paced TCP's buffer requirement increases with O(N^1W^0^.^8^5) for a wide range of N and W, where N is the nodal degree and W is the number of wavelengths.