W.-K. Chen, "Theory of Nets: Flows in Networks", John Wiley & Sons, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....module is located within the NCC (i.e. it is a centralized algorithm) it has to deal with all the connections passing through the network. The congestion control problem, as already discussed, requires an iterative algorithm, whose complexity grows significantly with the number of connections [5]. The developed congestion control algorithm is based on two original concepts: i. it works onto a reduced set of inputs, thanks to a innovative policy of aggregation of the connections; ii. it supports a weight based fairness criterion. In order to reduce the algorithm complexity, the ....

W. Chen, Theory of nets: flows in networks, J. Whiley & Sons inc., 1990.

.... flow problem with node capacities given by X j2S i X c2C q (c) ij E i =e i ; 8i 2 N: 12) When the capacity of a a node is a fixed quantity as in (12) then the problem can be converted to a link capacity version by replacing the node with two nodes and a link having the same capacity[4], and the max flow min cut theorem[5] can be used. However, in our problem, unlike the above, the amount of resource (or energy in this case) which a unit flow consumes depends on the energy expenditure to the next hop node. Therefore, it is not trivial to find the min cut nodes, and even if they ....

Wai-Kai Chen, Theory of Nets: Flows in Networks, Wiley, 1990.

....is a case based reasoning system for optimised route planning [5] Given a connected graph (e.g. a network of cities) PathFinder will attempt to find the shortest path between any two nodes (cities) on this graph. The traditional brute force approach epitomised by Dijkstra s greedy algorithm [6] produces optimal paths but is computationally expensive. The precise details of the PathFinder system are not important here. In brief, the system employs a case base of previous routes (which are optimal, having been produced by Dijkstra s method) in an attempt to significantly reduce the time ....

Chen, W. K., Theory of Nets: Flows in Networks. John Wiley & Sons, New York. (1990)

....For the traffic load balancing (smoothing ) as the second phase of cost function optimisation we used simulated annealing. The algorithm consists of the following steps: 1. Creation of the shortest path table on the basis of the algorithm for the shortest paths. We used the matrix algorithm [11]. The input for this algorithm are hardware and software graphs. 2. Creation of the routing table which is at the beginning initialised to the shortest path table. 3. There is a randomly chosen path and randomly chosen processor on it and then is randomly chosen neighbouring processor and this new ....

CHEN, W.K.: Theory of nets: flows in networks. John Wiley & Sons, Inc., 1990, 493 pp.

....is a case based reasoning system for optimised route planning [5] Given a connected graph (e.g. a network of cities) PathFinder will attempt to find the shortest path between any two nodes (cities) on this graph. The traditional brute force approach epitomised by Dijkstra s greedy algorithm [6] produces optimal paths but is computationally expensive. The precise details of the PathFinder system are not important here. In brief, the system employs a case base of previous routes (which are optimal, having been produced by Dijkstra s method) in an attempt to significantly reduce the time ....

Chen, W. K., Theory of Nets: Flows in Networks. John Wiley & Sons, New York. (1990)

No context found.

W.-K. Chen, "Theory of Nets: Flows in Networks", John Wiley & Sons, 1990.

No context found.

W.-K. Chen, Theory Of Nets: Flows In Networks. John Wiley and Sons, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC