A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Stochastic selfish routing
2012
ACM SIGecom Exchanges
Preserved Fulltext
routing problems. ...
We embark on an agenda to investigate how stochastic delays and risk aversion transform traditional models of routing games and the corresponding equilibrium concepts. ...
The stochastic routing game with nonconstant variances does not admit a cardinal potential. ...
doi:10.1145/2325713.2325717
fatcat:xd5wh5iysbcv3n5g2ihx3jqrjm
Stochastic Selfish Routing
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
routing problems. ...
We embark on an agenda to investigate how stochastic delays and risk aversion transform traditional models of routing games and the corresponding equilibrium concepts. ...
The stochastic routing game with nonconstant variances does not admit a cardinal potential. ...
doi:10.1007/978-3-642-24829-0_28
fatcat:bcaywmtuandlpikdmlglkuhvxu
Selfish routing revisited: degeneracy, evolution and stochastic fluctuations
2011
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We should also stress here that the channel gain coefficients g kα are the only stochastic parameters in our model, and, in our static channel setting, they are given by g kα = |h kα | 2 , where h is a ...
directions to be explored include the speed of convergence of the replicator dynamics to equilibrium (which can be shown to be exponentially fast) and the robustness of the replicator dynamics under stochastic ...
doi:10.4108/icst.valuetools.2011.245732
dblp:conf/valuetools/MertikopoulosM11
fatcat:ahgtoxga6nffln3ro45yqehzqi
Selfish routing equilibrium in stochastic traffic network: A probability-dominant description
2017
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network. ...
These imply that PdUE (rather than the conventional stochastic user equilibrium) is a desirable selfish routing equilibrium for a stochastic network, given that the probability distributions of travel ...
Seeing this trend, this paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network where the probability distributions ...
doi:10.1371/journal.pone.0183135
pmid:28829834
pmcid:PMC5567920
fatcat:ah6t3ipdqnepjcnmbtmobpdxwq
Balancing Selfishness and Efficiency in Mobile Ad-hoc Networks: An Agent-based Simulation
2020
Proceedings of the 12th International Conference on Agents and Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
If only different levels of selfishness are allowed then being selfish is clearly the dominant strategy. However, introduction of more advanced strategies allows to some extent to combat selfishness. ...
In our model agents with different strategies such as being selfish, tit-for-tat or battery-based compete and cooperate. ...
The selfishness of binary and stochastic agents is their willingness to refuse routing, i.e. 0 or 1 for binary agents and a value within [0, 1] for stochastic agents. ...
doi:10.5220/0008915101610168
dblp:conf/icaart/KoreckiGV20
fatcat:z5yqvrud5jgfvlf2wh4x27smgm
A futuristic trust coefficient-based semi-Markov prediction model for mitigating selfish nodes in MANETs
2015
EURASIP Journal on Wireless Communications and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hence, a prediction model that assesses network survivability through stochastic properties derived from nodes' behaviour becomes essential. ...
But, the selfish mobile nodes pose devastating influence towards network survivability. ...
into selfish node μ sc -stochastic probability for a selfish node to rehabilitate into cooperative mobile node μ sf -stochastic probability for a cooperative mobile node or a selfish node to turn into ...
doi:10.1186/s13638-015-0384-4
fatcat:gwhx45qaqfbcdghbub2fgkvl4a
Reinforcement Learning for Routing in Ad Hoc Networks
2007
2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We show how routing in ad hoc networks can be modeled as a sequential decision making problem with incomplete information. ...
More precisely, we show how to map routing into a reinforcement learning problem involving a partially observable Markov decision process, and present an algorithm for optimizing the performance of the ...
A PathRater module is then used to rate routes and to avoid routes with misbehaving nodes. The main problem with the Watchdog is that it does not penalize selfishness, but rather encourages it. ...
doi:10.1109/wiopt.2007.4480049
dblp:conf/wiopt/Nurmi07
fatcat:vcyevnnrgrckhoh5nncxl3rmzq
PERFORMANCE ANALYSIS OF DSR ROUTING PROTOCOL UNDER ENERGY BASED SELFISH ATTACK IN MOBILE AD HOC NETWORKS
2010
ICTACT Journal on Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. ...
We present a simulation study of the effects of Energy based selfish nodes (EBSN) on DSR routing protocol and its impact over network performance in terms of throughput and delay of a mobile ad hoc network ...
Then, in section 3, we give details on our Energy based selfish nodes (EBSN) model that include selfish behavior at routing level. ...
doaj:d321d7bbf83b4f3a9a393d121a2f3870
fatcat:ywtnw3bdcfcmph5jjyuxmfexku
Dynamic Tolling for Inducing Socially Optimal Traffic Loads
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
How to design tolls that induce socially optimal traffic loads with dynamically arriving travelers who make selfish routing decisions? ...
The updates of loads and tolls in our dynamics have three key features: (i) The total demand of incoming and outgoing travelers is stochastically realized; (ii) Travelers are myopic and selfish in that ...
Additionally, travelers are selfish in that they prefer to choose the routes with the minimum cost -travel time cost and the tolls combined. ...
arXiv:2110.08879v1
fatcat:ysejf6xh2zg7ratf3lijjxzat4
Extreme Nash Equilibria
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a certain objective function, in the context of a selfish routing game. ...
In a Nash equilibrium, each user routes its traffic on links that minimize its expected latency cost. ...
We are also very grateful to Petra Berenbrink and Tasos Christophides for many helpful discussions on stochastic orders. ...
doi:10.1007/978-3-540-45208-9_1
fatcat:qocxx5cfrnf2rhofkezulxnv7q
Structure and complexity of extreme Nash equilibria
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We study extreme Nash equilibria in the context of a selfish routing game. ...
In a Nash equilibrium, each user selfishly routes its traffic on those links that minimize its expected latency cost. ...
We are also very grateful to Petra Berenbrink and Tasos Christophides for many helpful discussions on stochastic orders. Moreover, we are much obliged to Andreas Baltz for discussions on Theorem 5.1. ...
doi:10.1016/j.tcs.2005.05.011
fatcat:jmfffybosfdwpiok4jj3cqzpd4
Modeling and Analysis of Connectivity in Mobile Ad Hoc Networks with Misbehaving Nodes
2006
2006 IEEE International Conference on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In particular, we analyze the impact of node misbehavior on network connectivity in a mobile ad hoc network stochastically. ...
The design and evaluation of routing protocols and topology control require sound analysis on network connectivity and node behaviors. ...
as follows: • Cooperative Nodes are active in route discovery and packet forwarding, but not in DoS attack launching. • Failed Nodes are not active in route discovery. • Selfish Nodes are active in route ...
doi:10.1109/icc.2006.254994
dblp:conf/icc/XingW06
fatcat:unuo3xe745f4nioemnunexceyy
Upper Bounds on Inefficiency of Taxed Stackelberg Network with Cross- Nested Logit Assignment
2014
Open Cybernetics and Systemics Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper initially explores it in a taxed stochastic traffic network whose equilibrium flow pattern is deduced by a cross-nested Logit (CNL) flow assignment model, and a centrally controlling Stackelberg ...
assumptions of separability, nondecreasingness, and convexity of the link time function and the fixed origin-destination (OD) demand of network, the equivalent variational inequality for a CNL-based stochastic ...
INTRODUCTION How is the efficiency loss of users' selfish route choice behaviors affected by traffic assignment model, stochastic factor in traveler route selection, routing strategies, and tax schemes ...
doi:10.2174/1874110x014080101091
fatcat:wwsxkn3uozgghnynszg3skbhla
STOCHASTIC MULTICRITERIA ACCEPTABILITY BASED ROUTING TECHNIQUE FOR AD HOC NETWORK
2017
International Journal of Advanced Research in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we are presenting a novel concept of route selection "SMART" in which stochastic multi-criteria acceptability analysis method is used to find the best route for transmission of packet from ...
Reactive routing is a technique in which routes are recorded only if they are needed. AODV is most popular reactive routing protocol of mobile ad hoc network. ...
Selfishness: Selfish nodes are node that not participating in the process of routing, not sending HELLO message and reply, dropping data , packet and deleting RREQ packet. ...
doi:10.26483/ijarcs.v8i7.3960
fatcat:kibjjdhgkbfyjegd3g3ru55b3i
Trust Management for Encounter-Based Routing in Delay Tolerant Networks
2010
2010 IEEE Global Telecommunications Conference GLOBECOM 2010
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
of epidemic routing, especially as the percentage of selfish and malicious nodes present in the DTN system increases. ...
By utilizing a stochastic Petri net model describing a DTN behavior, we analyze the performance characteristics of these two routing protocols in terms of message delivery ratio, latency, and message overhead ...
routing when many selfish nodes exist. ...
doi:10.1109/glocom.2010.5683235
dblp:conf/globecom/ChenBCC10
fatcat:6iaoetk2kzfr7nlxsf5bb7dova
« Previous
Showing results 1 — 15 out of 2,284 results