Sciweavers

858 search results - page 48 / 172
» Sharing the Cost of a Capacity Network
Sort
View
INFOCOM
1999
IEEE
14 years 1 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
IPTPS
2005
Springer
14 years 2 months ago
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks
Recent work has shown that intelligent neighbor selection during construction can significantly enhance the performance of peer-to-peer overlay networks. While its impact on perf...
Byung-Gon Chun, Ben Y. Zhao, John Kubiatowicz
INFOCOM
2006
IEEE
14 years 3 months ago
Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
Sergey Gorinsky, Nageswara S. V. Rao
INFOCOM
2003
IEEE
14 years 2 months ago
Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
Abstract—In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of...
Jacqueline Boyer, Fabrice Guillemin, Philippe Robe...
CCGRID
2001
IEEE
14 years 29 days ago
A DSM Cluster Architecture Supporting Aggressive Computation in Active Networks
Active networks allow computations to be performed innetwork at routers as messages pass through them. Active networks offer unique opportunities to optimize networkcentric applic...
Peter C. J. Graham