粒度自适应的多径流量分割算法

针对多径传输存在的负载均衡和分组乱序之间的矛盾,提出了一种粒度自适应的多径流量分割算法。该算法在“流分片”的基础上,通过对流量特性的分析,将网络流量区分为正常流和强势流,基于“区分服务”的思想,不同流量分别采用适应其流量特性的流片分割粒度。理论分析和仿真结果表明,在考虑路径时延估计误差的情况下,该算法在降低分组乱序的同时具有良好的负载均衡性能。     

一种基于游标的多径流量分割算法

 多径传输使用多条连接源节点和目的节点的路径进行传输,在提高资源利用率的同时会引起包乱序问题,并且存在路径之间的负载均衡问题.本文提出了一种基于游标的流量分割算法,游标是当前路径传输延迟与相邻包到达源节点的时间差之间的差值,它作为选取路径的延时基线来保证包到达的有序性,游标会随着路径不同或相邻包到达源节点的时间差不同而动态地滑动,通过动态滑动游标使得尽可能多的路径可用来传输当前包,从而很好地实现负载均衡.仿真结果表明,与已有的保证包有序的算法相比,本算法使负载更加均衡.     

On Minimizing Delay with Probabilistic Splitting of Traffic Flow in Heterogeneous Wireless Networks

In the paper,we propose a framework to investigate how to effectively perform traffic flow splitting in heterogeneous wireless networks from a queue point.The average packet delay in heterogeneous wireless networks is derived in a probabilistic manner.The basic idea can be understood via treating the integrated heterogeneous wireless networks as different coupled and parallel queuing systems.The integrated network performance can approach that of one queue with maximal the multiplexing gain.For the purpose of illustrating the effectively of our proposed model,the Cellular/WLAN interworking is exploited.To minimize the average delay,a heuristic search algorithm is used to get the optimal probability of splitting traffic flow.Further,a Markov process is applied to evaluate the performance of the proposed scheme and compare with that of selecting the best network to access in terms of packet mean delay and blocking probability.Numerical results illustrate our proposed framework is effective and the flow splitting transmission can obtain more performance gain in heterogeneous wireless networks.     

Considerations for application‐layer multipath transport control

Multipath transport faces a lot of challenges caused by path diversity, network dynamics, and service diversity. An effective end‐to‐end multipath transport control mechanism becomes essential to efficiently utilize multiple paths. On the base of the general framework of multipath transport system based on application‐level relay proposed in our previous work, this paper presents a multipath transport control mechanism supporting various applications with different transmission requirements. We propose a multipath transport protocol suite, which is extensible and suitable for various applications, and a multipath transport control model in which an application‐dependent splitting granularity named flow block is introduced. Two load distribution models are explored: the earliest idle path first load distribution for reliable data transmission to maximize the data throughput and the packet reordering‐controlled load distribution for real‐time data transmission to minimize the packet reordering thereby reducing end‐to‐end delay and packet loss rate of multipath transport. Simulation results show that the proposed models can effectively improve data throughput for applications with reliable transmission requirements and reduce the total packet loss rate of the destination for applications with real‐time transmission requirements.     

AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing

With this paper, we propose a distributed online traffic engineering architecture formpls networks. In this architecture, a primary and secondarympls lsp are established from an ingresslsr to every other egresslsr. We propose to split thetcp traffic between the primary and secondary paths using a distributed mechanism based onecn marking andaimd-based rate control. Inspired by the random early detection mechanism for active queue management, we propose a random early reroute scheme to adaptively control the delay difference between the primary and secondarylsps. Considering the adverse effect of packet reordering ontcp performance for packet-based load balancing schemes, we propose that thetcp splitting mechanism operates on a per-flow basis. Using flow-based models developed for Internet traffic and simulations, we show that flow-based distributed multi-path traffic engineering outperforms on a consistent basis the case of a single path in terms of per-flow goodputs. Due to the elimination of out-of-order packet arrivals, flow-based splitting also enhancestcp performance with respect to packet-based splitting especially for longtcp flows that are hit hard by packet reordering. We also compare and contrast two queuing architectures for differential treatment of data packets routed over primary and secondarylsps in thempls data plane, namely first-in-first-out and strict priority queuing. We show through simulations that strict priority queuing is more effective and relatively more robust with respect to the changes in the traffic demand matrix than first-in-first-out queuing in the context of distributed multi-path routing.     

