DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Dan-Keun | - |
dc.contributor.advisor | 성단근 | - |
dc.contributor.author | Sohn, Kyu-Seek | - |
dc.contributor.author | 손규식 | - |
dc.date.accessioned | 2011-12-14 | - |
dc.date.available | 2011-12-14 | - |
dc.date.issued | 2003 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=231126&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/35176 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2003.8, [ vii, 97 p. ] | - |
dc.description.abstract | This dissertation is concerned with network reliability and minimization of network redundancy in Internet using MPLS technology for its backbone networks. Multiprotocol label switching (MPLS) is expected to support QoS guarantees and traffic engineering in Internet backbone networks. Spare bandwidth reduction is important in MPLS networks where a preplanned network fault protection is required for fast restoration. In this dissertation, a distributed label switched path (D-LSP) scheme utilizing multiple parallel disjoint routes between a node pair is proposed to reduce spare bandwidth and total network cost. First, the D-LSP scheme is proposed. LSP partitioning which is a main mechanism of D-LSP scheme, is defined and analyzed in a specific MPLS network. In the proposed D-LSP scheme, demand traffic is partitioned and distributed over a set of sub-LSPs each of which is established on the disjoint routes. A demand traffic partitioning and distribution algorithm is derived from a specific MPLS network model. The partitioning of demand traffic in the D-LSP scheme yields a degradation in statistical multiplexing gain and thus, a trade-off between spare bandwidth reduction and increase in effective bandwidth required by each sub-LSP is investigated. The capability to reduce the network cost of the proposed D-LSP scheme is numerically analyzed and compared with the conventional LSP (C-LSP) scheme in which demand traffic is carried by a single LSP established between a end node pair. Second, the cost minimization problem in establishment of a D-LSP is formulated mathematically and the optimum solution is found in terms of the number of sub-LSPs and bandwidth distribution vector through a series of mathematical manipulation. The degradateion of statistical multiplexing gain is involved as a constraint of the cost minimization problem. Mathematical analysis of the proposed D-LSP scheme results in an algorithm finding the optimum number of sub-LSPs and bandwidth distr... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | spare bandwidth reduction | - |
dc.subject | Distirubed label switched path | - |
dc.subject | statistical spare bandwidth sharing | - |
dc.subject | 통계적예비대역공유 | - |
dc.subject | 예비대역폭절감 | - |
dc.subject | 분산레이블교환경로 | - |
dc.title | Distributed label switched paths based MPLS network | - |
dc.title.alternative | 분산 레이블 교환 경로에 기반한 멀티프로토콜 레이블 교환 네트워크 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 231126/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 000949030 | - |
dc.contributor.localauthor | Sung, Dan-Keun | - |
dc.contributor.localauthor | 성단근 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.