Results 1  10
of
11,842
Balanced Sequences and Optimal Routing
 J. ACM
, 1997
"... The objective pursued in this paper is twofold. The first part gives an overview of the following combinatorial problem: is it possible to construct an infinite sequence over n letters where each letter is distributed as "evenly" as possible and appears with a fixed rate? The second objec ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
objective of the paper is to relate this construction to the framework of optimal routing in queueing networks. We show under rather general assumptions that the optimal deterministic routing in stochastic event graphs is such a sequence.
Partially optimal routing
 IEEE Journal on Selected Areas in Communications
, 2007
"... Abstract — Most largescale communication networks, such as the Internet, consist of interconnected administrative domains. While source (or selfish) routing, where transmission follows the least cost path for each source, is reasonable across domains, service providers typically engage in traffic e ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
engineering to improve operating performance within their own network. Motivated by this observation, we develop and analyze a model of partially optimal routing, where optimal routing within subnetworks is overlaid with selfish routing across domains. We demonstrate that optimal routing within a subnetwork
Dynamic source routing in ad hoc wireless networks
 Mobile Computing
, 1996
"... An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its desti ..."
Abstract

Cited by 3108 (31 self)
 Add to MetaCart
, the overhead of the protocol is quite low, falling to just 1 % of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 657 (27 self)
 Add to MetaCart
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route
Abstract Optimal Routing in Chord
"... We propose optimal routing algorithms for Chord [1], a popular topology for routing in peertopeer networks. Chord is an undirected graph on 2 b nodes arranged in a circle, with edges connecting pairs of nodes that are 2 k positions apart for any k ≥ 0. The standard Chord routing algorithm uses edg ..."
Abstract
 Add to MetaCart
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peertopeer networks. Chord is an undirected graph on 2 b nodes arranged in a circle, with edges connecting pairs of nodes that are 2 k positions apart for any k ≥ 0. The standard Chord routing algorithm uses
Optimal routing in gossip networks
 IEEE Transactions on Vehicular Technology
, 2005
"... Abstract—In this paper, we introduce the Gossip Network model where travelers can obtain information about the state of dynamic networks by gossiping with peer travelers using ad hoc communication. Travelers then use the gossip information to recourse their path and find the shortest path to their d ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
to their destination. We study optimal routing in stochastic, timeindependent gossip networks, and demonstrate that an optimal routing policy may direct travelers to make detours to gather information. A dynamic programming equation that produces the optimal policy for routing in gossip networks is presented
Distributed asynchronous optimal routing in . . .
, 1986
"... In this paper we study the performance of a class of 1) The quasistatic assumption, i.e., the external traffic distributed optimal routing algorithms of the gradient projection type arrival process for each OD pair is stationary over time. This under weaker and more realistic assumptions than thos ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we study the performance of a class of 1) The quasistatic assumption, i.e., the external traffic distributed optimal routing algorithms of the gradient projection type arrival process for each OD pair is stationary over time. This under weaker and more realistic assumptions than
Optimal Routing in Gossip Networks
"... Abstract — In this paper we introduce the Gossip Network model where travelers can obtain information about the state of dynamic networks by gossiping with peer travelers using adhoc communication. Travelers then use the gossip information to recourse their path and find the shortest path to destin ..."
Abstract
 Add to MetaCart
to destination. We study optimal routing in stochastic, time independent gossip networks, and demonstrate that an optimal routing policy may direct travelers to make detours to gather information. A dynamic programming equation that produces the optimal policy for routing in gossip networks is presented
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed
Optimal Routing in Toroidal Networks
 Information Processing Letters
, 1992
"... In this paper we study routing algorithms for onetoone communication in multiprocessors, whose interconnection networks have toroidal structure. A toroidal network is an ndimensional rectangular mesh with additional edgetoedge connections. Mathematically speaking, these networks are undirected ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
graphs obtained by cartesian product of cycles. We show, that a broad class of routing algorithms, called homogeneous, is optimal for certain class of such networks. Besides, we propose a transformation, which transforms nonoptimal homogeneous routing algorithms into optimal semihomogeneous routing
Results 1  10
of
11,842