Sciweavers

36 search results - page 6 / 8
» On the Hardness of Approximating the Network Coding Capacity
Sort
View
93
Voted
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
14 years 9 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...
INFOCOM
2005
IEEE
15 years 3 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...
SIGMETRICS
2011
ACM
191views Hardware» more  SIGMETRICS 2011»
14 years 7 days ago
Stability analysis of QCN: the averaging principle
Data Center Networks have recently caused much excitement in the industry and in the research community. They represent the convergence of networking, storage, computing and virtu...
Mohammad Alizadeh, Abdul Kabbani, Berk Atikoglu, B...
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
15 years 6 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...