Linear Capacity and Heuristic Algorithms for Multicommodity Flow in Computer Networks Engineering

F. Zantuti Abdulhakim

doi:10.4028/www.scientific.net/AMR.787.926

Paper Titles

Fault Section Location in Distribution Network with DG Based on Voltage Sag Correlation Coefficient
p.902

Fault Diagnosis for Grounding Grids Based on Genetic Algorithm and Support Vector Machine
p.909

Effect of Poles to the Automatic Control System
p.914

Dynamical Behaviors of Stochastic Reaction-Diffusion Hopfield Neural Networks
p.921

Linear Capacity and Heuristic Algorithms for Multicommodity Flow in Computer Networks Engineering
p.926

A Region-Growing Adaptation-Based Algorithm for the Smart Detection of Remote Sensing Images
p.932

H∞-Based LQR Control for Flexible Air-Breathing Hypersonic Vehicles with Pole Placement
p.938

Method of Detection for Complex Surfaces Based on Industrial Close-Range Photogrammetry
p.944

3D Measurement of Anatomic Parameters and Development of a Digital Design to Improve the Outcome of Lower-Extremity Surgery
p.947

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 787Linear Capacity and Heuristic Algorithms for...

Linear Capacity and Heuristic Algorithms for Multicommodity Flow in Computer Networks Engineering

Abstract:

The problem consists in selection of multicommodity flow routes and channel capacities and the paper presents the linear capacity and heuristic algorithms for multicommodity flow in computer networks engineering to minimize shipping cost subject to the budget constraint

You might also be interested in these eBooks

Advanced Materials Researches, Engineering and Manufacturing Technologies in Industry

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 787)

Pages:

926-931

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.787.926

Citation:

Cite this paper

Online since:

September 2013

Authors:

F. Zantuti Abdulhakim

Keywords:

Algorithm (GA), Channel Capacities, Computer Network, Multicommodity Flow

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Boorstyn R., Frank H., Large scale network topological optimization, IEEE Trans. Commun., vol. com-25, 29-47, (1977).

DOI: 10.1109/tcom.1977.1093708

Google Scholar

[2] Fratta I., Gerla M., Kleinrock L., The flow deviation method: An approach to store and forward communication network design, Networks, vol. 3, 360-366, (1973).

DOI: 10.1002/net.3230030202

Google Scholar

[3] Kennington J.L., A Survey of Linear Cost Multicommodity Networks Flows, Operations Research, Vol. 26, (1978), pp.209-236.

DOI: 10.1287/opre.26.2.209

Google Scholar

[4] Kasprzak A., in: Optimization Algorithms of Flows, Channel Capacity and Topology in Computer Communication Networks, Wroclaw, Wroclaw Technical University, (1989), in press.

Google Scholar

[5] Kasprzak A., An exact algorithm for routing and capacity assignment in computer communication networks, Systems Science, vol. 19, 69-81, (1993).

Google Scholar

[6] Krupa T., Paralld Processing of Resources in T-network, Int. Conf. SYPRO`90, Warsaw, (1990).

Google Scholar

[7] Zantuti A. F., An Approximate Algorithm for Capacity and Non-simultaneously Multicommodity Flow Assignment in Wide Area Network, 12th Int. Conf. on Systems Engineering, Coventry University, UK, 775-777, (1997).

DOI: 10.1109/icseng.2005.81

Google Scholar

[8] Zantuti A. F., Kasprzak A., On the CNSFA Problem in the Wide Area Network, Proc. Int. Conf. on Information System and Technology, 170-174, Poland, (1996).

Google Scholar

[9] Zantuti A. F., Kasprzak A., An Exact Algorithm for Capacity and Non-simultaneously Multicommodity Flow Assignment in Wide Area Network, 11th International Conference on Systems Engineering, University of Nevada, Las Vegas, USA, (1996), pp.182-187.

DOI: 10.1109/icseng.2005.81

Google Scholar

[10] Zantuti A. F., The traffic flow assignment problem in wide area networks, 16th International Conference on Systems Science, Wroclaw University of Technology, Poland, (2007), pp.355-358.

Google Scholar