This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Component Configuration and Component Routing
October-December 2002 (vol. 1 no. 4)
pp. 303-312

Abstract—Code mobility and mobile agents have received a lot of attention as a paradigm based on which distributed applications can be built. There has been little work however on the mathematical modeling of component mobility. In this direction, we present and analyze three optimization models for component mobility. We are seeking the optimal allocation of components to network nodes and the optimal component routes that will minimize the network traffic that is incurred in the course of component communication. Optimal solutions are found either through a Mixed Binary Integer Programming formulation or by employing max flow computations. Complexity results are also reported.

[1] A. Fuggetta, G. Picco, and G. Vigna, "Understanding Code Mobility," IEEE Trans. Software Eng., May 1998, pp. 352-361.
[2] W. Caripe et al., “Network Awareness and Mobile Agent Systems,” IEEE Comm. Magazine, pp. 44-49, July 1998.
[3] M. Ranganathan et al., “Network-Aware Mobile Programs,” Proc. USENIX Ann. Technical Conf., Jan. 1997.
[4] T. Imielinski and B.R. Badrinath, “Wireless Computing: Challenges in Data Management,” Comm. ACM, vol. 37, no. 10, Oct. 1994.
[5] A. Bond et al. “An Information Model for Nomadic Environments,” Proc. Ninth Int'l Workshop Database and Expert Systems Applications, pp. 400-405, 1998.
[6] E. Kovacs, K. Rohrle, and M. Reich, "Integrating Mobile Agents into the Mobile Middleware," Proc. Mobile Agents Int'l Workshop, Springer-Verlag, Berlin, 1998, pp. 124-135.
[7] D.G. Andersen et al. “The Case for Resilient Overlay Networks,” Proc. HotOS VIII, May 2001.
[8] Recommendation Z. 120: Message Sequence Charts (MSC). ITU, 1992.
[9] E. Dahlhaus et. al., “The Complexity of Multiterminal Cuts,” SIAM J. Computing, vol. 23 no. 4, pp. 864-894, Aug. 1994.
[10] M. Anagnostou, “Optimal Distribution of Service Components,” Lecture Notes in Computer Science, no. 1430, pp. 17-30, Springer, 1998.
[11] A. Kind and M. Anagnostou et al., “Creation Practices for Agent-Based Services,” Deliverable D28 of European Union project AC325-MONTAGE, Nov. 1999.
[12] H.S. Stone, “Multiprocessor Scheduling with the Aid of Network Flow Algorithms,” IEEE Trans. Software Eng., vol. 3, no. 1, pp. 85-93, Jan. 1977.
[13] S.H. Bokhari, “Dual Processor Scheduling with Dynamic Reassignment,” IEEE Trans. Software Eng., vol. 5, no. 4, pp. 341-349, July 1979.
[14] P.R. Ma et al. “A Task Allocation Model for Distributed Computing Systems,” IEEE Trans. Computers, vol. 31, no. 1, pp. 41-47, Jan. 1982.
[15] C. Shen, and W. Tsai, “A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion,” IEEE Trans. Computers, vol. 34, no. 3, pp. 197-203, Mar. 1985.
[16] D.L. Eager, E.D. Lazowska, and J. Zahorjan, "Adaptive Load Sharing in Homogeneous Distributed Systems," IEEE Trans. Software Eng., vol. 12, no. 5, pp. 662-675, May 1986.
[17] A. Tantawi and D. Towsley, "Optimal Static Load Balancing in Distributed Computer Systems," J. ACM, vol. 32, pp. 445-465, 1985.
[18] D.L. Eager, E.D. Lazowska, and J. Zahorjan, "The Limited Performance Benefits of Migrating Active Processes for Load Sharing," Proc. ACM Sigmetrics Conf., ACM Press, New York, 1988, pp. 63-72.
[19] K. Moizumi and G. Cybenko, “The Travelling Agent Problem,” Math. of Control, Signals, and Systems, vol. 14, no. 3, pp. 213-232, Jan. 1998.
[20] B.W. Wah, “File Placement on Distributed Computer Systems,” Computer, pp. 23-30, Jan. 1984.
[21] L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem," ACM Computing Surveys, vol. 14, no. 2, 1982.
[22] B. Gavish and O.R.L. Sheng, “Dynamic File Migration in Distributed Computer Systems,” Comm. ACM, vol. 33, no. 2, pp. 177-189, Feb. 1990.
[23] A. Segall, “Dynamic File Assignment in a Computer Network,” IEEE Trans. Automatic Control, vol. 21, no. 2, pp. 161-173, Apr. 1976.
[24] A. Segall and N.R. Sandell, “Dynamic File Assignment in a Computer Network—Part 2: Decentralized Control,” IEEE Trans. Automatic Control, vol. 24, no. 5, pp. 709-715, Oct. 1979.
[25] O. Wolfson, S. Jajodia, and Y. Huang, “An Adaptive Data Replication Algorithm,” ACM Trans. Database Systems, vol. 22, no. 4, pp. 255-314, June 1997.
[26] M. Labbe, “Facility Location: Models, Methods and Applications,” Serie: Mathematiques de la Gestion, Juillet, 1997.
[27] D.P. Bertsekas, “Network Optimization: Continuous and Discrete Models,” Athena Scientific, 1998.
[28] D.P. Bertsekas, “Dynamic Programming and Optimal Control,” Athena Scientific, 1995.

Index Terms:
Mobile agents, component allocation, component mobility, reconfiguration, multiterminal cuts, max flow—min cut, mixed binary integer programming, NP-hard problems.
Citation:
Ioannis C. Avramopoulos, Miltiades E. Anagnostou, "Optimal Component Configuration and Component Routing," IEEE Transactions on Mobile Computing, vol. 1, no. 4, pp. 303-312, Oct.-Dec. 2002, doi:10.1109/TMC.2002.1175543
Usage of this product signifies your acceptance of the Terms of Use.