A mobile routing mechanism based on path information of an aircraft in ATN

2008 ◽  
Author(s):  
Qingwei Li ◽  
Zhanchun Gao ◽  
Yanjun Jiang ◽  
Xiuqin Lin
Keyword(s):  
Path Information ◽  
Routing Mechanism

scholarly journals A port-based forwarding load-balancing scheduling approach for cloud datacenter networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Zhiyu Liu ◽  
Aqun Zhao ◽  
Mangui Liang
Keyword(s):  
Load Balancing ◽  
Network Size ◽  
Edge Computing ◽  
Cloud Services ◽  
Link Utilization ◽  
Datacenter Networks ◽  
Path Information ◽  
Routing Mechanism ◽  
High Dynamic ◽  
Cloud Datacenter

AbstractToday’s datacenter networks (DCNs) scale is rapidly increasing because of the wide deployment of cloud services and the rapid rise of edge computing. The bandwidth consumption and cost of a DCN are growing sharply with the extensions of network size. Thus, how to keep the traffic balanced is a key and challenging issue. However, the traditional load balancing algorithms such as Equal-Cost Multi-Path routing (ECMP) are not suitable for high dynamic traffic in cloud DCNs. In this paper, we propose a port-based forwarding load balancing scheduling (PFLBS) approach for Fat-tree based DCNs with some new features which can overcome the disadvantages of the existing load balancing methods in the following aspects. Firstly, we define a port-based source-routing addressing scheme, which decreases the switch complexity and makes the table-lookup operation unnecessary. Secondly, based on this addressing scheme, we proposed an effective routing mechanism which can obtain multiple available paths for flow scheduling based in Fat-tree. All the path information is saved in servers and each server only needs to maintain its own path information. Thirdly, we propose an efficient algorithm to implement large flows scheduling dynamically in terms of current link utilization ratio. This method is suitable for cloud DCNs and edge computing, which can reduce the complexity of the switches and the power consumption of the whole network. The experiment results indicate that the PFLBS approach has better performance compared with the ECMP, Hedera and MPTCP approaches, which decreases the flow completion time and improves the average throughput significantly. PFLBS is simple and can be implemented with a few signaling overheads.

Risk Balancing Based Routing Mechanism for Power Communications Service

2014 ◽  
Vol 35 (6) ◽  
pp. 1318-1324 ◽  
Author(s):  
Qing-tao Zeng ◽  
Xue-song Qiu ◽  
Shao-yong Guo ◽  
Feng Qi ◽  
Luo-ming Meng
Keyword(s):  
Routing Mechanism

Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai
Keyword(s):  
Routing Protocol ◽  
Vehicular Networks ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Network Routing ◽  
On Demand ◽  
Routing Mechanism ◽  
Demand Routing ◽  
On The Road ◽  
Low Efficiency

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

Sign in / Sign up

Export Citation Format

Share Document