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.

A Network-Flow-Based RDL Routing Algorithmz for Flip-Chip Design

Abstract: The flip-chip package gives the highest chip density of any packaging method to support the pad-limited application-specific integrated circuit designs. In this paper, we propose the first router for the flip-chip package in the literature. The router can redistribute nets from wire-bonding pads to bump pads and then route each of them. The router adopts a two-stage technique of global routing followed by detailed routing. In global routing, we use the network flow algorithm to solve the assignment problem from the wire-bonding pads to the bump pads and then create the global path for each net. The detailed routing consists of three stages, namely: 1) cross-point assignment; 2) net ordering determination; and 3) track assignment, to complete the routing. Experimental results based on seven real designs from the industry demonstrate that the router can reduce the total wirelength by 10.2%, the critical wirelength by 13.4%, and the signal skews by 13.9%, as compared with a heuristic algorithm currently used in industry.

Optimized Multi-Constrained Quality-of-Service Multipath Routing Approach for Multimedia Sensor Networks

Abstract: Modern multimedia sensor networks impose strict constraints on both the delay and energy consumption when time-critical data must be reported to the sink within a limited bandwidth without any loss. Failure to transmit an event to the sink occurs for many reasons, including inherence limitations of sensors, power consumption, and reliability. We propose a mathematical model for a novel quality-of-service (QoS) routing-determination method. The proposed scheme enables determining the optimal path to provide appropriate shared radio satisfying the QoS for a wide range of real-time intensive media. The mathematical model is based on the Lagrangian relaxation method, to control adaptive switching of hop-by-hop QoS routing protocols. The embedded criteria for each objective function are used to decide which path from source to sink will be selected. Simulation results show that, compared with existing routing protocols, the approach proposed in this paper significantly improves the packet received ratio, energy consumption, and average end-to-end delay of the sensor node.

MobiCCN: Mobility support with greedy routing in Content-Centric Networks

Abstract: Content-Centric Network (CCN) shifts the Internet from point-to-point paradigm to receiver-driven data-centric paradigm. While it tries to solve many problems in the current Internet and opens the door to many novel applications, it also leaves many challenges unanswered, e.g., mobility support and mobile content publishing and dissemination. In this paper, we show how a greedy routing can be implemented in CCN architecture to support mobility. This allows for efficient content publisher mobility and supports seamless handoffs for interactive connections. We present our solution - MobiCCN, and evaluate it thoroughly in realistic network topologies to show it outperforms other popular mobility schemes.

A Formal Study of Trust-Based Routing in Wireless Ad Hoc Networks

Abstract: Recently, trust-based routing has received much attention as an effective way to improve security of wireless ad hoc networks (WANETs). Although various trust metrics have been designed and incorporated into the routing metrics, as far as we know, none of the existing works have used mathematical tools such as routing algebra to analyze the compatibility of trust related routing metrics and routing protocols in WANETs. In this paper, we first identify unique features of trust metrics compared with QoS-based routing metrics. Then, we provide a systematic analysis of the relationship between trust metrics and trust-based routing protocols by identifying the basic algebraic properties that a trust metric must have in order to work correctly and optimally with different generalized distance-vector or link-state routing protocols in WANETs. Moreover, we extend our framework to model the interactions between different trust-based routing protocols. Finally, our results are applied to check the compatibility of the trust metrics proposed in previous literature and the popular routing protocols used in WANETs.

A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing

Abstract: Motivated by analysis of distributed RC delay in routing trees, a new tree construction is proposed for performance-driven global routing which directly trades off between Prim's minimum spanning tree algorithm and Dijkstra's shortest path tree algorithm. This direct combination of two objective functions and their corresponding optimal algorithms contrasts with the more indirect 'shallow-light' methods. The authors' method achieves routing trees which satisfy a given routing tree radius bound while using less wire than previous methods. Detailed simulations show that these wirelength savings translate into significantly improved delay over standard MST routing in both IC and multichip module (MCM) interconnect technologies. >