Sciweavers

661 search results - page 6 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
CISIS
2008
IEEE
14 years 1 months ago
Latency Impact on Spin-Lock Algorithms for Modern Shared Memory Multiprocessors
In 2006, John Mellor-Crummey and Michael Scott received the Dijkstra Prize in Distributed Computing. This prize was for their 1991 paper on algorithms for scalable synchronization ...
Jan Christian Meyer, Anne C. Elster
INFOCOM
1999
IEEE
13 years 11 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
ARCS
2004
Springer
14 years 24 days ago
Cryptonite - A Programmable Crypto Processor Architecture for High-Bandwidth Applications
Cryptographic methods are widely used within networking and digital rights management. Numerous algorithms exist, e.g. spanning VPNs or distributing sensitive data over a shared ne...
Rainer Buchty, Nevin Heintze, Dino Oliva
ISCAS
2002
IEEE
108views Hardware» more  ISCAS 2002»
14 years 9 days ago
Optimal adaptive bandwidth monitoring for QoS based retrieval
—Network aware multimedia delivery applications are a class of applications that provide certain level of quality of service (QoS) guarantees to end users while not assuming unde...
Yinzhe Yu, Anup Basu, Irene Cheng
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
14 years 29 days ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...