Packet reordering is not pathological network behavior

It is a widely held belief that packet reordering in the Internet is a pathological behavior, or more precisely, that it is an uncommon behavior caused by incorrect or malfunctioning network components. Some studies of Internet traffic have reported seeing occasional packet reordering events and ascribed these events to “route fluttering”, router “pauses” or simply to broken equipment. We have found, however, that parallelism in Internet components and links is causing packet reordering under normal operation and that the incidence of packet reordering appears to be substantially higher than previously reported. More importantly, we observe that in the presence of massive packet reordering transmission control protocol (TCP) performance can be profoundly effected. Perhaps the most disturbing observation about TCP's behavior is that large scale and largely random reordering on the part of the network can lead to self-reinforcingly poor performance from TCP     

Dynamic load balancing in WDM packet networks with and without wavelength constraints

We develop load balancing algorithms for WDM-based packet networks where the average traffic between nodes is dynamically changing. In WDM-based packet networks, routers are connected to each other using wavelengths (lightpaths) to form a logical network topology. The logical topology may be reconfigured by rearranging the lightpaths connecting the routers. Our algorithms reconfigure the logical topology to minimize the maximum link load. In this paper, we develop iterative reconfiguration algorithms for load balancing that track rapid changes in the traffic pattern. At each reconfiguration step, our algorithms make only a small change to the network topology hence minimizing the disruption to the network. We study the performance of our algorithms under several dynamic traffic scenarios and show that our algorithms perform near optimally. We further show that these large reconfiguration gains are achievable in systems with a limited number of wavelengths.     

Efficient Load Balancing Algorithms for a Resilient Packet Ring

The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.     

Optimal joint utility based load balancing algorithm for heterogeneous wireless networks

The rapid development of mobile broadband services with continuously increasing traffic volumes has resulted in a number of challenges, including ubiquitous network coverage, high bandwidth, and reliable services for reasonable price, etc. To address these challenges, evolved packet system (EPS) is proposed as the evolution of the packet core network. While resource management and load balancing issues in EPS are discussed in 3GPP standardization, relatively few research works consider mechanism design for load information monitoring and evaluation. Furthermore, even though some load balancing algorithms have been proposed for integrated networks, the load balancing scheme design which achieves the optimization of joint system performance has not been extensively studied. In this paper, an inter-access system anchor based load balancing mechanism is introduced which performs load monitoring and evaluation for access gateways and networks, and an optimal load balancing algorithm is proposed for heterogeneous integrated networks. To characterize the performance of integrated networks, the concept of utility function is introduced and the comprehensive performance of integrated networks which support both single type service and multimedia service is modeled mathematically. Applying vertical handoff as an efficient mechanism for achieving load balancing, the optimal number of handoff users is obtained through solving the optimization problem. Numerical results demonstrate that load balancing between access networks can be achieved, and the optimal number of handoff users corresponding to the maximal joint network utility can be obtained.     

Frame-level traffic splitting for link aggregation in data center networks

Ethernet link aggregation, which provides an easy and cost-effective way to increase both bandwidth and link availability between a pair of devices, is well suited for data center networks. However, all the traffic splitting algorithms used in existing Ethernet link aggregation are flow-level which do not work well owing to the traffic characteristics of data centers. Though frame-level traffic splitting can achieve optimal load balance and the maximum benefits from aggregated capacity, it is generally deprecated in most cases because of frame disordering which can disrupt the operation of many Internet protocols, most notably transmission control protocol (TCP). To address this issue, we first investigate the causes of frame disordering in link aggregation and find that all of them either are no longer true or can be prevented in data centers. Then we present a byte-counter frame-level traffic splitting algorithm which achieves optimal performance while causes no frame disordering. The only requirement is that frames in a flow are the same size which can be easily met in data centers. Simulation results show that the proposed frame-level traffic splitting method could achieve higher throughput and optimal load balance. The average completion time of different sized flows is reduced by 24% on average and by up to 46%.     

