Results 1 to 10 of about 1,225 (207)
Routing selfish unsplittable traffic [PDF]
ACM Transactions on Algorithms, 2007 We consider general resource assignment games involvingselfish users/agentsin which users compete for resources and try to be assigned to those which maximize their own benefits (e.g., try to route their traffic through links which minimize the latency of their own traffic).
Vincenzo Auletta +2 more
exaly +4 more sources
The price of atomic selfish ring routing [PDF]
Journal of Combinatorial Optimization, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Chen, Xujin Chen, Xiaodong Hu
exaly +3 more sources
DSNAODV: Detecting Selfish Nodes based on Ad hoc On-demand Distance Vector routing protocol [PDF]
Journal of Mahani Mathematical Research, 2022 In mobile ad hoc networks (MANETs), innumerable intermediate nodes interchange information without the need for infrastructure. In these networks, nodes depend upon each other for routing and forwarding packets, and communication among them is very ...
Mahboubeh Vanday Baseri +1 more
doaj +2 more sources
Selfish routing equilibrium in stochastic traffic network: A probability-dominant description. [PDF]
PLoS ONE, 2017 This paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network. At PdUE, travel demands are only assigned to the most dominant routes in the same origin-destination ...
Wenyi Zhang +3 more
doaj +2 more sources
A selfish node trust aware with Optimized Clustering for reliable routing protocol in Manet
Measurement: Sensors, 2023 Reliable routing in MANET is a pivotal element in real-world scenarios. The former works introduced a novel routing protocol namely, Trustable Energy-based Clustering and Optimized Routing (TECROP).
K. Nirmaladevi, K. Prabha
exaly +3 more sources
Selfish Yet Optimal Routing by Adjusting Perceived Traffic Information of Road Networks
IEEE Open Journal of Intelligent Transportation Systems, 2020 Traffic congestion in urban areas causes economic and time loss. Such traffic congestion is caused by selfish routing where users aim to minimize their own travel time.
Takanori Hara +2 more
doaj +2 more sources
How bad is selfish routing? [PDF]
Journal of the ACM, 2002 We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times---the ...
Tim Roughgarden +2 more
exaly +2 more sources
The Value of Information in Selfish Routing [PDF]
Lecture Notes in Computer Science, 2020 Path selection by selfish agents has traditionally been studied by comparing social optima and equilibria in the Wardrop model, i.e., by investigating the Price of Anarchy in selfish routing. In this work, we refine and extend the traditional selfish-routing model in order to answer questions that arise in emerging path-aware Internet architectures ...
Simon Scherrer +2 more
exaly +5 more sources
A new model for selfish routing [PDF]
Theoretical Computer Science, 2004 The authors study a new model for selfish routing over non-cooperative networks, as an hybridization of the two prevailing such models, namely the KP model [\textit{E. Koutsoupias} and \textit{C. Papadimitriou}, ``Worst-case equilibria'', Lect. Notes Comput. Sci. 1563, 404--413 (1999; Zbl 1099.91501)] and the W model [Wardrop (1952)].
Lücking, T. +7 more
openaire +4 more sources
Selfish Routing with Incomplete Information [PDF]
Theory of Computing Systems, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Gairing +2 more
openaire +1 more source