Candidate Path Selection Method for TCP Performance Improvement in Fixed Robust Routing

Yukinobu Fukushima,Takashi Matsumura,Kazutaka Urushibara,Tokumi Yokohira 대한전자공학회 2016 IEIE Transactions on Smart Processing & Computing Vol.5 No.6

Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

End-to-end Reliable Message Transmission Considering Load Balancing in Wireless Networks

( Anh Tai Tran ),( Myung Kyun Kim ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.9

This paper proposes a load balanced reliable routing protocol called LBR (Load Balanced Reliable routing) in wireless networks. The LBR protocol transmits messages through a reliable path considering the balancing of the traffic load. Recently, the authors have proposed a multipath-based reliable routing protocol called MRFR, which is an appealing protocol for fault tolerant reliable data transmission. However, However, MRFR has no concern with the problem of load balancing, which results in increasing congestion and consuming high energy at some network nodes. As a result, the problem affects negatively the performance of the network. Taking account of load balancing as a route selection criteria can avoid routing through the congested nodes and allows to find better routes. In this paper, we extend MRFR by considering load balancing in the route discovery process of reliable communication. The simulation results showed that the proposed protocol outperforms AODV in terms of end-to-end delay, packet delivery radio, and average jitter. Compared to MRFR, the LBR protocol has the same packet delivery ratio, and obtains a better efficiency of load balancing.

Routing with Load-Balancing in Multi-Radio Wireless Mesh Networks

LE, Anh-Ngoc,KUM, Dong-Won,CHO, You-Ze,TOH, Chai-Keong The Institute of Electronics, Information and Comm 2009 IEICE TRANSACTIONS ON COMMUNICATIONS - Vol.92 No.3

<P>This paper addresses the interference and load imbalance problems in multi-radio infrastructure mesh networks where each mesh node is equipped with multiple radio interfaces and a subset of nodes serve as Internet gateways. To provide backbone support, it is necessary to reduce interference and balance load in Wireless Mesh Networks (WMNs). In this paper, we propose a new Load-Aware Routing Metric, called LARM, which captures the differences in transmission rates, packet loss ratio, intra/inter-flow interference and traffic load in multi-radio mesh networks. This metric is incorporated into the proposed load-balancing routing, called LBM, to provide load balancing for multi-radio mesh network. Simulation results show that LARM provides better performance compared to WCETT and hop-count routing metrics in LBM routing protocol.</P>

Set Distributed Path by the Network Load in Mobile Ad-hoc Networks

Dong-keun Oh,Young-jun Oh,Kang-whan Lee 보안공학연구지원센터 2015 International Journal of Multimedia and Ubiquitous Vol.10 No.1

Mobile Ad-hoc Network (MANET) consists of a node that has mobility. In MANET, node function as routing. So they build a network of their own, no infrastructure. Topology is exchanged due to node mobility in MANET. For reducing changed topology, hierarchical network algorithms are researched. However load-balancing of cluster head node is exceeded, assigned cluster member node can’t communicate other node. To solve this problem, we proposed Load Tolerance (L.T) algorithm for distributing routing. Proposed algorithm, when the cluster head node is measured overflow load balancing, cluster member node sends a message through distributed routing path by Load-Tolerance node. As a result, the proposed algorithm improves the packet delivery ratio in cluster routing

QoS 라우팅을 위한 부하균등 비용산정 방식

홍종준,김승훈,이균하,Hong, Jong-Joon,Kim, Seung-Hoon,Lee, Kyoon-Ha 한국정보처리학회 2002 정보처리학회논문지 C : 정보통신,정보보안 Vol.9 No.1

효율적인 QoS 라우팅을 위하여 각각의 요구에 대한 제한조건을 충족시키는 것은 물론, 테 네트워크 자원의 최적화에 대해서도 고려해야할 필요가 있다. 본 논문에서는 QoS 라우팅의 on-demand 방식과 precomputation 방식의 경로계산에서 자원 비용 산정 방식을 제안하여 전체 네트워크 자원의 퇴적 사용과 네트워크 자원의 부하 균등을 가능하게 하였다. 또한 도메인으로 분할된 대규모 네트워크의 QoS 라우팅에서 transit traffic을 위한 경로를 precomputation 방식으로 설정하고, 이들 경로들의 예약 가능성을 높이기 위해 자원 예약 측면에서 가장 좋은 K개의 경로들을 부하균등을 고려하여 선정하는 방안을 제안하였다. 그리고 동일한 자원 비용 산정 방식을 transit traffic과 intra traffic에 모두 적용하여 도메인간 라우팅(inter-domain routing)과 도메인내 라우팅(inter-domain routing)을 무리 없이 연계하면서 transit traffic을 우선으로 하는 방식을 제안하였다. 귿으로 본 논문에서 제안된 비용 산정 방식은 기존의 QoS 라우팅 알고리즘 자체를 변형시키지 않으면서, 그들의 비용 요소만을 대체하여 쉽게 사용되어질 수 있는 장점이 있다. An efficient QoS routing scheme needs to find a path that satisfies a given QoS requirements while consuming as few resources as Possible. In this paper, we propose two schemes of calculating resources'costs one for on-demand and one for precomputation QoS routing schemes. These schemes are effective in respect to the global network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and Intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multip1e paths between all pairs of ingress and ogress border routers while considering balancing of the expected load. We, therefore, expect that the paths are bettor than any other paths in respect to reserving the network resources on Paths. The routine: scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. cote that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without and modification in small and large scale of networks.

DCAR: Dynamic Congestion Aware Routing Protocol in Mobile Ad Hoc Networks

김영덕,이상헌,Hong-Ha Lee 대한임베디드공학회 2006 대한임베디드공학회논문지 Vol.1 No.1

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

DCAR: Dynamic Congestion Aware Routing Protocol in Mobile Ad Hoc Networks

Kim, Young-Duk,Lee, Sang-Heon,Lee, Dong-Ha Institute of Embedded Engineering of Korea 2006 대한임베디드공학회논문지 Vol.1 No.1

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

Dynamic Clustering for Load-Balancing Routing In Wireless Mesh Network

Thai, Pham Ngoc,Hwang, Min-Tae,Hwang, Won-Joo Korea Multimedia Society 2007 멀티미디어학회논문지 Vol.10 No.12

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

( Jianxin Liao ),( Shengwen Tian ),( Jingyu Wang ),( Tonghong Li ),( Qi Qi ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.2

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

Mobility Based Distributed Routing of Dynamic Density in Mobile Ad hoc Networks

Dong-keun Oh,Kang-whan Lee 보안공학연구지원센터 2016 International Journal of u- and e- Service, Scienc Vol.9 No.9

In MANET, establishes the network no depends on the infrastructure and communicates. The topology is exchanged following the various conditions. Also the routing path is disconnected due to node mobility and direction of node. To solve these problems, we proposed the Load Tolerance Density-distribution (LTD) algorithm on dynamic density in mobile ad hoc networks. The proposed algorithm measures the dynamic density and load balance then it calculates the relationship between the cluster head nodes by the homogenous routing (passion) distributed procedure and provides the distributed routing path density in mobile ad hoc networks. In the simulation, we compare the LTD algorithm and the WCA algorithm and the Max-min algorithm. As the simulation results, the proposed algorithm improves the packet delivery ratio of various conditions in the clustering routing.