Sciweavers

1316 search results - page 160 / 264
» A New Scheduling Algorithm for Servers
Sort
View
ICC
2009
IEEE
128views Communications» more  ICC 2009»
14 years 5 months ago
Approximate Flow-Aware Networking
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
Jerzy Domzal, Andrzej Jajszczyk
ICPP
1998
IEEE
14 years 2 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
ATAL
2007
Springer
14 years 2 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
JUCS
2002
116views more  JUCS 2002»
13 years 10 months ago
Bounded Flooding Routing Algorithm for Provisioning the Globally Optimal Route in a Hierarchical ATM Network
: ATM virtual path (VP) contains bundles of virtual channels (VCs). A VP layer network can be used as a server layer network of VC layer networks and each VC layer network can be a...
Daniel Won-Kyu Hong, Choong Seon Hong, Dong-Sik Yu...
PEPM
2007
ACM
14 years 4 months ago
Tasks: language support for event-driven programming
The event-driven programming style is pervasive as an efficient method for interacting with the environment. Unfortunately, the event-driven style severely complicates program mai...
Jeffrey Fischer, Rupak Majumdar, Todd D. Millstein