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 published on a yearly basis
Papers
More filters
TL;DR: TCD routing is proposed, which has the potential to differentiate between traffic classes using different optimization criteria in route calculation, and performance analysis reveals improved routing resulting from traffic class differentiation, regardless of the traffic scenario considered.
Abstract: Next-generation satellite networks are expected to provide a variety of applications with diverse performance requirements, which will call for the development of adaptive routing procedures supporting different levels of services. In this paper, we propose traffic class dependent (TCD) routing, which has the potential to differentiate between traffic classes using different optimization criteria in route calculation. The performance of TCD routing is evaluated for different traffic scenarios using an empirical traffic source model derived from the real backbone Internet traffic trace and compared with results obtained with equivalent Poisson traffic as a reference point. In addition, TCD routing is compared with a simple single service routing procedure, which does not make any distinction between traffic classes. Performance analysis, in terms of average packet delay, normalized data throughput, and normalized link load, reveals improved routing resulting from traffic class differentiation, regardless of the traffic scenario considered. The performance measures based of aggregate traffic flow show no significant difference between routing of empirical and equivalent Poisson traffic.
64 citations
Patent•
22 Dec 2008
TL;DR: In this paper, a system for routing an interaction has a queue for staging the interaction and a router running a routing strategy for routing the interaction, and a number of object models maintained for a many of agents, the object models defining one or more agent skills.
Abstract: A system for routing an interaction has a queue for staging the interaction, a router running a routing strategy for routing the interaction, and a number of object models maintained for a number of agents, the object models defining one or more agent skills, the values of the object models dynamically affected by real-time bio-metrics of the agents obtained through ongoing monitoring of voice and input actions of the agents The routing strategy routes the interaction based on comparison of the dynamically-affected skill values of the agents, as evidenced in the object models
63 citations
03 Jul 2001
TL;DR: A power-conserving algorithm, based on the RTS/CTS dialogue of the IEEE 802.11 standard, is evaluated, which dynamically switches off the radio network interface card of nodes when they are neither transmitting nor receiving a packet.
Abstract: The design of energy-efficient routing algorithms is a fundamental problem in a mobile ad-hoc network (MANET) where battery energy is a limited resource. We evaluate a power-conserving algorithm, based on the RTS/CTS dialogue of the IEEE 802.11 standard which dynamically switches off the radio network interface card of nodes when they are neither transmitting nor receiving a packet. We evaluate the algorithm through simulations over four well-known routing algorithms: dynamic source routing (DSR), ad-hoc on demand distance vector (AODV), temporally-ordered routing algorithm (TORA), and destination-sequenced distance-vector routing (DSDV). The obtained results indicate that for all the evaluated routing protocols, the power savings are similar and range between 25 per cent and 60 per cent of the total energy.
63 citations
01 Mar 2011
TL;DR: The results show that M-DART performs the best or at least comparable with respect to widely adopted routing protocols in all the considered scenarios, and it is able to assure satisfactory performances for large networks by reducing the packet loss by up to 75%.
Abstract: The paper proposes a Distributed Hash Table (DHT)-based multi-path routing protocol for scalable ad hoc networks. Specifically, we propose a multipath-based improvement to a recently proposed DHT-based shortest-path routing protocol, namely the Dynamic Address RouTing (DART). The resulting protocol, referred to as multi-path DART (M-DART), guarantees multi-path forwarding without introducing any additional communication or coordination overhead with respect to DART. The performances of M-DART have been evaluated by means of numerical simulations across a wide range of environments and workloads. The results show that M-DART performs the best or at least comparable with respect to widely adopted routing protocols in all the considered scenarios. Moreover, unlike these protocols, it is able to assure satisfactory performances for large networks by reducing the packet loss by up to 75%. Copyright © 2010 John Wiley & Sons, Ltd.
(This work is partially supported by the Italian National Project ‘Global & Reliable End to End e-Commerce & On Line Service Platform’ (GRECO).)
63 citations
Patent•
15 Mar 2007TL;DR: In this paper, a system receives a packet at a first node and transmits it to the full routing node for future transmission to the second node, where the packet is destined for a second node.
Abstract: A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.
63 citations