Sciweavers

120 search results - page 11 / 24
» Nonessential objectives within network approaches for MCDM
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Forward Correction and Fountain codes in Delay Tolerant Networks
Abstract—Delay tolerant Ad-hoc Networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are...
Eitan Altman, Francesco De Pellegrini
INFORMS
2010
147views more  INFORMS 2010»
14 years 6 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
JNW
2006
98views more  JNW 2006»
14 years 9 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
TON
2010
126views more  TON 2010»
14 years 4 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
81
Voted
SPAA
2006
ACM
15 years 3 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...