Traffic congestion in spatial broadcasting networks
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
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.
