Results 21 to 30 of about 1,225 (207)

Selfish traffic allocation for server farms [PDF]

, 2010
We study the price of selfish routing in noncooperative networks like the Internet. In particular, we investigate the price of selfish routing using the price of anarchy (a.k.a.
Czumaj, Artur, Krysta, Piotr, Vöcking, Berthold   +2 more
core   +2 more sources

Selfish Routing in Capacitated Networks [PDF]

Mathematics of Operations Research, 2003
According to Wardrop's first principle, agents in a congested network choose their routes selfishly, a behavior that is captured by the Nash equilibrium of the underlying noncooperative game. A Nash equilibrium does not optimize any global criterion per se, and so there is no apparent reason why it should be close to a solution of minimal total travel
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses   +2 more
openaire   +2 more sources

Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem

, 2022
The selfish routing of network flow often considers a single objective, namely travel time or travel distance, and optimisation models are often guided by the principle of user equilibrium (UE).
Berry, S., Popovici, N., Bagdasar, O., O'Neill, S., Raja, R.   +4 more
core   +1 more source

Learning for Multiple-Relay Selection in a Vehicular Delay Tolerant Network

IEEE Access, 2020
In a vehicular delay tolerant network (VDTN), there is no static connection, and the network behavior is highly temporal. This makes determining the routing protocol critical for the performance of a network.
Yuzhen Dong, Fuquan Zhang, Inwhee Joe, Haifeng Lin, Wanguo Jiao, Yan Zhang   +5 more
doaj   +1 more source

Network uncertainty in selfish routing [PDF]

Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006
2006
Georgiou, Chryssis, Pavlides, Theophanis, Philippou, Anna, Georgiou, Chryssis, Pavlides, Theophanis, Philippou, Anna   +5 more
openaire   +2 more sources

Selfish routing in public services [PDF]

European Journal of Operational Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincent A. Knight, Paul R. Harper
openaire   +1 more source

Energy-harvesting Q-learning secure routing algorithm with authenticated-encryption for WSN

ICT Express, 2023
Wireless sensor networks are susceptible to a variety of network attacks. Due to the limited energy of nodes and selfish nodes in the network, the packet delivery rate is lower.
Cuiran Li, Jixuan Wu, Zepeng Zhang, Anqi Lv   +3 more
doaj   +1 more source

Efficient Routing Algorithm Based on Virtual Currency Transaction in DTN [PDF]

Jisuanji kexue
Due to the characteristics of intermittent connection of the delay tolerant network,as well as the limited resources such as the node's own cache and energy,the nodes in the DTN tend to show a certain degree of selfishness.The existence of selfish nodes ...
CUI Jianqun, LIU Shan, CHANG Yanan, LIU Qiangqiang, WU Qingcheng
doaj   +1 more source

A fair credit-based incentive mechanism for routing in DTN-based sensor network with nodes’ selfishness

EURASIP Journal on Wireless Communications and Networking, 2020
Due to the unguaranteed connectivity, wireless sensor networks based on delay tolerant network (DTN) are typically characterized by the opportunistic forwarding mechanism in transmission.
Yuxin Mao, Chenqian Zhou, Ji Qi, Xudong Zhu   +3 more
doaj   +1 more source

Strategic Information Design In Selfish Routing With Quantum Response Travelers

, 2023
Selfish routing begets inefficiency in multi-agent transportation systems, leading to significant economic losses in our society. Although several powerful techniques (e.
Das, Sajal K., Telukunta, Mukund, Nadendla, Venkata Sriram Siddhardh, Sanga, Sainath   +3 more
core   +1 more source