AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks

Cui, Jun-Hong; Lao, Li; Faloutsos, Michalis; Gerla, Mário

doi:10.1016/j.comnet.2005.03.003

Cited by 22 publications

(13 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Aggregated QoS Multicast (AQoSM) to provide scalable and efficient QoS multicast in Diff-Serv network is presented in [23]. 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, so that multicast groups can be routed and rerouted very quickly by assigning different labels (e.g., tree IDs) to the packets.…”

Section: Related Workmentioning

confidence: 99%

Multicast routing in mobile ad hoc networks by using a multiagent system

Manvi¹,

Kakkasageri²

2008

Information Sciences

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Multicast routing in mobile ad hoc networks by using a multiagent system

Manvi¹,

Kakkasageri²

2008

Information Sciences

View full text Add to dashboard Cite

“…We suppose that two additive metrics are considered, the values of which are portrayed aside to the different links. We consider the constraint limits to be (6,6). Execution of the first step of mQMA provides the set FPS of shortest paths to d 1 and d 2 .…”

Section: B Mqma On An Examplementioning

confidence: 99%

“…So, the routing structure used to forward data is now a tree and does no longer contain cycles. If the constraints are fixed to (6,6), global aggregation is not possible. In fact, the path (s-d 0 -e-d 1 ) and the path (s-d 0 -e-d 2 ) are not within constraints and so the tree {s-a-d 0 -e-d 1 -d 2 } can not be used to aggregate the whole group.…”

Section: B Mqma Contribution To Solve Cycles Problemmentioning

confidence: 99%

“…Aggregation is based on trees computed by IP multicast routing protocols which use the shortest path tree algorithm optimized on one single metric, typically the hop count. Two solutions have been proposed in the literature to deal with QoS multicast aggregation: AQoSM [6] and Q-STA [7]. The goal of these two algorithms is to aggregate groups to trees while respecting bandwidth requirements of groups.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

mQMA: Multi-Constrained QoS Multicast Aggregation

Ali¹,

Mouliérac

Belghith³

et al. 2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-Traditional IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although this proposition has been well studied, there are still some problems for its deployment. In this paper, we propose a new algorithm mQMA that deals with two important problems of traditional IP multicast, i.e., multicast forwarding state scalability and multi-constrained QoS routing. The algorithm mQMA builds few trees and maintains few forwarding states for the groups thanks to the technique of multicast tree aggregation, which allows several groups to share the same delivery tree. Moreover, the algorithm mQMA builds trees satisfying multiple QoS constraints. We show, trough extensive simulations, that mQMA leverages the same QoS performances as Mamcra which is the main multi-constrained multicast routing algorithm. Moreover, mQMA reduces dramatically the number of trees to be maintained.

show abstract

“…AQoSM [21] and Q-STA [22] achieve tree aggregation in case of bandwidth constraints. In these two algorithms, links have limited bandwidth capacities and the groups have bandwidth requirements depending on the application they are using.…”

Section: B Tree Aggregation Protocolsmentioning

confidence: 99%

Hierarchical Aggregation of Multicast Trees in Large Domains

Mouliérac¹,

Guitton²,

Molnár³

2006

JCM

View full text Add to dashboard Cite

Abstract-Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups to the same distribution tree in order to reduce the total number of multicast forwarding states. In this article, we show that this technique cannot be applied to large domains. Indeed, when the number of border routers is large, actual tree aggregation protocols are unable to find similar groups to aggregate to the same tree. However, by dividing the domain into several smaller sub-domains, we prove that it is possible to achieve important savings. A hierarchical protocol is designed to interconnect the trees of the sub-domains together. While previous protocols cannot cope with more than 25 border routers, our protocol still shows significant benefits for domains with 200 border routers.

show abstract

AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks

Cited by 22 publications

References 51 publications

Multicast routing in mobile ad hoc networks by using a multiagent system

Multicast routing in mobile ad hoc networks by using a multiagent system

mQMA: Multi-Constrained QoS Multicast Aggregation

Hierarchical Aggregation of Multicast Trees in Large Domains

Contact Info

Product

Resources

About