The week's pick
Random Articles
Reseach Article
Realization of Resource Allocation using Centralized Approach by Means of Directed Graph
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 115 - Number 4 |
| Year of Publication: 2015 |
| Authors: Sridevi S Taradi |
10.5120/20143-2272
|
Sridevi S Taradi . Realization of Resource Allocation using Centralized Approach by Means of Directed Graph. International Journal of Computer Applications. 115, 4 ( April 2015), 39-42. DOI=10.5120/20143-2272
Abstract
The mechanism of resource allocation plays a vital role in maximizing the network utilization and serving the requesting nodes. This idea can be effectively demonstrated using the concept of network virtualization. Through Network virtualization an environment conducive to perform tests using similar network conditions , applications and dependencies can be created to ease and enhance implementation of network elements in a topology. One important challenge on network virtualization is the efficient use of the physical resources. To accomplish such efficient use the management of the physical resources should be transparent to the applications running within the virtual networks. In this paper we use directed graph to simulate the network and to reallocate virtual network resources along different physical nodes in order to understand the dynamics of resource allocation. The system generates analytical results through graph plotting and statistical analysis of network parameters.
References
- Alex A. Aravind, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 22, NO. 6, JUNE 2011
- J. H. Anderson, Y. -J. Kim, and T. Herman, "Shared-Memory Mutual Exclusion: Major Research Trends Since 1986," DistributedComputing, vol. 16, pp. 75-110, 2003.
- Aravind and W. Hesselink, "A Queue Based Mutual Exclusion Algorithm," Acta Informatica, vol. 46, pp. 73-86, 2009.
- D. Fooladivanda and C. Rosenberg, "Joint resource allocation and user association for heterogeneous wireless cellular networks," Wireless Communications, IEEE Transactions on, vol. 12, no. 1, pp. 248–2257, 2013.
- S. Adabi, A. Movaghar, A. M. Rahmani, H. Beigy, Market-based grid resource allocation using new negotiation model, Journal of Network and Computer Applications, (2012).
- S. Wang, F. Huang, M. Yuan, and S. Du, "Resource allocation for multiuser cognitive OFDM networks with proportional rate constraints," International Journal of Communication Systems, vol. 25, no. 2, pp. 254–269, 2012.
- H. Attiya, R. Guerraoui, D. Hendler, and P. Kouznetsov, "Synchronizing without Locks Is Inherently Expensive," Proc. 25th ACM Symp. Principles of Distributed Computing (PODC '06),pp. 300-307, 2006.
- M. Ben-Ari, Principles of Concurrent and Distributed Programming. Addison-Wesley, 2006.
- http://www. omnetpp. com
- http://canu. informatik. uni-stuttgart. de/mobisim.
- J. Yeo, D. Kotz, and T. Henderson, CRAWDAD: a community resource for archiving wireless data at Dartmouth," SIGCOMM Comput. Commun. Rev. ,vol. 36, no. 2, pp. 21{22, 2006.
- Varga, The OMNeT++ Discrete Event Simulation System," in Proc. of European Simulation Multiconference (ESM2001), June 2001.
- http://www. idosi. org/wasj/wasj23(8)13/8. pdf
- http://home. ubalt. edu/ntsbarsh/simulation/sim. htm#rintroduction W. , S. Sroka, V. Handziski , A. K opke, and H. Karl, A Mobility Framework for OMNeT++," in Proc. of 3rd International OMNeT++ Workshop, Jan. 2003.
- K. Czajkowski, I. Foster, C. Kesselman, Agreement-based resource management, Proc. IEEE, Mar. 2005, 93 (3) (2005) 631-643
Index Terms
Keywords