321 search results - page 39 / 65 » Approximate Models for General Cache Networks |
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 8 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
SIGMETRICS
2008
ACM
13 years 8 months ago
2008
ACM
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
ISCAS
2006
IEEE
14 years 2 months ago
2006
IEEE
—On-die capacitances interact with the inductance and resistance of the power distribution network to supply electrical charge. A distributed model is generally required to analy...