Sciweavers

242 search results - page 38 / 49
» Deterministic small-world communication networks
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Non-Preemptive Buffer Management for Latency Sensitive Packets
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
Moran Feldman, Joseph Naor
IPPS
1997
IEEE
15 years 3 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
GLOBECOM
2006
IEEE
15 years 5 months ago
AR-PIN/PDC: Flexible Advance Reservation of Intradomain and Interdomain Lightpaths
— A collection of Grid computing resources interconnected by an application-configurable network of lightpaths is called a LambdaGrid. It provides data-intensive applications wit...
Eric He, Xi Wang, Venkatram Vishwanath, Jason Leig...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 4 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
SIROCCO
2007
15 years 1 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...