Sciweavers

358 search results - page 22 / 72
» A Computational Study of Routing Algorithms for Realistic Tr...
Sort
View
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
14 years 3 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
CONEXT
2006
ACM
14 years 2 months ago
Mobile agents based framework for routing and congestion control in mobile ad hoc networks
In this paper, we present a Mobile Agents based Framework for Routing and Congestion control in Mobile Ad Hoc Networks (MAFRC). The framework uses a cross-layer design approach wh...
H. M. P. Shekhar, K. S. Ramanatha
IPPS
1997
IEEE
14 years 20 days ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 3 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ICNP
1998
IEEE
14 years 22 days ago
On Reducing the Processing Cost of On-Demand QoS Path Computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network...
George Apostolopoulos, Satish K. Tripathi