259 search results - page 24 / 52 » On Constraints for Path Computation in Multi-Layer Switched ... |
ESA
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
IPPS
2003
IEEE
14 years 25 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
DEBS
2008
ACM
13 years 8 months ago
2008
ACM
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...