Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
An Experimental Study of Probing-Based Admission Control for DiffServ Architectures
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
| Hi-index | 0.00 |
Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network for available service and are admitted or rejected by the host itself according to the performance of the probes. While particular algorithms have been successfully developed to provide a single service, a fundamental resource stealing problem is encountered in multi-class systems. In particular, if the core network provides even rudimentary differentiation in packet forwarding (such as multiple priority levels in a strict priority scheduler), probing flows may infer that the quality-of-service in their own priority level is satisfactory, but may inadvertently and adversely affect the performance of other classes, stealing resources and forcing them into quality-of-service violations. This issue is closely linked to the network scheduler as the performance isolation property provided by multi-class schedulers also introduces limits on observability, or a flow's ability to assess its impact on other traffic classes. In this paper, we study the problem of resource stealing in multi-class networks with end-point probing. For this scalable architecture, we describe the challenge of simultaneously achieving multiple service levels, high utilization, and a strong service model without stealing. We propose a probing algorithm termed Ɛ-probing which enables observation of other traffic classes' performance with minimal additional overhead.We next develop a simple but illustrative Markov model to characterize the behavior of a number of schedulers and network elements, including flow-based fair queueing, class-based weighted fair queueing and rate limiters. Finally, we perform an extensive set of simulation experiments to study the performance tradeoffs of such architectures, and to evaluate the effectiveness of Ɛ-probing.