169 search results - page 25 / 34 » Counting paths in digraphs |
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...
ICAI
2010
13 years 6 months ago
2010
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
SSDBM
2002
IEEE
14 years 1 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
ICN
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we study the impact of the medium access control (MAC) layer and the routing layer on the performance of a multi-hop wireless network. At the medium access control la...