Directed and Almost-Directed Flow Loops in Real Networks

Abstract

Directed flow loops are highly undesirable because they are associated with wastage of energy for maintaining them and entail big losses to the world economy. It is shown that directed flow loops may appear in networks even if the dispatched commodity does not physically travel along a closed contour. Consequently, a theorem giving the necessary and sufficient condition of a directed flow loop on randomly oriented straight-line flow paths has been formulated and a close-form expression has been derived for the probability of a directed flow loop. The results show that even for a relatively small number of intersecting flow paths, the probability of a directed flow loop is very large, which means that the existence of directed flow loops in real networks is practically inevitable. Consequently, a theorem and an efficient algorithm have been proposed related to discovering and removing directed flow loops in a network with feasible flows. The new concept ‘almost-directed flow loop’ has also been introduced for the first time. It is shown that the removal of an almost-directed flow loop also results in a significant decrease of the losses. It is also shown that if no directed flow loops exist in the network, the removal of an almost-directed flow loop cannot create a directed flow loop.

Authors and Affiliations

M. Todinov

Keywords

Related Articles

The Solution Structure and Error Estimation for The Generalized Linear Complementarity Problem

In this paper, we consider the generalized linear complementarity problem (GLCP). Firstly, we develop some equivalent reformulations of the problem under milder conditions, and then characterize the solution of the GLCP....

 : Ear Recognition using Dual Tree Complex Wavelet Transform

 nce last 10 years, various methods have been used for ear recognition. This paper describes the automatic localization of an ear and it’s segmentation from the side poses of face images. In this paper, authors have...

Integrated Framework to Study Efficient Spectral Estimation Techniques for Assessing Spectral Efficiency Analysis

The advanced network applications enable software driven spectral analysis of non-stationary signal or processes which precisely involves domain analysis with the purpose of decomposing a complex signal coefficients into...

Experimental Analysis of the Fault Tolerance of the PIM-SM IP Multicast Routing Protocol under GNS3

PIM-SM is the most commonly used IP multicast routing protocol in IPTV systems. Its fault tolerance is examined by experimenting on a mesh topology multicast test network built up by Cisco routers under GNS3. Different f...

Cas-GANs: An Approach of Dialogue Policy Learning based on GAN and RL Techniques

Dialogue management systems are commonly applied in daily life, such as online shopping, hotel booking, and driving booking. Efficient dialogue management policy helps systems to respond to the user in an effective way....

Download PDF file
  • EP ID EP156866
  • DOI 10.14569/IJACSA.2013.040821
  • Views 99
  • Downloads 0

How To Cite

M. Todinov (2013). Directed and Almost-Directed Flow Loops in Real Networks. International Journal of Advanced Computer Science & Applications, 4(8), 152-161. https://europub.co.uk./articles/-A-156866