Sciweavers

914 search results - page 28 / 183
» Branch and Bound on the Network Model
Sort
View
JSAC
2006
117views more  JSAC 2006»
14 years 9 months ago
A scalable network resource allocation mechanism with bounded efficiency loss
The design of pricing mechanisms for network resource allocation has two important objectives: 1) a simple and scalable end-to-end implementation and 2) efficiency of the resulting...
Ramesh Johari, John N. Tsitsiklis
UAI
2008
14 years 11 months ago
Bounds on the Bethe Free Energy for Gaussian Networks
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
Botond Cseke, Tom Heskes
TON
2010
118views more  TON 2010»
14 years 4 months ago
Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
Giusi Alfano, Michele Garetto, Emilio Leonardi, Va...
88
Voted
ONDM
2007
14 years 11 months ago
Grooming-Enhanced Multicast in Multilayer Networks
In this paper we investigate and evaluate the performance of multicast routing in grooming capable multi-layer optical wavelength division multiplexing (WDM) networks. New waveleng...
Péter Soproni, Marcell Perényi, Tibo...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 4 months ago
Scalable Fault Diagnosis in IP Networks using Graphical Models: A Variational Inference Approach
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...
Rajesh Narasimha, Souvik Dihidar, Chuanyi Ji, Stev...