Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Design and implementation of scalable edge-based admission control
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS for IP networks
Utilization-Based Admission Control for Scalable Real-Time Communication
Real-Time Systems
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Distributed Bandwidth Broker for QoS Multicast Traffic
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Evaluation of Bandwidth Broker Signaling
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services
IEEE Transactions on Parallel and Distributed Systems
Secure communications between bandwidth brokers
ACM SIGOPS Operating Systems Review
IEEE Journal on Selected Areas in Communications
Internet2 QBone: building a testbed for differentiated services
IEEE Network: The Magazine of Global Internetworking
Mitigating denial of capability attacks using sink tree based quota allocation
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up within this architecture has not been well established. In this paper we explore the possibility of a scalable QoS flow set-up using a sink-tree paradigm. The paradigm initially constructs a sink tree at each egress edge router using network topology and bandwidth information provided by a QoS extended version of Open Shortest Path First (OSPF), which is a widely used link-state routing protocol. Our sink-tree paradigm dynamically reallocates network bandwidths online according to traffic demands. As a consequence, our paradigm easily supports QoS routing, resource allocation, and admission control at ingress edge routers without consulting core routers in a way that the QoS flow set-up time and overhead are minimized. Simulation results are very encouraging in that the proposed methodology requires significantly less communication overhead in setting up QoS flows compared to the traditional per-flow signaling-based methodology while still maintaining high resource utilization.