Autosoft Journal

Online Manuscript Access

An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios



With limited physical and virtual resources in cloud computing systems, it is not feasible to successively expand network infrastructure to adequately support the rapid growth in service. So the pervasive boundary in communication networks is that of allocating bandwidth to satisfy a given collection of service requests is hard to reach. In situations where there is limited network capacity but plethory of requests, the current optimal methodology of the choice of which requests to satisfy, thereby resulting in congestion and low utilization rate.It is imperative to develop new efficient scheduling methods. In this paper, we demonstrate these concepts through a case test study of scheduling for multicommodity flows in cloud-service environment by successive heuristics algorithms, and the heuristic solutions are then compared with the related network performance metrics obtained using the presented model. The effectiveness of the new technique was evaluated by comparison to the differentiated cost utilization and the comparison indicates that substantial improvements are possible. Then the lower cost of deployment on the cloud-computing systems can be justified. Moreover, developing an approximation optimization model can be beneficial to the communication network planning.



Total Pages: 10
Pages: 143-152


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways

Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Volume: 22
Issue: 1
Year: 2015

Cite this document


Alvelos F. Technical report

Anshelevich E. European Symposium on Algorithms (ESA) 28.39 (2004)

Cruz R. L. Proceeding of IEEE INFOCOM

David B. Ad Hoc networking, DSR: The dynamic source routing protocol for multi-hop wireless Ad Roc networks

Fleischer, Lisa K. "Approximating Fractional Multicommodity Flow Independent of the Number of Commodities." SIAM Journal on Discrete Mathematics 13.4 (2000): 505-520. Crossref. Web.

Glineur, François. "Improving Complexity of Structured Convex Optimization Problems Using Self-Concordant Barriers." European Journal of Operational Research 143.2 (2002): 291-310. Crossref. Web.

Gunluk O. Integer programming and combinatorial optimization Proceedings of the 9th IPCO conferecnce

Josefsson, M. & Patriksson, M. (2003). Sensitivity analysis of separable traffic equilibrium equilibria, with application to bi-level optimization in network design. Report, Department of Mathematics, Chalmers University of technology, Gotheburg.

Lai K. Multiagent Grid Systems

Larsson, Torbjörn, and Di Yuan. "An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing." Computational Optimization and Applications 27.2 (2004): 187-215. Crossref. Web.

Lin, X., and N.B. Shroff. "Utility Maximization for Communication Networks With Multipath Routing." IEEE Transactions on Automatic Control 51.5 (2006): 766-781. Crossref. Web.

Mamer, John W., and Richard D. McBride. "A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem." Management Science 46.5 (2000): 693-709. Crossref. Web.

Neely, M.J., E. Modiano, and C.E. Rohrs. "Dynamic Power Allocation and Routing for Time-Varying Wireless Networks." IEEE Journal on Selected Areas in Communications 23.1 (2005): 89-103. Crossref. Web.

Nesterov, Yu. "Smooth Minimization of Non-Smooth Functions." Mathematical Programming 103.1 (2004): 127-152. Crossref. Web.

Racke H. Proceeding of ACM STOC


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048