312 search results - page 5 / 63 » Degree Bounded Network Design with Metric Costs |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
NETWORKING
2004
13 years 8 months ago
2004
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
AINA
2008
IEEE
13 years 9 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
FGCN
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...