scispace - formally typeset
Search or ask a question
Topic

Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: Experimental results show that in comparison against the original RPL, the E2HRC routing protocol more effectively balances wireless sensor network energy consumption, thus decreasing both node energy consumption and the number of control messages.
Abstract: A heterogeneous ring domain communication topology with equal area in each ring is presented in this paper in an effort to solve the energy balance problem in original IPv6 routing protocol for low power and lossy networks (RPL). A new clustering algorithm and event-driven cluster head rotation mechanism are also proposed based on this topology. The clustering information announcement message and clustering acknowledgment message were designed according to RFC and original RPL message structure. An energy-efficient heterogeneous ring clustering (E2HRC) routing protocol for wireless sensor networks is then proposed and the corresponding routing algorithms and maintenance methods are established. Related messages are analyzed in detail. Experimental results show that in comparison against the original RPL, the E2HRC routing protocol more effectively balances wireless sensor network energy consumption, thus decreasing both node energy consumption and the number of control messages.

67 citations

Proceedings ArticleDOI
12 Jun 1994
TL;DR: The authors first examine two VP capacity reservation strategies, design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network blocking probability can be significantly reduced by MDP routing.
Abstract: The virtual path (VP) concept has been proposed to simplify traffic control and resource management in future B-ISDN. In particular, call setup processing can be significantly reduced when resources are reserved on VPs. However, this advantage is offset by a decrease in statistical multiplexing gains of the networks. The focus of this paper is on how to improve bandwidth efficiency through adaptive routing when capacity is reserved on all VPs. The authors first examine two VP capacity reservation strategies. They then design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network blocking probability can be significantly reduced by MDP routing. >

67 citations

Journal ArticleDOI
TL;DR: It is found that LRR is an effective way for dealing with mobile jamming in a frequency-hop packet radio network and significant increases in throughput and end-to-end probability of success are obtained with LRR.
Abstract: Research in adaptive, decentralized routing for frequency-hop packet radio networks with mobile partial-band jamming. A routing technique called least-resistance routing (LRR) is developed, and various versions of this routing method are examined. LRR uses a quantitative assessment of the interference environment experienced by a radio's receiver to determine a resistance value for that radio. Two components for the interference environment are considered: transmissions from other radios and partial-band jamming. The resistances for each of the radios in a particular path are combined to form the path resistance, and packets are forwarded on the path with the smallest resistance. Comparisons are made between different versions of LRR and between LRR and previously developed adaptive routing techniques. It is found that LRR is an effective way for dealing with mobile jamming in a frequency-hop packet radio network. Significant increases in throughput and end-to-end probability of success are obtained with LRR. >

67 citations

Journal ArticleDOI
TL;DR: An evaluation metric, path vacant ratio, is proposed to evaluate and then find a set of link-disjoint paths from all available paths, and a congestion control and load-balancing algorithm that can adaptively adjust the load over multipaths is proposed.
Abstract: Service-oriented architectures for wireless sensor networks (WSNs) have been proposed to provide an integrated platform, where new applications can be rapidly developed through flexible service composition. In WSNs, the existing multipath routing schemes have demonstrated the effectiveness of traffic distribution over multipaths to fulfill the quality of service requirements of applications. However, the failure of links might significantly affect the transmission performance, scalability, reliability, and security of WSNs. Thus, by considering the reliability, congestion control, and security for multipath, it is desirable to design a reliable and service-driven routing scheme to provide efficient and failure-tolerant routing scheme. In this paper, an evaluation metric, path vacant ratio, is proposed to evaluate and then find a set of link-disjoint paths from all available paths. A congestion control and load-balancing algorithm that can adaptively adjust the load over multipaths is proposed. A threshold sharing algorithm is applied to split the packets into multiple segments that will be delivered via multipaths to the destination depending on the path vacant ratio. Simulations demonstrate the performance of the adaptive and secure load-balance routing scheme. © 2014 IEEE.

67 citations

Patent
27 Sep 2011
TL;DR: In this article, the authors describe a protocol for processing and forwarding of packets in an Autonomous System (AS) by using a set of bits that encodes a route in an n-ary tree.
Abstract: Systems and techniques for processing and forwarding packets are described. Specifically, some embodiments can include a receiving mechanism, a determining mechanism, a generating mechanism, and a sending mechanism. The receiving mechanism can be configured to receive a first packet that is to be routed from a first node in a first Autonomous System (AS) to a second node in a second AS. The determining mechanism can be configured to determine a set of bits that encodes a route in an n-ary tree that includes the first node and a root node in the first AS. The generating mechanism can be configured to generate, based on the first packet, a second packet that includes the set of bits and an identifier associated with the second AS. The sending mechanism can be configured to send the second packet.

67 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
82% related
Server
79.5K papers, 1.4M citations
82% related
Wireless ad hoc network
49K papers, 1.1M citations
81% related
Wireless network
122.5K papers, 2.1M citations
80% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202327
202268
20214
20204
201912
201833