http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Haijun Geng (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Algebra and Algorithms for Multipath QoS Routing in Link State Networks
Haijun Geng,Xingang Shi,Zhiliang Wang,Xia Yin,Shaoping Yin 한국통신학회 2017 Journal of communications and networks Vol.19 No.2
The diversity of quality-of-service (QoS) requirementsof Internet applications motivates various QoS routing algorithmsthat take different QoSmetrics into consideration. Routing algebrahas been proposed as a framework to study the fundamental propertiesof QoS routing algorithms, such as their optimality and loopfreeness. However, for multipath QoS routing, little has been donein these aspects. Existing multipath QoS routing algorithms oftentake a rather conservative approach to guarantee loop-freeness, atthe cost of efficiency. On the other hand, simply adapting existingefficient multipath routing algorithms to support various QoSmetrics cannot guarantee correctness. In face of that, we proposea routing metric algebra for multipath QoS routing in link statenetworks, where a key property of the routing metrics called isotonicity,which plays an important role. To let routers efficientlyand correctly find multiple next-hops for each destination, we alsodevelop two distributed multipath QoS routing algorithms. Thealgorithms are run locally and independently, without exchangingmessages other than the basic link states. They are specifically tailoredfor algebras with strict or non-strict isotonicity, and their correctnessis formally proved.
-
Haijun Geng,Han Zhang,Xingang Shi,Zhiliang Wang,Xia Yin,Ju Zhang,Zhiguo Hu,Yong Wu 한국통신학회 2020 Journal of communications and networks Vol.22 No.1
The internet is playing an increasingly crucial role inboth personal and business activities. In addition, with the emergenceof real-time, delay sensitive and mission-critical applications,stringent network availability requirement is put forward for internetservice providers (ISPs). However, commonly deployed intradomainlink-state routing protocols react to link failures by globallyexchanging link state advertisements and recalculating routingtable, inevitably causing significant forwarding discontinuityafter a failure. Therefore, the loop-free criterion (LFC) approachhas been widely deployed by many ISPs for coping with the singlenetwork component failure scenario in large internet backbones. The success of LFC lies in its inherent simplicity, but this comesat the expense of letting certain failure scenarios go unprotected. To achieve full failure coverage with LFC without incurring significantextra overhead, we propose a novel link protection scheme,hybrid link protection (HLP), to achieve failure resilient routing. Compared to previous schemes, HLP ensures high network availabilityin a more efficient way. HLP is implemented in two stages. Stage one provides an efficient LFC based method (MNP-e). Thecomplexity of the algorithm is less than that of Dijkstra’s algorithmand can provide the similar network availability with LFC. Stage two provides backup path protection (BPP) based on MNP-e,where only a minimum number of links need to be protected, usingspecial paths and packet headers, to meet the network availabilityrequirement. We evaluate these algorithms in a wide spread ofrelevant topologies, both real and synthetic, and the results revealthat HLP can achieve high network availability without introducingconspicuous overhead. HLP not only needs around 10% time ofthat of full protection, but also provides full protection capabilitiesthat full protection provide.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
