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: Two bounded-length maze routing (BLMR) algorithms are presented that perform much faster routing than traditional maze routing algorithms and a rectilinear Steiner minimum tree aware routing scheme is proposed to guide heuristic-BLMR and monotonic routing to build a routing tree with shorter wirelength.
Abstract: Modern global routers employ various routing methods to improve routing speed and quality Maze routing is the most time-consuming process for existing global routing algorithms This paper presents two bounded-length maze routing (BLMR) algorithms (optimal-BLMR and heuristic-BLMR) that perform much faster routing than traditional maze routing algorithms In addition, a rectilinear Steiner minimum tree aware routing scheme is proposed to guide heuristic-BLMR and monotonic routing to build a routing tree with shorter wirelength This paper also proposes a parallel multithreaded collision-aware global router based on a previous sequential global router (SGR) Unlike the partitioning-based strategy, the proposed parallel router uses a task-based concurrency strategy Finally, a 3-D wirelength optimization technique is proposed to further refine the 3-D routing results Experimental results reveal that the proposed SGR uses less wirelength and runs faster than most of other state-of-the-art global routers with a different set of parameters , , , Compared to the proposed SGR, the proposed parallel router yields almost the same routing quality with average 271 and 312-fold speedup on overflow-free and hard-to-route cases, respectively, when running on a 4-core system

142 citations

Patent
19 May 1993
TL;DR: In this paper, a packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network using a routing field in the packet header which is processed according to two different protocols.
Abstract: A packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be broadcast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the broadcast subset. A second portion of the routing field contains the broadcast subset identifier which can then be used to deliver the packet to all of the members of the broadcast subset. Provision is made to backtrack deliver the packet to the last node identified before the broadcast subset if that last node is itself a member of the subset.

142 citations

Journal ArticleDOI
TL;DR: By doing qualitative comparison of routing protocols, it is observed that hybrid communication would be the better choice for both communication mode operable in either a city environment or an open environment.

141 citations

Proceedings ArticleDOI
06 Nov 2002
TL;DR: Using packet traces from a tier-1 ISP backbone, this work explains how routing loops manifest in packet traces in terms of the packet types caught in the loop, the loop sizes, and the loop durations, and analyzes the impact of routing loops on network performance in Terms of loss and delay.
Abstract: Routing loops are caused by inconsistencies in routing state among a set of routers. They occur in perfectly engineered networks, and have a detrimental effect on performance. They impact end-to-end performance through increased packet loss and delay for packets caught in the loop, and through increased link utilization and corresponding delay and jitter for packets that traverse the link but are not caught in the loop.Using packet traces from a tier-1 ISP backbone, we first explain how routing loops manifest in packet traces. We characterize routing loops in terms of the packet types caught in the loop, the loop sizes, and the loop durations. Finally, we analyze the impact of routing loops on network performance in terms of loss and delay.

140 citations

Patent
30 Jul 2012
TL;DR: In this article, the intermediate node can determine a routing entry for the destination associated with a next hop based on the source route and cache the routing entry and transmit the second message according to the cached routing entry.
Abstract: In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry.

140 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