caa a22 4500 47578992X CHVBK 20180406123708.0 cr unu---uuuuu 170329e20001101xx s 000 0 eng 10.1023/A:1019178409003 doi (NATIONALLICENCE)springer-10.1023/A:1019178409003 Scalable domain partitioning in Internet OSPF routing [Elektronische Daten] [Do‐hoon Kim, Dong‐wan Tcha] 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. Kluwer Academic Publishers, 2000 Kim Do‐hoon aut Tcha Dong‐wan aut Telecommunication Systems Kluwer Academic Publishers 15/1-2(2000-11-01), 113-127 1018-4864 15:1-2<113 2000 15 11235 https://doi.org/10.1023/A:1019178409003 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1019178409003 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kim Do‐hoon aut NATIONALLICENCE 700 1- Tcha Dong‐wan aut NATIONALLICENCE 773 0- Telecommunication Systems Kluwer Academic Publishers 15/1-2(2000-11-01), 113-127 1018-4864 15:1-2<113 2000 15 11235 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer