Sciweavers

1391 search results - page 151 / 279
» Distributed routing in networks using affinity propagation
Sort
View
ERCIMDL
2007
Springer
164views Education» more  ERCIMDL 2007»
16 years 20 days ago
MinervaDL: An Architecture for Information Retrieval and Filtering in Distributed Digital Libraries
Abstract. We present MinervaDL, a digital library architecture that supports approximate information retrieval and filtering functionality under a single unifying framework. The a...
Christian Zimmer, Christos Tryfonopoulos, Gerhard ...
FOCS
1997
IEEE
15 years 10 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
INFOCOM
2002
IEEE
15 years 11 months ago
Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
Chunming Qiao, Dahai Xu
INFOCOM
1999
IEEE
15 years 10 months ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste
DAC
1997
ACM
15 years 10 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao