Sciweavers

1639 search results - page 46 / 328
» Degree-constrained network flows
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Optimal Control of Wireless Networks with Finite Buffers
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achie...
Long Bao Le, Eytan Modiano, Ness B. Shroff
TMA
2012
Springer
268views Management» more  TMA 2012»
12 years 6 months ago
Identifying Skype Nodes in the Network Exploiting Mutual Contacts
Abstract. In this paper we present an algorithm that is able to progressively discover nodes of a Skype overlay P2P network. Most notably, super nodes in the network core. Starting...
Jan Jusko, Martin Rehák
ICUMT
2009
13 years 8 months ago
An efficient solution for max-min fair rate allocation in P2P simulation
Abstract--With the rapid development of peer-to-peer networks, simulation is considered as a useful tool to demonstrate initial ideas before building prototypes with real network t...
Anh Tuan Nguyen, Frank Eliassen
NETWORKING
2004
14 years 11 days ago
A New Method of Primary Routes Selection for Local Restoration
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
Krzysztof Walkowiak
COR
2008
124views more  COR 2008»
13 years 11 months ago
Max-min fairness in multi-commodity flows
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein,...