应用于无线信道的混合型冲突分解算法

冲突分解算法是一种能够有效改善无线信道多址接入协议性能的方式.传统的冲突分解算法包括树形分解算法和先到先服务的冲突分解算法,但是这两种分解算法都存在着一定的不足.本文提出了一种新型的混合型冲突分解算法(Hybrid Splitting Algorithm-HSA),HSA算法继承了树形分解算法和先到先服务冲突分解算法的优点,不仅考虑了碰撞分组的产生时间,使先产生的分组先得到服务,同时当系统中存在产生间隔比较接近的分组时,采用树形分解算法,使整个分解过程不再仅仅局限于分组的产生时间,从而有效地减少了分解所需的总时隙数,提高了冲突分解算法的性能.理论分析和仿真结果显示HSA算法是一种正确可行的算法.     

Reliable packet transmissions in multipath routed wireless networks

We study the problem of using path diversification to provide low probability of packet loss (PPL) in wireless networks. Path diversification uses erasure codes and multiple paths in the network to transmit packets. The source uses Forward Error Correction (FEC) to encode each packet into multiple fragments and transmits the fragments to the destination using multiple disjoint paths. The source uses a load balancing algorithm to determine how many fragments should be transmitted on each path. The destination can reconstruct the packet if it receives a number of fragments equal to or higher than the number of fragments in the original packet. We study the load balancing algorithm in two general cases. In the first case, we assume that no knowledge of the performance along the paths is available at the source. In such a case, the source decomposes traffic uniformly among the paths; we call this case blind load balancing. We show that for low PPL, blind load balancing outperforms single-path transmission. In the second case, we assume that a feedback mechanism periodically provides the source with information about the performance along each path. With that information, the source can optimally distribute the fragments. We show how to distribute the fragments for minimized PPL, and maximized efficiency given a bound on PPL. We evaluate the performance of the scheme through numerical simulations.     

一种新的用于无线Ad hoc网络中视频传输的多路径包调度算法

该文提出了一种新的在无线Ad hoc网络中进行视频传输的多路径包调度算法(MPPA)。该算法充分考虑到视频流传输的特殊QoS要求,针对视频流中的每个数据包进行操作,通过计算将其指定在某条路径上传输。避免了传统多路径传输中的接收端数据包乱序和重新排序的问题,有效地减小了接收端的启动延时和缓冲区需求。同时仿真结果验证了上述理论的正确性。     

Addressing self-similarity in optical switching networks by means of ant colony optimization

In this work, we propose the use of an Ant Colony Optimization (ACO) algorithm to mitigate packet loss in an optical packet switching network that carries self-similar traffic, which is known to have a great impact in the buffer performance in terms of loss probability as exemplified in this work. By adaptively routing the packets and balancing the network load, we demonstrate by some simulations the effectiveness of this approach when compared with a shortest-path routing scheme, achieving a performance that is comparable to the Poisson traffic scenario in some cases. The proposed algorithm can be used as a viable alternative to traffic shaping techniques.     

Graph-based Lexicalized Reordering Models for Statistical Machine Translation

Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word aligned bilingual corpus,while ignoring the effect of the number of adjacent bilingual phrases.In this paper,we propose a method to take the number of adjacent phrases into account for better estimation of reordering models.Instead of just checking whether there is one phrase adjacent to a given phrase,our method firstly uses a compact structure named reordering graph to represent all phrase segmentations of a parallel sentence,then the effect of the adjacent phrase number can be quantified in a forward-backward fashion,and finally incorporated into the estimation of reordering models.Experimental results on the NIST Chinese-English and WMT French-Spanish data sets show that our approach significantly outperforms the baseline method.     

