Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
What TCP/IP protocol headers can tell us about the web
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Endpoint admission control with delay variation measurements for QoS in IP networks
ACM SIGCOMM Computer Communication Review
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The power of explicit congestion notification
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Why flow-completion time is the right metric for congestion control
ACM SIGCOMM Computer Communication Review
A distributed traffic control scheme based on edge-centric resource management
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
Over the last decade, numerous admission control schemes have been studied to allocate network resources. Although per-flow control schemes can provide guaranteed QoS, such schemes face scalability issues in large networks due to the tremendous number of flows present. While aggregation-based approaches such as Differentiated Services relieve the storage of state in the core, admission control of flows, especially short-lived flows, is still a serious bottleneck. To that end, we propose an admission control scheme, Fast Admission for Short Flows (FASF), that enables accelerated admission control at the edge rather than via centralized or in-path mechanisms. FASF not only reduces the burden on admission control by largely distributing the dominant resource requests (i.e. short-lived flows), but also improves flow completion time and hence network goodput.