Interconnection and routing modeling on ISP services and networksISP 서비스와 네트워크에 관한 상호접속 및 경로설정 모델링

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 781
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Yeong-Dae-
dc.contributor.advisorTcha, Dong-Wan-
dc.contributor.advisor김영대-
dc.contributor.advisor차동완-
dc.contributor.authorChoi, Eun-Jeong-
dc.contributor.author최은정-
dc.date.accessioned2011-12-14T02:40:33Z-
dc.date.available2011-12-14T02:40:33Z-
dc.date.issued2006-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=258100&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/40601-
dc.description학위논문(박사) - 한국과학기술원 : 산업공학과, 2006.8, [ vii, 99 p. ]-
dc.description.abstractThe Internet is a network of networks owned and operated by a very large number of different companies, known as Internet service providers (ISPs). Extensive interconnection between ISPs makes end-users to presume the global connectivity, whenever they log on to the Internet regardless of which ISP services and networks they use. Therefore the issue of ISP interconnection is expected to be more and more important in the Next Generation Network (NGN), wherein the types of services and networks will be far more diversified. In this thesis, we deal with some new interconnection problems on ISP services and networks that can be considered from a single ISP’s perspective. This thesis falls into three parts. The first part deals with a key decision on its network management for a single ISP, which is to determine not only with which other ISPs to interconnect but also under which agreements. For ISPs, there are three common types of interconnection agreements: private peering, public peering and transit. Commonly given as input data in this situation are: a set of Border Gateway Protocol (BGP) addresses with traffic demands to support, and a set of candidate service providers (private peering/transit providers and Internet exchanges) for the interconnection agreements. Each candidate provider is assumed, besides being capacitated, to have the interconnection cost function as well as the routing information for its related agreement plan. The problem then becomes to find a cost-minimizing set of service providers which meets all addresses’ demands without violating both the capacity and the service quality constraints. We show that the problem is NP-hard, and formulate it as a mixed-integer programming model, for which we propose a heuristic algorithm. Extensive computational experience with as many as eight practical instance scenarios shows the remarkable performance of the proposed algorithm of rapidly generating near-optimal solutions. The second part of this t...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectTransit-
dc.subjectNext generation Internet-
dc.subjectEnd-to-End Quality of Service (QoS)-
dc.subjectInteger programming approaches-
dc.subject인터넷 상호접속-
dc.subject동등접속 협약-
dc.subject중계접속 협약-
dc.subject차세대 인터넷-
dc.subject종단간 서비스 품질-
dc.subject정수계획 해법-
dc.subjectInternet interconnection-
dc.subjectPeering-
dc.titleInterconnection and routing modeling on ISP services and networks-
dc.title.alternativeISP 서비스와 네트워크에 관한 상호접속 및 경로설정 모델링-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN258100/325007 -
dc.description.department한국과학기술원 : 산업공학과, -
dc.identifier.uid000995829-
dc.contributor.localauthorKim, Yeong-Dae-
dc.contributor.localauthorTcha, Dong-Wan-
dc.contributor.localauthor김영대-
dc.contributor.localauthor차동완-
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0