Sciweavers

4037 search results - page 223 / 808
» Routing without ordering
Sort
View
GIS
2010
ACM
13 years 9 months ago
Querying the future of spatio-temporal objects
Since navigation systems and tracking devices are becoming ubiquitous in our daily life, the development of efficient methods for processing massive sets of mobile objects are of ...
Philip Schmiegelt, Bernhard Seeger
TOCS
2011
111views more  TOCS 2011»
13 years 5 months ago
SEATTLE: A Scalable Ethernet Architecture for Large Enterprises
IP networks today require massive effort to configure and manage. Ethernet is vastly simpler to manage, but does not scale beyond small local area networks. This paper describes ...
Changhoon Kim, Matthew Caesar, Jennifer Rexford
HOTNETS
2010
13 years 5 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
TCAD
2010
105views more  TCAD 2010»
13 years 5 months ago
Fault Tolerant Network on Chip Switching With Graceful Performance Degradation
The structural redundancy inherent to on-chip interconnection networks [networks on chip (NoC)] can be exploited by adaptive routing algorithms in order to provide connectivity eve...
Adán Kohler, Gert Schley, Martin Radetzki
DEBS
2007
ACM
14 years 17 days ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma