Sciweavers

321 search results - page 49 / 65
» Approximate Models for General Cache Networks
Sort
View
SRDS
2003
IEEE
14 years 1 months ago
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network giv...
Yang Wang 0008, Deepayan Chakrabarti, Chenxi Wang,...
ICALP
2010
Springer
14 years 1 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
COMPGEOM
2004
ACM
14 years 1 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
INFOCOM
2008
IEEE
14 years 2 months ago
Design of a Channel Characteristics-Aware Routing Protocol
Abstract—Radio channel quality of real-world wireless networks tends to exhibit both short-term and long-term temporal variations that are in general difficult to model. To maxi...
Rupa Krishnan, Ashish Raniwala, Tzi-cker Chiueh
CCR
2006
122views more  CCR 2006»
13 years 8 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer