MATHEMATICAL MODELING ON NETWORK FRACTIONAL ROUTING THROUGH INEQUALITIES
Journal Title: International Journal on Computer Science and Engineering - Year 2014, Vol 6, Issue 12
Abstract
A Network is a set, directed, acyclic multigraph over which messages can be transmitted from source node to sink node. Linear programming is one of the most important optimization techniques to help decision making in network. The linear programming problem calls for optimising linear functions of variables called objective function, subject to a set of linear equations and /or inequalities called constraints. The objective function maximize either the total out-flow from source node or total inflow to sink node. We will prove fractional routing capacity for some solvable network using inequalities model.
Authors and Affiliations
S. Asokan , P. Vanitha Muthu
Keywords
Related Articles
- EP ID EP163208
- DOI -
- Views 116
- Downloads 0
Power Control Technique for Efficient Call Admission Control in Advanced Wirless Networks
In 4G networks, call admission control techniques have been proposed to provide Quality of Service (QoS) in a network by restricting the access to network resources. Power control is essential in call admission control i...
RISK BASED TESTING A Fuzzy Approach
Earlier Testers used to concentrate on only functionality, usability or performance sort of testing. Many of these derived by the customer’s desire or need. Same thing was with the risk based testing. If an application u...
A New Method to Improve the Simulation Of Piezoelectric Transducer Using PSPICE And Genetic Algorithms
Piezoelectric transducer (SAW devices) is a very important device in industry but it is very difficult to simulate it using any circuit-simulation program. This paper proposes a practical method to simulate the Mason’s m...
Collaborative Clustering: An Algorithm for Semi-Supervised Learning
Supervised learning is the process of disposition of a set of consanguine data items which have known labels. The apportion of an unlabeled dataset into a conglomeration of analogous items(clusters) by the optimization o...
ACO Based Feature Subset Selection for Multiple k-Nearest Neighbor Classifiers
The k-nearest neighbor (k-NN) is one of the most popular algorithms used for classification in various fields of pattern recognition & data mining problems. In k-nearest neighbor classification, the result of a new i...