This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multimedia File Allocation on VC Networks Using Multipath Routing
September 2000 (vol. 49 no. 9)
pp. 971-977

Abstract—The problem of allocating high-volume multimedia files on a virtual circuit network with the objective of maximizing channel throughput (and minimizing data transmission time) is addressed. The problem is formulated as a multicommodity flow problem. We present both the optimal and suboptimal solutions to the problem using novel approaches.

[1] P.S. Chen and J. Akoka, “Optimal Design of Distributed Information Systems,” IEEE Trans. Computers, vol. 29, no. 12, pp. 1,068-1,080, Dec. 1980.
[2] R.S. Chen, D.J. Chen, and Y.S. Yeh, “Reliability Optimization of Distributed Computing Systems Subject to Capability Constraints,” Int'l J. Computers&Math. with Application, vol 29, no. 4, pp. 93-99, 1995.
[3] W. Chu, “Optimal File Allocation in a Computer Network,” Computer-Comm. Systems, pp. 82-94, Englewood Cliffs, N.J.: Prentice Hall, 1973.
[4] L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem," ACM Computing Surveys, vol. 14, no. 2, 1982.
[5] A.E. El-Abd, “Modeling Resources Allocation and Performance Measures in Distributed Computer Networks,” Proc. IEEE Singapore Int'l Conf. Networks/Int'l Conf. Information Eng., pp. 581-586, July 1995.
[6] D. Ferrari, A. Banerjea, and H. Zhang, “Network Support for Multimedia: A Discussion of the Tenet Approach,” Computer Networks and ISDN Systems, vol. 26, no. 10, July 1994.
[7] D.V. Foster, L.W. Dowdy, and J.E. Ames, “File Assignment in a Computer Network,” Computer Network, vol. 5, pp. 341-349, Sept. 1981.
[8] T.C. Hu, Combinatorial Algorithms, pp. 60-83. Menlo Park, Calif.: Addison-Wesley, 1986.
[9] B. Jabbari, “A Bandwidth Allocation Technique for High Speed Networks,” Proc. IEEE GLOBECOM '90, vol. 1, pp. 355-359, Dec. 1990.
[10] J. Kurose and R. Simha, “A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems,” IEEE Trans. Computers, vol. 38, no. 5, May 1989.
[11] A.A. Lazar and G. Pacifici, “Control of Resources in Broadband Networks with Quality of Service Guarantees,” IEEE Comm. Magazine, vol. 29, no. 10, pp. 66-73, Oct. 1991.
[12] S. Mahmoud and J.S. Riordon, “Optimal Allocation of Resources in Distributed Information Networks,” ACM Trans. Database Systems, vol. 1, no. 1, pp. 66-78, Mar. 1976.
[13] V. Malhotra, M. Pramodh Kumar, and S.N. Maheshwari, “An${\rm O(|v|}^3)$Algorithm for Finding Maximum Flows in Networks,” Information Processing Letters, vol. 7, no. 6, pp. 277-278, 1978.
[14] L. Morgan and K.D. Levin, “Optimal Program and Data Locations in Computer Networks,” Comm. ACM, vol. 20, no. 5, pp. 315-322, May 1977.
[15] R. Narsinhan, “Database Allocation in a Distributed Environment: Incorporating Concurrency Control&Queuing Costs,” Management Science, vol. 40, no. 8, Aug. 1994.
[16] M.J. Panik, Linear Programming: Mathematics, Theory and Algorithms. Kluwer Academic, 1996.
[17] R.M. Pathak, A. Kumar, and Y.P. Gupta, “Reliability Oriented Allocation of Files on Distributed Systems,” Proc. IEEE Symp. Parallel and Distributed Processing, pp. 886-893, Dec. 1991.
[18] S. Ram and R.E. Marsten, “A Model for Database Allocation Incorporating a Concurrency Control Mechanism,” IEEE Trans. Knowledge and Data Eng., vol. 3, pp. 389-395, Sept. 1991.
[19] V. Ramamoorthy and K.M. Chandy, “Optimization of Memory Hierarchies in Multiprogrammed Systems,” J. ACM, vol. 17, no. 3, pp. 426-445, July 1970.
[20] D.H. Lee and S.M. Reddy, On Determining Scan Flip-Flops in Partial Scan Designs Proc. IEEE/ACM Int'l Conf. Computer-Aided Design, pp. 322-325, 1990.

Index Terms:
File allocation, virtual circuit, cut, maximum flow, linear programming, branch and bound.
Citation:
Pao-Yuan Chang, Deng-Jyi Chen, Krishna M. Kavi, "Multimedia File Allocation on VC Networks Using Multipath Routing," IEEE Transactions on Computers, vol. 49, no. 9, pp. 971-977, Sept. 2000, doi:10.1109/12.869329
Usage of this product signifies your acceptance of the Terms of Use.