Current mobility management solutions based on ID/Locator separation are not easily deployed and cannot solve routing scalability and mobility problems. This paper proposes a novel network architecture based on ID/Loc...Current mobility management solutions based on ID/Locator separation are not easily deployed and cannot solve routing scalability and mobility problems. This paper proposes a novel network architecture based on ID/Locator separation and suggests a new mobility management solution. This solution solves the problem of scalability in the network and also provides better support for mobility. It can be easily deployed because no modification of the mobile host’s protocol stack is required. The identifier contains some routing information; so the solution provides intrinsic interworking with traditional mobile hosts. Because the mapping systems are distributed to the edge networks, robustness of the whole system is enhanced and handover delay is decreased.展开更多
Congestion may decrease throughput and transfer efficiency of network,and lead to serious degradation of quality of service(QoS)acquired by end users.Present routing adjustment methods against congestion mostly consid...Congestion may decrease throughput and transfer efficiency of network,and lead to serious degradation of quality of service(QoS)acquired by end users.Present routing adjustment methods against congestion mostly consider single-point congestion.They cannot deal with multi-point congestion.This paper presents a probability-based routing adjustment algorithm,which solves the interference problem when several flows are adjusted simultaneously.While multiple points in the network are being or about to be congested,several key flows are rerouted by this algorithm at the same time to make traffic distribution more reasonable so as to avoid congestion.Meanwhile,the algorithm in this paper confines the path length of key flows to avoid QoS reduction due to overlength of key flows.Simulation shows that this method,compared with present algorithms,maintains better load balance and path length.Therefore it effectively increases the throughput of the network.展开更多
基金funded by the European Commission funded ICT-FP7 IP Project EFIPSANS under Grant No. INFSO-ICT-215549the National Basic Research Program of China ("973"Program) under Grant No. 2009CB320504
文摘Current mobility management solutions based on ID/Locator separation are not easily deployed and cannot solve routing scalability and mobility problems. This paper proposes a novel network architecture based on ID/Locator separation and suggests a new mobility management solution. This solution solves the problem of scalability in the network and also provides better support for mobility. It can be easily deployed because no modification of the mobile host’s protocol stack is required. The identifier contains some routing information; so the solution provides intrinsic interworking with traditional mobile hosts. Because the mapping systems are distributed to the edge networks, robustness of the whole system is enhanced and handover delay is decreased.
基金supported by the National Natural Science Foundation of China (Grant Nos.90604019 and 60502037)the National High Technology Research and Development Program of China (Nos.2006AA01Z235 and 2007AA01Z206)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education of China (No.200800131019)Program for New Century Excellent Talents in University。
文摘Congestion may decrease throughput and transfer efficiency of network,and lead to serious degradation of quality of service(QoS)acquired by end users.Present routing adjustment methods against congestion mostly consider single-point congestion.They cannot deal with multi-point congestion.This paper presents a probability-based routing adjustment algorithm,which solves the interference problem when several flows are adjusted simultaneously.While multiple points in the network are being or about to be congested,several key flows are rerouted by this algorithm at the same time to make traffic distribution more reasonable so as to avoid congestion.Meanwhile,the algorithm in this paper confines the path length of key flows to avoid QoS reduction due to overlength of key flows.Simulation shows that this method,compared with present algorithms,maintains better load balance and path length.Therefore it effectively increases the throughput of the network.
