Dissertation > Excellent graduate degree dissertation topics show

IP network link weight optimization method study

Author: LiuZuo
Tutor: XuShiZhong
School: University of Electronic Science and Technology
Course: Communication and Information System
Keywords: IP network Link weight optimization Multi-constraint Full Capacity Planning Incremental planning
CLC: TN915.02
Type: Master's thesis
Year: 2011
Downloads: 31
Quote: 1
Read: Download Dissertation

Abstract

With the Internet communications services from a single support point-to-point best effort to support multi-service conversion , able to arrange for service routing , traffic engineering to optimize network resources more and more attention of network service providers . Traditional MPLS - TE routed LSPs build support , so as to control the routing of different businesses . The study shows that the MPLS-TE planning acyclic LSP can be converted to the IP network corresponds to a group of link weights collection shorted . IP-TE link weight optimization based on business needs , be able to avoid the complexity of MPLS-TE , is the focus of this study . For today 's IP networks large volume of business , the characteristics of multi- QoS requirements , this paper first discusses multiple constraints , the planning of the full amount of the IP network link weight issues , raised the amount of a business to determine the case of IP network link weight full amount of planning algorithms . Path algorithm to support a variety of business constraints constraints , including business constraints ( the constraint of the number of hops , latency constraints ) , link constraints ( service level constraints) , node constraints (ECMP number of constraints) . The algorithm uses a large number of dynamic update thinking has high efficiency , optimize performance and good . In IP networks , the business changes may result in network performance , then the need for network incremental planning . Incremental planning in IP networks , the link weight adjustment will result in route needs to be re- convergence , which may lead to route flapping , the emergence of the loops are . Need to adjust the weights , the number of links in order to reduce the incremental configuration of the network , thereby to reduce routing shock loop by the possibility of the purpose , this article introduces a guarantee under the premise of the QoS and network load balancing . the algorithm makes it necessary to adjust the weight of the link to minimize the number . When the IP network link weights need to be adjusted , adjustment may be carried out batchwise , i.e. not all need to adjust the weight of a link re - re-setting , instead of using each adjustment part of the link weight portionwise completed Reset all need to adjust the link weights . In order to make the batch process to adjust the link weights network congestion occurs , so that the business can smooth migration , this paper proposes a need to adjust the link weights known algorithm to determine the link weight adjustment order .

Related Dissertations

CLC: > Industrial Technology > Radio electronics, telecommunications technology > Communicate > Communication network > General issues > Communication network structure and design
© 2012 www.DissertationTopic.Net Mobile