IEEE/ACM Transactions on Networking (TON)
A measurement-based admission control algorithm for integrated services packet networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
QoSMIC: quality of service sensitive multicast Internet protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Hop by hop multicast routing protocol
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Measurement-Based Admission Control for Dynamic Multicast Groups in Diff-Serv Networks
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
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Differentiated Services and Integrated Services Use of MPLS
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Measuring and modelling the group mmbership in the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
DSMCast: a scalable approach for DiffServ multicasting
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Communications Magazine
A survey of QoS multicasting issues
IEEE Communications Magazine
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
QUASIMODO: quality of service-aware multicasting over DiffServ and overlay networks
IEEE Network: The Magazine of Global Internetworking
An architecture for scalable, efficient, and fast fault-tolerant multicast provisioning
IEEE Network: The Magazine of Global Internetworking
Multicast routing in mobile ad hoc networks by using a multiagent system
Information Sciences: an International Journal
Edge overlay multicast to support comparable multi-class services
Journal of High Speed Networks
QoS multicast aggregation under multiple additive constraints
Computer Communications
Hi-index | 0.00 |
The deployment of IP multicast support is impeded by several factors among which are the state scalability problem, the cumbersome management and routing, and the difficulty of supporting QoS. In this paper, we propose an architecture, called Aggregated QoS Multicast (AQoSM), to provide scalable and efficient QoS multicast in Diff-Serv networks. The key idea of AQoSM is to separate the concept of groups from the concept of distribution tree by "mapping" many groups to one distribution tree. In this way, multicast groups can now be routed and rerouted very quickly by assigning different labels (e.g., tree IDs) to the packets. Therefore, we can have load-balancing and dynamic rerouting to meet QoS requirements. In addition, the aggregation of groups on fewer trees leads to routing state reduction and less tree management overhead. Thus, AQoSM enables multicast to be seamlessly integrated into Diff-Serv without violating the design principle of Diff-Serv of keeping network core "QoS stateless" and without sacrificing the efficiency of multicast. Finally, efficient resource utilization and strong QoS support can be achieved through statistical multiplexing at the level of aggregated trees. We design a detailed MPLS-based AQoSM protocol with efficient admission control and MPLS multicast tree management. By simulation studies, we show that our protocol achieves significant multicast state reduction (up to 82%) and tree maintenance overhead reduction (up to 86%) with modest (12%) bandwidth overhead. It also reduces the blocking ratio of user requests with strong QoS requirements due to its load balancing and statistical multiplexing capabilities.