NETBLT: a high throughput transport protocol
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
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
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
Part I: buffer sizes for core routers
ACM SIGCOMM Computer Communication Review
Part II: control theory for buffer sizing
ACM SIGCOMM Computer Communication Review
The open network laboratory: a resource for networking research and education
ACM SIGCOMM Computer Communication Review
Tmix: a tool for generating realistic TCP application workloads in ns-2
ACM SIGCOMM Computer Communication Review
Practical packet pacing in small-buffer networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
High-performance implementation of in-network traffic pacing for small-buffer networks
Computer Communications
Hi-index | 0.00 |
For the optical packet-switching routers to be widely deployed in the Internet, the size of packet buffers on routers has to be significantly small. Such small-buffer networks rely on traffic with low levels of burstiness to avoid buffer overflows and packet losses. We present a pacing system that proactively shapes traffic in the edge network to reduce burstiness. Our queue length based pacing uses an adaptive pacing on a single queue and paces traffic indiscriminately where deployed. In this work, we show through analysis and simulation that this pacing approach introduces a bounded delay and that it effectively reduces traffic burstiness. We also show that it can achieve higher throughput than end-system based pacing.