检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:CHEN Fei WU ChunMing WANG Bin QIAN YaGuan WU XiaoChun
机构地区:[1]College of Computer Science,Zhejiang University [2]College of Science,Zhejiang University of Science and Technology [3]College of Information and Electronic Engineering,Zhejiang Gongshang University
出 处:《Science China(Information Sciences)》2014年第6期109-120,共12页中国科学(信息科学)(英文版)
基 金:supported by National Basic Research Program of China(Grant No.2012CB315903);National High Technology Research and Development Program of China(Grant No.2011AA01A10);National Natural Science Foundation of China(Grant Nos.61103200,61379118);Key Science and Technology Innovation Team Project of Zhejiang Province(Grant No.2011R50010)
摘 要:Load balancing can effectively improve network performance and scalability,but it may cause packet disorder,so worsening the performance.Additionally,without MPLS to establish the desired end-to-end paths,hop-by-hop routing load balancing is more difficult to achieve than the source routing;however,it can significantly improve network performance.In this paper,we propose a load balancing scheme with hop-by-hop routing,by using the burstiness features of flows to make sure that the packets of the same flow arrive at the receiving end in order.Simulation results show that our algorithm can adapt to the dynamic changes of the end-to-end delay and the routing vector,and also can achieve fine-gained load balancing.Load balancing can effectively improve network performance and scalability,but it may cause packet disorder,so worsening the performance.Additionally,without MPLS to establish the desired end-to-end paths,hop-by-hop routing load balancing is more difficult to achieve than the source routing;however,it can significantly improve network performance.In this paper,we propose a load balancing scheme with hop-by-hop routing,by using the burstiness features of flows to make sure that the packets of the same flow arrive at the receiving end in order.Simulation results show that our algorithm can adapt to the dynamic changes of the end-to-end delay and the routing vector,and also can achieve fine-gained load balancing.
关 键 词:load balancing adaptive routing multipath routing traffic engineering packet reordering
分 类 号:TN915.0[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166