658 search results - page 25 / 132 » Lower bounds for sorting networks |
ICOIN
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
TON
2010
13 years 2 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Advance reservation connection requests specify ...