Sciweavers

2924 search results - page 536 / 585
» Lower Bounds in Distributed Computing
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
ICNP
1996
IEEE
13 years 12 months ago
On the relationship between file sizes, transport protocols, and self-similar network traffic
Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales. In this paper, we examine a mechanism that ...
Kihong Park, Gitae Kim, Mark Crovella
ICDCS
2010
IEEE
13 years 11 months ago
Guaranteeing BGP Stability with a Few Extra Paths
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
Rachit Agarwal, Virajith Jalaparti, Matthew Caesar...
IPPS
2010
IEEE
13 years 5 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
HIPC
2009
Springer
13 years 5 months ago
Distance-aware round-robin mapping for large NUCA caches
In many-core architectures, memory blocks are commonly assigned to the banks of a NUCA cache by following a physical mapping. This mapping assigns blocks to cache banks in a round-...
Alberto Ros, Marcelo Cintra, Manuel E. Acacio, Jos...