DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, D. | - |
dc.contributor.author | Kim, J. H. | - |
dc.contributor.author | Tcha, Dong Wan | - |
dc.date.accessioned | 2008-05-09T09:33:55Z | - |
dc.date.available | 2008-05-09T09:33:55Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2000 | - |
dc.identifier.citation | INFORMS 2000 Seoul, v., no., pp.1514 - 1522 | - |
dc.identifier.uri | http://hdl.handle.net/10203/4485 | - |
dc.description | This article is confirmed to be submitted through the review and edition of the Korean Operations Research and Management Science Society. Please enter the title (Journal/Proceedings), volume, number, and pages properly when citing the article. | en |
dc.description.abstract | Hierarchical routing mechanisms based on hierarchical partitioning of Internet routing domain, so-called AS(Autonomous System), have been proposed to cope with scalability problems. For ISPs (Internet Service Providers) running link-state routing protocol, it is critical to secure Internet connection to reduce the routing control overhead (for example, synchronizing routing database over routers, etc.) by hierarchically partitioning the AS. However, there are few literatures addressing hierarchical partitioning schemes for link-state Internet routing protocols such as OSPF. Link-state routing protocols require an additional constraint of contiguity for each resulting partitioned area: topological constraint. Also, a subnetwork constituting a AS should not be separated into different partitioned areas. Our goal is to devlop a HC(Hierachical Configuration) method under these constraints by determining the backbone boundary. To achieve this goal, we first devise a conceptual and graphic models of a AS. Then, we formulate the HC issue upon the graph as a combinatorial problem with new additional constraints. The objective is to minimize the backbone size which is crucial to overall stable operation. Finally, we present a heuristic solution method and experiment results. | - |
dc.language | ENG | - |
dc.language.iso | en_US | en |
dc.publisher | The Korean Operations Research and Management Science Society | - |
dc.title | A heuristic method for hierarchical partitioning of link-state Internet routing domain | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 1514 | - |
dc.citation.endingpage | 1522 | - |
dc.citation.publicationname | INFORMS 2000 Seoul | - |
dc.identifier.conferencecountry | United States | - |
dc.identifier.conferencecountry | United States | - |
dc.contributor.localauthor | Tcha, Dong Wan | - |
dc.contributor.nonIdAuthor | Kim, D. | - |
dc.contributor.nonIdAuthor | Kim, J. H. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.