Resources Allocation and Failures in Step Topology under Distributed Computing System
- 1 Department of Computer Science, Babasaheb Bhimrao Ambedkar University, Lucknow, India.
- 2 Department of Computer Science, Babasaheb Bhimrao Ambedkar University, Lucknow, India
Abstract
In the past years, distributed computing is gaining the popularity due to reduction in execution time and low cost involvement. On the basis of this, Mobile Adhoc Network (MANET) is also increasing worldwide with major advantage that it has no involvement of wire and transfer of data can be done by the virtual paths if the existing path is congested. In the present work, MANET is considered in the form of step topology which consists of heterogeneous collection of the devices. The work demonstrates the resources allocation for execution of tasks and it consists of selection of right path if the link failures and by pass link failures. It also consists of the resource management over the new proposed step topology. Entire work is modeled with the help of well known modeling language known as Unified Modeling Language (UML) and model demonstrates the resources allocation for execution of the tasks .
- A. Siberschatz and P. B. Galvin, “Operating Systems Concepts,” 5th Edition, John Wiley and Sons, Inc. New York, 2008.
- B. A. Frouzen, “Data Communications and Networks,” Tata McGraw Hill, Noida, 2006.
- A. S. Tanenbaum, “Distributed Operating Systems,” Prentice Hall, Upper Saddle River, 1995.
- K. Hwang, “Advanced Computer Architecture,” McGraw-Hill Series in Computer Engineering Inc. Publishing, New York, 1993.
- M. Milenkovic, “Operating Systems: Concepts and Design,” Tata Mcgraw-Hill, Noida, 1997.
- L. Lamport, “Time, Clocks and Ordering of Events in a Distributed System,” Communications of ACM, Vol. 21, No. 7, 1978, pp. 558-565. doi:10.1145/359545.359563
- G. Ricart and A. Agrawala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Communications of the ACM, Vol. 24, No. 1, 1981, pp. 9-17. doi:10.1145/358527.358537
- M. Maekawa, “A sqrt(n) Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Transactions on Computer Systems, Vol. 3, No. 2, 1985, pp. 145-159. doi:10.1145/214438.214445
- H. L. Zhang, H. C. Leung and G. K. Raikundalia, “Performance Analysis of Network Topologies in Agent Based Open Connectivity Architecture for DSS,” Google Search Engine, 2012.
- Y. Cheng and W. Zhuang “Resource Allocation for Fast Handoff in Wireless Mobile Internet,” IEEE Communications Magazine, Vol. 40, No. 5, 2002, pp. 130-131. doi:10.1109/35.1000224
- T. W. Chen and M. Gerla, “Global State Routing: A New Routing Scheme for Adhoc Wireless Networks,” IEEE International Conference on Communications, Atlanta, 7-11 June 1998, pp. 171-175.
- D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Adhoc Wireless Networks,” Journal of Mobile Computing, Vol. 353, No. 6, 1996, pp. 153-181. doi:10.1007/978-0-585-29603-6_5
- D. B. Johnson, D. Maltz and Y. Hu, “The Dynamic Source Routing Protocol(DSR) for Mobile Adhoc Networks for IPv4,” IETF RFC 4728, 1996.
- S. R. Das, C. E Parkins and E. M Royer, “Performance Comparison of Two on Demand Routing Protocols for Adhoc Networks,” Proceedings of IEEE International Workshop on Distributed Computing Systems, Mesa, 16-19 April 2001, pp. 425-432.
- D. Yu and H. Li, “A Model for Performance Analysis of Mobile Adhoc Networks,” Mobile Network and Applications, Vol. 6, No. 3, 2001.