Sciweavers

7274 search results - page 123 / 1455
» Abstractions for network update
Sort
View
NETGAMES
2005
ACM
15 years 12 months ago
Patch scheduling for on-line games
One of the challenges facing the on-line gaming community is the delivery of new content to players. While the initial distribution of a game is typically done via large media for...
Chris Chambers, Wu-chang Feng
INFOCOM
1996
IEEE
15 years 10 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 10 months ago
Empirical Study on Inferring BGP Routing Instability and its Location Based on Single Point Observation
As the Internet has become a communication infrastructure, inter-domain routing instabilities have become prone to serious problems. Some studies have proposed methods that infer i...
Tomohiko Ogishi, Yuichiro Hei, Shigehiro Ano, Toru...
COMSWARE
2007
IEEE
15 years 10 months ago
Robust and Efficient Software Management in Sensor Networks
Software deployment and updating of deployed code is a critical topic in the area of wireless sensor networks (WSN). Reasons are unreliable network connectivity, resource limitatio...
Wolfgang Schröder-Preikschat, Rüdiger Ka...
INFOCOM
1995
IEEE
15 years 10 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang