Abstract
The future Internet is expected to support multi-cast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. We propose QMRP, a new QoS-aware Multicast Routing Protocol. QMRP achieves scalability by significantly reducing the communication overhead of constructing a multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path routing and multiple-path routing according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast routing algorithm in both intra-domain and inter-domain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of routing without the use of timeout. In addition, QMRP always constructs loop-free multicast trees.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1594-1603 |
| Number of pages | 10 |
| Journal | Proceedings - IEEE INFOCOM |
| Volume | 3 |
| State | Published - Jan 1 2000 |
| Event | 19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications' - Tel Aviv, Isr Duration: Mar 26 2000 → Mar 30 2000 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering
Cite this
QoS-aware multicast routing protocol. / Chen, Shigang; Nahrstedt, Klara; Shavitt, Yuval.
In: Proceedings - IEEE INFOCOM, Vol. 3, 01.01.2000, p. 1594-1603.Research output: Contribution to journal › Conference article
}
TY - JOUR
T1 - QoS-aware multicast routing protocol
AU - Chen, Shigang
AU - Nahrstedt, Klara
AU - Shavitt, Yuval
PY - 2000/1/1
Y1 - 2000/1/1
N2 - The future Internet is expected to support multi-cast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. We propose QMRP, a new QoS-aware Multicast Routing Protocol. QMRP achieves scalability by significantly reducing the communication overhead of constructing a multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path routing and multiple-path routing according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast routing algorithm in both intra-domain and inter-domain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of routing without the use of timeout. In addition, QMRP always constructs loop-free multicast trees.
AB - The future Internet is expected to support multi-cast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. We propose QMRP, a new QoS-aware Multicast Routing Protocol. QMRP achieves scalability by significantly reducing the communication overhead of constructing a multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path routing and multiple-path routing according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast routing algorithm in both intra-domain and inter-domain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of routing without the use of timeout. In addition, QMRP always constructs loop-free multicast trees.
UR - http://www.scopus.com/inward/record.url?scp=0033878604&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033878604&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0033878604
VL - 3
SP - 1594
EP - 1603
JO - Proceedings - IEEE INFOCOM
JF - Proceedings - IEEE INFOCOM
SN - 0743-166X
ER -