The Throughput Flow Constraint Theorem and its Applications
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 3
Abstract
The paper states and proves an important result related to the theory of flow networks with disturbed flows:“the throughput flow constraint in any network is always equal to the throughput flow constraint in its dual network”. After the failure or congestion of several edges in the network, the throughput flow constraint theorem provides the basis of a very efficient algorithm for determining the edge flows which correspond to the optimal throughput flow from sources to destinations which is the throughput flow achieved with the smallest amount of generation shedding from the sources. In the case where a failure of an edge causes a loss of the entire flow through the edge, the throughput flow constraint theorem permits the calculation of the new maximum throughput flow to be done in time, where m is the number of edges in the network.In this case, the new maximum throughput flow is calculated by inspecting the network only locally, in the vicinity of the failed edge, without inspecting the rest of the network. The superior average running time of the presented algorithm, makes it particularly suitable for decongesting overloaded transmission links of telecommunication networks, in real time.In the paper, it is also shown that the deliberate choking of flows along overloaded edges, leading to a generation of momentary excess and deficit flow, provides a very efficient mechanism for decongesting overloaded branches.
Authors and Affiliations
Michael Todinov
Keywords
Related Articles
- EP ID EP157534
- DOI 10.14569/IJACSA.2014.050302
- Views 108
- Downloads 0
Automated Quantification of Non-Calcified Coronary Plaques in Cardiac CT Angiographic Imagery
The high mortality rate associated with coronary heart disease (CHD) has driven intensive research in cardiac image analysis. The advent of computed tomography angiogra-phy (CTA) has turned non-invasive diagnosis of card...
A Novel Broadcast Scheme DSR-based Mobile Adhoc Networks
Traffic classification seeks to assign packet flows to an appropriate quality of service (QoS). Despite many studies that have placed a lot of emphasis on broadcast communication, broadcasting in MANETs is still a proble...
ComplexCloudSim: Towards Understanding Complexity in QoS-Aware Cloud Scheduling
The cloud is generally assumed to be homogeneous in most of the research efforts related to cloud resource management and the performance of cloud resource can be determined as it is predictable. However, a plethora of c...
An Enhanced Weighted Associative Classification Algorithm without Preassigned Weight based on Ranking Hubs
Heart disease is the preeminent reasons for death worldwide and in excess of 17 million individuals were kicked the bucket from heart disease in the past years and the mortality rate will be increased in upcoming years r...
Automatic Facial Expression Recognition Based on Hybrid Approach
The topic of automatic recognition of facial expressions deduce a lot of researchers in the late last century and has increased a great interest in the past few years. Several techniques have emerged in order to improve...