- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Parrondo's paradox in network communication: A routing strategy

Ankit Mishra1, Tao Wen2, and Kang Hao Cheong1,2,*

  • 1Science, Mathematics and Technology, Singapore University of Technology and Design, 8 Somapah Road, S487372, Singapore
  • 2Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, S637371, Singapore

  • *Corresponding author: kanghao.cheong@ntu.edu.sg
PDF

Phys. Rev. Research 6, L012037 – Published 22 February, 2024

DOI: https://doi.org/10.1103/PhysRevResearch.6.L012037

Abstract

The throughput and latency bottleneck in accessing system resources is prevalent in all communication systems. Likewise, communication overhead in modern computer systems is a vital limiting factor in their performance. In this Letter, we propose a routing strategy to improve communication in networks based on Parrondo's paradox. We show that random switching between the shortest-path algorithm and making the local optimum choice (greedy algorithm) yields a significant reduction in total transmission weight compared to when the shortest-path and greedy algorithms are operated separately. This effect recapitulates Parrondo's paradox, where two games/strategies are losing when played alone but create a winning outcome or optimum results when combined in a certain manner. The performance of the switching strategy is further validated under various parameters, and the results indicate that the effect is more remarkable with an increase in the number of packets and the number of nodes in the system. The proposed routing strategy enhances efficiency and scalability in modern computer and communication systems.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (51)

  1. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002).
  2. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks, Adv. Phys. 51, 1079 (2002).
  3. M. Perc, J. J. Jordan, D. G. Rand, Z. Wang, S. Boccaletti, and A. Szolnoki, Statistical physics of human cooperation, Phys. Rep. 687, 1 (2017).
  4. Z. Liu, Y. Deng, and R. R. Yager, Measure-based group decision-making with principle-guided social interaction influence for incomplete information: A game theoretic perspective, IEEE Trans. Fuzzy Syst. 30, 1149 (2021).
  5. K. Hinton, J. Baliga, M. Feng, R. Ayre, and R. S. Tucker, Power consumption and energy efficiency in the internet, IEEE Network 25, 6 (2011).
  6. A. Arenas, A. Díaz-Guilera, and R. Guimera, Communication in networks with hierarchical branching, Phys. Rev. Lett. 86, 3196 (2001).
  7. K.-I. Goh, B. Kahng, and D. Kim, Universal behavior of load distribution in scale-free networks, Phys. Rev. Lett. 87, 278701 (2001).
  8. A. E. Motter, Cascade control and defense in complex networks, Phys. Rev. Lett. 93, 098701 (2004).
  9. I. Simonsen, L. Buzna, K. Peters, S. Bornholdt, and D. Helbing, Transient dynamics increasing network vulnerability to cascading failures, Phys. Rev. Lett. 100, 218701 (2008).
  10. G. Yan, T. Zhou, B. Hu, Z.-Q. Fu, and B.-H. Wang, Efficient routing on complex networks, Phys. Rev. E 73, 046108 (2006).
  11. Z. Eisler and J. Kertész, Random walks on complex networks with inhomogeneous impact, Phys. Rev. E 71, 057104 (2005).
  12. A. P. S. de Moura, Fermi-Dirac statistics and traffic in complex networks, Phys. Rev. E 71, 066114 (2005).
  13. X. Ling, R. Jiang, X. Wang, M.-B. Hu, and Q.-S. Wu, Traffic of packets with non-homogeneously selected destinations in scale-free network, Physica A 387, 4709 (2008).
  14. B. Tadić, S. Thurner, and G. J. Rodgers, Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations, Phys. Rev. E 69, 036102 (2004).
  15. W.-X. Wang, B.-H. Wang, C.-Y. Yin, Y.-B. Xie, and T. Zhou, Traffic dynamics based on local routing protocol on a scale-free network, Phys. Rev. E 73, 026111 (2006).
  16. W.-X. Wang, C.-Y. Yin, G. Yan, and B.-H. Wang, Integrating local static and dynamic information for routing traffic, Phys. Rev. E 74, 016101 (2006).
  17. J. Zhang, J. Ma, and H.-J. Li, An efficient link closing strategy for improving traffic capacity on scale-free networks, Physica A 604, 127887 (2022).
  18. J. Ma and L. Kong, The influence of edge-adding strategy on traffic capacity of multilayer network, Chaos, Solitons Fractals 168, 113110 (2023).
  19. H. Lin, Y. Xia, and Y. Liang, Efficient routing for spatial networks, Chaos 32, 053110 (2022).
  20. L. Gao, P. Shu, M. Tang, W. Wang, and H. Gao, Effective traffic-flow assignment strategy on multilayer networks, Phys. Rev. E 100, 012310 (2019).
  21. A. Solé-Ribalta, A. Arenas, and S. Gómez, Effect of shortest path multiplicity on congestion of multiplex networks, New J. Phys. 21, 035003 (2019).
  22. C. Li, T. Li, Y.-X. Liu, and P. Cappellaro, Effective routing design for remote entanglement generation on quantum networks, npj Quantum Inf. 7, 1 (2021).
  23. S. DiAdamo, B. Qi, G. Miller, R. Kompella, and A. Shabani, Packet switching in quantum networks: A path to the quantum internet, Phys. Rev. Res. 4, 043064 (2022).
  24. K.-C. Leung, V. O. K. Li, and D. Yang, An overview of packet reordering in transmission control protocol (TCP): Problems, solutions, and challenges, IEEE Trans. Parallel Distrib. Syst. 18, 522 (2007).
  25. J. Postel, Transmission Control Protocol, Tech. Rep. University of Southern California, 1981.
  26. D. Murray, T. Koziniec, K. Lee, and M. Dixon, Large MTUs and internet performance, in Proceedings of the IEEE 13th International Conference on High Performance Switching and Routing (IEEE, Belgrade, Serbia, 2012), pp. 82–87.
  27. C. Shannon, D. Moore, and K. C. Claffy, Beyond folklore: Observations on fragmented traffic, IEEE/ACM Trans. Networking 10, 709 (2002).
  28. E. Brosh, S. A. Baset, V. Misra, D. Rubenstein, and H. Schulzrinne, The delay-friendliness of TCP for real-time traffic, IEEE/ACM Trans. Netw. 18, 1478 (2010).
  29. I. Coonjah, P. C. Catherine, and K. M. S. Soyjaudah, Experimental performance comparison between TCP vs UDP tunnel using open VPN, in Proceedings of the International Conference on Computing, Communication and Security (ICCCS) (IEEE, Pointe aux Piments, Mauritius, 2015), pp. 1–5.
  30. S. Bansal, R. Shorey, and A. A. Kherani, Performance of TCP and UDP protocols in multi-hop multi-rate wireless networks, in Proceedings of the IEEE Wireless Communications and Networking Conference, Vol. 1 (IEEE, Atlanta, GA, USA, 2004), pp. 231–236.
  31. M. Masirap, M. H. Amaran, Y. M. Yussoff, R. Ab Rahman, and H. Hashim, Evaluation of reliable UDP-based transport protocols for internet of things (IoT), in Proceedings of the IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE) (IEEE, Penang, Malaysia, 2016), pp. 200–205.
  32. T. Le, G. Kuthethoor, C. Hansupichon, P. Sesha, J. Strohm, G. Hadynski, D. Kiwior, and D. Parker, Reliable user datagram protocol for airborne network, in Proceedings of the MILCOM 2009-2009 IEEE Military Communications Conference (IEEE, Boston, MA, USA, 2009), pp. 1–6.
  33. H. Zheng and J. Boyce, An improved UDP protocol for video transmission over internet-to-wireless networks, IEEE Trans. Multimedia 3, 356 (2001).
  34. J. Kay and J. Pasquale, The importance of non-data touching processing overheads in TCP/IP, in Proceedings of the Conference Proceedings on Communications Architectures, Protocols and Applications (Association for Computing Machinery, California, San Francisco, USA, 1993), pp. 259–268.
  35. Z. Walczak and J. H. Bauer, Parrondo's paradox in quantum walks with deterministic aperiodic sequence of coins, Phys. Rev. E 104, 064209 (2021).
  36. J. Rajendran and C. Benjamin, Playing a true parrondo's game with a three-state coin on a quantum walk, Europhys. Lett. 122, 40004 (2018).
  37. C. E. M. Pearce, Entropy, Markov information sources and parrondo games, in AIP Conference Proceedings, Vol. 511 (American Institute of Physics, 2000), pp. 207–212.
  38. J. W. Lai and K. H. Cheong, Social dynamics and parrondo's paradox: A narrative review, Nonlinear Dyn. 101, 1 (2020).
  39. Y. Ye, K. H. Cheong, Y.-w. Cen, and N.-g. Xie, Effects of behavioral patterns and network topology structures on Parrondo's paradox, Sci. Rep. 6, 37028 (2016).
  40. T. Wen, K. H. Cheong, J. W. Lai, J. M. Koh, and E. V. Koonin, Extending the lifespan of multicellular organisms via periodic and stochastic intercellular competition, Phys. Rev. Lett. 128, 218101 (2022).
  41. D. Abbott, Developments in Parrondo’s paradox, Applications of Nonlinear Dynamics: Model and Design of Complex Systems (Springer, 2009), pp. 307–321.
  42. L. Qiu, V. N. Padmanabhan, and G. M. Voelker, On the placement of web server replicas, in Proceedings of the IEEE INFOCOM 2001, Anchorage, AK, USA, 2001, Vol. 3 (IEEE, Anchorage, AK, USA, 2001), pp. 1587–1596.
  43. S. Sourav, P. Robinson, and S. Gilbert, Slow links, fast links, and the cost of gossip, IEEE Trans. Parallel Distrib. Syst. 30, 2130 (2019).
  44. B. Li, M. J. Golin, G. F. Italiano, X. Deng, and K. Sohraby, On the optimal placement of web proxies in the Internet, in Proceedings of the IEEE INFOCOM '99. Conference on Computer Communications, (IEEE, New York, NY, USA, 1999), Vol. 3, pp. 1282–1290.
  45. R. Jain, A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks, ACM SIGCOMM Comput. Commun. Rev. 19, 56 (1989).
  46. T. Høiland-Jørgensen, B. Ahlgren, P. Hurtig, and A. Brunstrom, Measuring latency variation in the Internet, in Proceedings of the 12th International Conference on Emerging Networking Experiments and Technologies (Association for Computing Machinery, California, Irvine, USA, 2016), pp. 473–480.
  47. R. Mittal, V. T. Lam, N. Dukkipati, E. Blem, H. Wassel, M. Ghobadi, A. Vahdat, Y. Wang, D. Wetherall, and D. Zats, TIMELY: RTT-based congestion control for the datacenter, ACM SIGCOMM Comput. Commun. Rev. 45, 537 (2015).
  48. G. Carlucci, L. De Cicco, S. Holmer, and S. Mascolo, Analysis and design of the google congestion control for web real-time communication (webRTC), in Proceedings of the 7th International Conference on Multimedia Systems (Association for Computing Machinery, Klagenfurt, Austria, 2016), pp. 1–12.
  49. N. G. Duffield and F. L. Presti, Multicast inference of packet delay variance at interior network links, in Proceedings of the IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 (IEEE, Tel Aviv, Israel, 2000), pp. 1351–1360.
  50. C.-Y. Yin, B.-H. Wang, W.-X. Wang, T. Zhou, and H.-J. Yang, Efficient routing on scale-free networks based on local information, Phys. Lett. A 351, 220 (2006).
  51. L. A. Braunstein, S. V. Buldyrev, R. Cohen, S. Havlin, and H. E. Stanley, Optimal paths in disordered complex networks, Phys. Rev. Lett. 91, 168701 (2003).

Outline

Information

Phys. Rev. Research 6, L012037– Published 22 February, 2024
  • Received 2 June 2023
  • Accepted 4 January 2024
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation