114 search results - page 18 / 23 » Optimal Routing in Binomial Graph Networks |
140
Voted
ICOIN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
106
Voted
ESA
2007
Springer
15 years 9 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
149
Voted
TIT
2010
14 years 10 months ago
2010
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
129
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
112
Voted
IPL
2007
15 years 3 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...