Sciweavers

1542 search results - page 117 / 309
» A Qos Routing Algorithm Based on Ant Algorithm
Sort
View
JSS
2008
93views more  JSS 2008»
15 years 3 months ago
A framework for QoS-aware binding and re-binding of composite web services
QoS-aware dynamic binding of composite services provides the capability of binding each service invocation in a composition to a service chosen among a set of functionally equival...
Gerardo Canfora, Massimiliano Di Penta, Raffaele E...
SIGCOMM
1998
ACM
15 years 7 months ago
Fast and Scalable Layer Four Switching
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
Venkatachary Srinivasan, George Varghese, Subhash ...
IPPS
1996
IEEE
15 years 7 months ago
Generic Methodologies for Deadlock-Free Routing
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
Hyunmin Park, Dharma P. Agrawal
AAAI
2000
15 years 4 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
CORR
2006
Springer
189views Education» more  CORR 2006»
15 years 3 months ago
Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks
Abstract--In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integr...
Yufang Xi, Edmund M. Yeh