• May 03, 2016 News! IJIET Vol. 5, No. 10 has been indexed by EI (Inspec).   [Click]
  • Jun 28, 2017 News!Vol. 7, No. 9 has been indexed by Crossref.
  • Jun 22, 2017 News!Vol. 7, No. 9 issue has been published online!   [Click]
General Information
    • ISSN: 2010-3689
    • Frequency: Bimonthly (2011-2014); Monthly (Since 2015)
    • DOI: 10.18178/IJIET
    • Editor-in-Chief: Prof. Dr. Steve Thatcher
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: EI (INSPEC, IET), Electronic Journals Library, Google Scholar, Crossref and ProQuest
    • E-mail: ijiet@ejournal.net
Editor-in-chief
Prof. Dr. Steve Thatcher
University of South Australia, Australia
It is my honor to be the editor-in-chief of IJIET. The journal publishes good papers which focous on the advanced researches in the field of information and education technology. Hopefully, IJIET will become a recognized journal among the scholars in the filed of information and education technology.
IJIET 2012 Vol.2(1): 33-35 ISSN: 2010-3689
DOI: 10.7763/IJIET.2012.V2.78

Optimization of Minimum Cost Network Flows with Heuristic Algorithms

K. Kumar

Abstract—In today’s scenario we see that scaling of heterogeneous systems is exponentially increasing. Network operators design their backbone networks to accommodate all traffic efficiently (e.g., without congestion or large delays). However, even if a backbone network suitable for actual traffic is constructed, traffic could significantly differ from the initial traffic as time goes on. As a result, the previously constructed backbone network becomes no longer suitable to the current traffic; it may happen that utilizations of some links are extremely high while utilizations of other links are extremely low. Especially, because high link utilizations cause congestion or large delays, we need to avoid high link utilizations even when traffic fluctuates. A distributed network in composed of a number of autonomous processors . Dividing up resources among many host computers on a network thereby reducing the burden on any one system. Communicating with any one node in this type of network implies that you will be communicating indirectly with all the other nodes. a distributed network can be anonymous, in the sense that you don't really need to know where some data came from or where its destination is. The network distance between the client and the server we can deploy algorithms to enhance the speed with can retrieve information.

Index Terms—Heuristic, optimization, infrastructure, implementation, optimization.

K. Kumar is with the MCA Dept, Veltech Dr. RR and Dr. SR Technical University, India (e-mail: Hellokumar76@yahoo.co.in).

[PDF]

Cite: K. Kumar, "Optimization of Minimum Cost Network Flows with Heuristic Algorithms," International Journal of Information and Education Technology vol. 2, no. 1, pp. 33-35, 2012.

Copyright © 2008-2017. International Journal of Information and Education Technology. All rights reserved.
E-mail: ijiet@ejournal.net