210 likes | 393 Views
A QoS-Aware Multicast Routing Protocol. IEEE JSAC DECEMBER 2000 Shigang Chen, Klara Nahrstedt, Yuval Shavitt. Outline. Introduction Related Work QMRP Overview Simulation Result Conclusion. Introduction.
E N D
A QoS-Aware Multicast Routing Protocol IEEE JSAC DECEMBER 2000 Shigang Chen, Klara Nahrstedt, Yuval Shavitt
Outline • Introduction • Related Work • QMRP Overview • Simulation Result • Conclusion
Introduction • Multicast employs a tree structure in the network to efficiently deliver the same data stream to a group of receivers. • It is technically a challenging to deliver multimedia information over a decentralized shared net work environment, especially one that was originally designed for best-effort traffic such as the Internet.
Introduction • QMRP design goals • Scalability • QoS Awareness • Efficiency • Robustness • Operability • Responsiveness • Loop Free
Related Work • Single-Path Routing • CBT(core-based tree) • PIM(protocol independent multicast) • Multiple-Path Routing • Spanning-Join(flooding scheme) • QoSMIC(local search,tree search)
QMRP: QoS-Aware Multicast Routing Protocol • QMRP implements a five-state machine at every node(p.2583-2584) • Initial state(I) • Single path state(SP) • Multiple path state(MP) • Failure state(F) • Success state(S)
QMRP: QoS-Aware Multicast Routing Protocol • Control message • REQUEST • NACK • BREAK • ACK
QMRP: QoS-Aware Multicast Routing Protocol • Data structure • Routing entry(search tree): R{in, out, id, ß} • Multicast entry(multicast tree): M{G, in, out, …}
Restricted QMRP • Maximum Branching Level(MBL) • between the new member and any node in the search tree, there are at most m nodes entering the MP state. • Maximum Branching Degree(MBD) • the maximum number of REQUEST messages that are allowed to be sent by an MP-state node.
Simulation • Performance metrics:
Simulation • Simulation protocols: • SPR,QMPR-m,QoSMIC, spanning-join protocol • Nodes: • 600 • Tree size: • 6,45,180
Conclusion • Authors Proposed QMRP-a new QoS-Aware multicast routing protocol—and showed its superior performance in terms of high success probability and low message overhead. • When many multicast trees exist in the same network region, the cross-effect of the extra network utilization. • To examine the need for rerouting in highly dynamic scenarios where users frequently join and leave.
Conclusion • The adaptation of QMRP to additive requirement, such as delay and loss probability, and the minimization of the state the algorithm is required to keep in the intermediate network nodes. • In wireless environment, we should be considered more things, such like hand-off.