loading...
Group leader election under link-state routing
Atlanta, GA October 28-October 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNP.1997.643696Fifth International Conference on Net ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yih Huang, Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
P.K. McKinley, Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
In this work, we place the problem of group leader election in a context "inside the network," meaning that participants in the election process are network switches/routers, rather than hosts. A robust solution to the problem, called the Network Leader Election (NLE) protocol, is proposed for use in networks based on link-state routing (LSR). The protocol is robust, for it achieves leadership consensus in the presence of adverse events, such as leader failures and network partitioning. The correctness of the protocol can be proved formally. A simulation study reveals that the NLE protocol incurs low overhead in handling leader failures and in group creation. In addition, it is shown how important network functions, including hierarchical routing, address resolution, and multicast core management, can benefit from the NLE protocol.
Index Terms:
transport protocols; group leader election; link-state routing; network switches; routers; network leader election protocol; leadership consensus; leader failures; network partitioning; simulation study; address resolution; multicast core management
Citation:
Yih Huang, P.K. McKinley, "Group leader election under link-state routing," icnp, pp.95, Fifth International Conference on Network Protocols (ICNP'97), 1997
Usage of this product signifies your acceptance of the Terms of Use.