Sciweavers

Share
NCA
2005
IEEE
9 years 8 months ago
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
Peng Wang, David L. Mills
NCA
2005
IEEE
9 years 8 months ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
NCA
2005
IEEE
9 years 8 months ago
SFS-KNOPPIX
KNOPPIX is a bootable CD with a collection of GNU/Linux software. KNOPPIX is very convenient but it requires downloading 700MB iso image and burning a CD-ROM when it is renewed. I...
Kuniyasu Suzaki, Kengo Iijima, Toshiki Yagi, Hidey...
NCA
2005
IEEE
9 years 8 months ago
An Adaptive Reputation-based Trust Framework for Peer-to-Peer Applications
In distributed P2P environments, peers (i.e., users) often have to request the services from some unfamiliar peers (i.e., resources) that could be altruistic, selfish, or even ma...
William Sears, Zhen Yu, Yong Guan
NCA
2005
IEEE
9 years 8 months ago
Self-organization in Cooperative Content Distribution Networks
Traditional client-server content distribution techniques usually suffer from scalability problems when dealing with large client population or sizable content. The advent of peer...
Marc Schiely, Lars Renfer, Pascal Felber
NCA
2005
IEEE
9 years 8 months ago
Location-based Publish/Subscribe
This paper introduces the concept of location-based publish/subscribe (LPS), which allows mobile ad hoc applications to anonymously communicate with each other, depending on their...
Patrick Th. Eugster, Benoît Garbinato, Adria...
NCA
2005
IEEE
9 years 8 months ago
Reducing the Communication Cost via Chain Pattern Scheduling
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
Florina M. Ciorba, Theodore Andronikos, Ioannis Dr...
NCA
2005
IEEE
9 years 8 months ago
Fundamental Network Processor Performance Bounds
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
Hao Che, Chethan Kumar, Basavaraj Menasinahal
NCA
2005
IEEE
9 years 8 months ago
Cooperative Mobile Agents to Gather Global Information
Abstract— This paper describes an original approach to writing reactive algorithms on highly dynamic networks. We propose to use randomly mobile agents to gather global informati...
Michel Charpentier, Gérard Padiou, Philippe...
NCA
2005
IEEE
9 years 8 months ago
Scalable QoS-Based Event Routing in Publish-Subscribe Systems
This paper proposes a distributed and scalable publish-subscribe broker with support for QoS. The broker, called “IndiQoS”, leverages on existing mechanisms to reserve resourc...
Nuno Carvalho, Filipe Araújo, Luís R...
books