Traffic congestion in spatial broadcasting networks

Authors

Gerold Pedemonte ⋅ PH National Institute of Physics, University of the Philippines Diliman
May Lim ⋅ PH National Institute of Physics, University of the Philippines Diliman

Abstract

We study congestion in communication networks that use a shortest path route algorithm for packet delivery and have fixed geographical node locations. Packets are generated at a constant rate at randomly selected source nodes for delivery to randomly designated destination nodes. Each node has a fixed forwarding rate: packets wait at a node’s queue until it is processed (accepted or forwarded). Using the average waiting time of packets at a node, we show how traffic flow changes from free flow to a congested state for various spatial network topologies.

Downloads

Issue

2014: Proceedings of the 32nd Samahang Pisika ng Pilipinas Physics Congress

Towards enhanced physics research and education
17-20 October 2014, University of Philippines Diliman, Quezon City

Article ID

SPP2014-5B-02

Section

Complex Systems

Published

2014-10-17

How to Cite

[1]

G Pedemonte and M Lim, Traffic congestion in spatial broadcasting networks, Proceedings of the Samahang Pisika ng Pilipinas 32, SPP2014-5B-02 (2014). URL: https://proceedings.spp-online.org/article/view/1785.