http://iet.metastore.ingenta.com
1887

Routing state reduction in multicast protocols

Routing state reduction in multicast protocols

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

To improve the scalability of multicast protocols, a simple yet novel technique, called the dynamic overlap tree path (DOTP), is proposed. According to the simulation results, the overall average forwarding state-table size can be reduced by ~30 %.

References

    1. 1)
      • Deering, S.E.: `Multicast routing in a datagram internetwork thesis', December 1991, PhD, Stanford University.
    2. 2)
      • Tian, J., Neufeld, G.: `Forwarding state reduction for sparse mode multicast communication', IEEE INFOCOM 98, p. 711–719.
    3. 3)
      • Wei, L., Estrin, D.: `The trade-offs of multicast trees and algorithms', Proc. 1994 Int. Conf. Computer Communications networks, 12–14 September 1994.
    4. 4)
      • Sheng, : `Dynamic overlap tree path', Technical report, 1998.
    5. 5)
      • Ballardie, A.: `Core based trees (CBT version 2) multicast routing protocol specification', RFC 2189, September 1997.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990667
Loading

Related content

content/journals/10.1049/el_19990667
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address