Sciweavers

3360 search results - page 343 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
ICCCN
2007
IEEE
16 years 1 months ago
Utility-Based Routing in Communication Networks with Unstable Links
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Mingming Lu, Jie Wu
IPPS
2010
IEEE
15 years 4 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb
TMC
2012
13 years 9 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
MOBIHOC
2006
ACM
16 years 6 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...