552 search results - page 63 / 111 » Routing complexity of faulty networks |
INFOCOM
2000
IEEE
14 years 1 days ago
2000
IEEE
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
NETCOOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without ...