Scalable domain partitioning in internet OSPF routing

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 628
  • Download : 5
This paper addresses the scalability problem arising from rapidly increasing routing overhead at network expansion. Focusing on the OSPF (Open Shortest Path First) protocol, we propose a hierarchical routing scheme of partitioning a routing domain into areas. Supplemented to the scheme is a step to reinforce system performances, particularly reliability, against possible degradation from domain partitioning. For an Internet service provider with its own domain, the framework provides a practical vehicle for scalable hierarchical routing indispensable to overall service quality. Due to the unavailability of similar studies, a simple experiment with a small network is reported on, in place of extensive comparative testing.
Publisher
BALTZER SCI PUBL BV
Issue Date
2000-11
Language
English
Article Type
Article; Proceedings Paper
Keywords

NETWORKS

Citation

TELECOMMUNICATION SYSTEMS, v.15, no.1-2, pp.113 - 127

ISSN
1018-4864
URI
http://hdl.handle.net/10203/4271
Appears in Collection
MT-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0