CORR
2010
Springer
13 years 3 months ago
2010
Springer
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
PVLDB
2008
13 years 4 months ago
2008
Managing problem tickets is a key issue in the IT services industry. A large service provider may handle thousands of problem tickets from its customer on daily basis. The efficie...
NETWORK
2007
13 years 4 months ago
2007
The explosive growth in the use of mobile devices coupled with users’ desires for real-time applications has provided new challenges in the design of protocols for mobile ad hoc...
ISCI
2008
13 years 4 months ago
2008
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
TON
2002
13 years 4 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
TON
2002
13 years 4 months ago
2002
We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has...
TELSYS
2002
13 years 4 months ago
2002
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
TCS
2002
13 years 4 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...