Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A technique for counting natted hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
IEEE Network: The Magazine of Global Internetworking
Brief paper: A neuro-adaptive congestion control scheme for round trip regulation
Automatica (Journal of IFAC)
One bit is enough: a framework for deploying explicit feedback congestion control protocols
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Congestion control with multipacket feedback
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The addition of the two-bit Explicit Congestion Notification (ECN) field to the IP header provides routers with a mechanism for conveying link price information necessary for the successful operation of a number of congestion control schemes. Two recent proposals for probabilistic packet marking at the routers allow receivers to estimate path price from the fraction of marked packets. In this paper we introduce an alternative deterministic marking scheme for encoding path price. Each router quantizes the price of its outgoing link to a fixed number of bits. Every data packet sent along the path encodes a partial sum of the quantized link prices in its ECN field, allowing the receiver to estimate the path price. We evaluate the performance of our algorithm in terms of its error in representing prices, and compare it to probabilistic marking. We show that based on empirical Internet traffic characteristics, our algorithm performs better when estimating time-varying prices and static path price using small blocks of packets.