Sciweavers

2452 search results - page 413 / 491
» Performance of group communication over ad-hoc networks
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Encounter-Based Routing in DTNs
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network...
Samuel C. Nelson, Mehedi Bakht, Robin Kravets
INFOCOM
2012
IEEE
11 years 11 months ago
Estimators also need shared values to grow together
—Network management applications require large numbers of counters in order to collect traffic characteristics for each network flow. However, these counters often barely fit ...
Erez Tsidon, Iddo Hanniel, Isaac Keslassy
INFOCOM
2007
IEEE
14 years 3 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
ISCC
2007
IEEE
14 years 3 months ago
Long Horizon End-to-End Delay Forecasts: A Multi-Step-Ahead Hybrid Approach
A long horizon end-to-end delay forecast, if possible, will be a breakthrough in traffic engineering. This paper introduces a hybrid approach to forecast end-to-end delays using ...
Vinh Bui, Weiping Zhu, Antonio Pescapè, Ale...
IJAR
2010
120views more  IJAR 2010»
13 years 7 months ago
Comparison of tightly and loosely coupled decision paradigms in multiagent expedition
Frameworks for cooperative multiagent decision making may be divided into those where each agent is assigned a single variable (SVFs) and those where each agent carries an interna...
Yang Xiang, Franklin Hanshar