Load Balancing for Parallel Forwarding

Workload distribution is critical to the performance of network processor based parallel forwarding systems. Scheduling schemes that operate at the packet level, e.g., round-robin, cannot preserve packet-ordering within individual TCP connections. Moreover, these schemes create duplicate information in processor caches and therefore are inefficient in resource utilization. Hashing operates at the flow level and is naturally able to maintain per-connection packet ordering; besides, it does not pollute caches. A pure hash-based system, however, cannot balance processor load in the face of highly skewed flow-size distributions in the Internet; usually, adaptive methods are needed. In this paper, based on measurements of Internet traffic, we examine the sources of load imbalance in hash-based scheduling schemes. We prove that under certain Zipf-like flow-size distributions, hashing alone is not able to balance workload. We introduce a new metric to quantify the effects of adaptive load balancing on overall forwarding performance. To achieve both load balancing and efficient system resource utilization, we propose a scheduling scheme that classifies Internet flows into two categories: the aggressive and the normal, and applies different scheduling policies to the two classes of flows. Compared with most state-of-the-art parallel forwarding schemes, our work exploits flow-level Internet traffic characteristics.     

Routing Strategies to Minimize Packet Loss in an Optical Packet Switched Network with Recirculating FDL Buffers

The major goal of optical packet switching (OPS) is to match switching technology to the huge capacities provided by (D)WDM. We study optical packet switches with recirculating fiber delay line (FDL) buffers. Through simulation, we have assessed the logical performance of a single optical packet router (OPR), focusing on packet loss rate (PLR). By verifying that our scheduling algorithm does not alter the traffic profile characteristics from in- to output, we illustrate how the single node results can be used to assess network-wide performance. We use the capability of assessing end-to-end PLRs to develop network-wide routing algorithms designed to minimize the maximal PLR occurring in the network. In case studies on pan-European networks, we first compare two algorithm variants and thereafter we compare the PLR-based routing algorithm with both load balancing and shortest path routing. While load balancing achieves PLRs that are multiple orders of magnitude lower than shortest path routing, the PLR-based algorithm can reach PLRs up to two orders of magnitude better. The improvement in PLR comes at the price of only a small increase in used bandwidth (a few percent). Subsequently we show that the discussed PLR-based routing algorithm can be easily extended to multiple priorities. By introducing multiple priorities we can keep the loss rates for high priority traffic very low. However, it may lead to an increase of the obtained minimal max-PLR value for low priority traffic. But as we prove this increase to be limited, the cost of introducing multiple priorities is small.     

Strain effects on band structure of wurtzite ZnO： a GGA ＋ U study

Band structures in wurtzite bulk ZnO/Zn1-xMgxO are calculated using first-principles based on the framework of generalized gradient approximation to density functional theory with the introduction of the on-site Coulomb interaction. Strain effects on band gap, splitting energies of valence bands, electron and hole effective masses in strained bulk ZnO are discussed. According to the results, the band gap increases gradually with increasing stress in strained ZnO as an Mg content of Znl-xMgxO substrate less than 0.3, which is consistent with the experimental results. It is further demonstrated that electron mass of conduction band （CB） under stress increases slightly. There are almost no changes in effective masses of light hole band （LHB） and heavy hole band （HHB） along [00k] and [k00] directions under stress, and stress leads to an obvious decrease in effective masses of crystal splitting band （CSB） along the same directions.     

基于最大流的无线mesh网络负载均衡信道分配算法

针对无线mesh网络中各信道间的干扰情况及流量负载均衡问题,定义了负载均衡的目标优化函数,设计一种基于最大流的负载均衡信道分配算法。该算法优先考虑为负载量比较大的链路分配更多的带宽,使得一些关键链路能够承受较大的流量负载,实现各信道的负载均衡,减少网络拥塞,降低分组丢失率和延迟。实验结果表明,该算法较好地平衡了网络负载,在网络业务较重的情况下还能获得较好的网络性能。