Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2013
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2013
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2013
License: CC BY
Data sources: ZENODO
versions View all 2 versions
addClaim

Towards A Load Balancing Framework For An Sms–Based Service Invocation Environment

Authors: Mandla T. Nene; Edgar.Jembere; Matthew O. Adigun; Themba Shezi; Siyabonga S. Cebekhulu;

Towards A Load Balancing Framework For An Sms–Based Service Invocation Environment

Abstract

{"references": ["Risi, D. and Te\u251c\u2502filo, M. 2009. MobileDeck: turning SMS into a rich\nuser experience. In Proceedings of the 6th international Conference on\nMobile Technology, Application & Systems (Nice, France,September 02\n- 04, 2009). Mobility '09. ACM, New York, NY, pp. 1-4.\nDOI=http://doi.acm.org/10.1145/1710035.1710068", "Papazoglou M.P., Web Services: Principles and Technology,Prentice\nHall, 2007.", "Kopparapu, Chandra.\" Load balancing servers, firewalls, and caches\".\nWiley Computer Publishing John Wiley & Sons, Inc. 2002", "Tony Bourke , Server Load Balancing O'Reilly & Associates, Inc., 2001", "Ramana Kumar K,Manesh V Ghatage Jataayu,\"Load balancing of\nservicers with server initiated connections\",2005.", "Brown, J., Shipman, B., and Vetter, R. SMS: The Short Message\nService. Computer 40, 12 (Dec. 2007), 106-110. DOI=\nhttp://dx.doi.org/10.1109/MC.2007.440", "Mauricio Tia Ni Gong Lin, Thomaz Philippe Cavalcante Silva, Roberto\nOliveira dos Santos, Andr'e Ferreira da Silva Neto ,\"SMBots - An\narchitecture to manage dynamic services based on SMS \",Nokia\nInstitute of Technology,2009.", "B.A. Shirazi, A.R. Hurson and K.M. Kavi, Editors, \"Scheduling and\nLoad-Balancing in Parallel and Distributed Systems\", IEE CS Press\n.1995", "Chhabra A. Chhabra, G. Singh, Qualitative Parametric Comparison of\nLoad Balancing Algorithms in Distributed Computing\nEnvironment,14th International Conference on Advanced Computing\nand Communication, July 2006 IEEE, pp 58 - 61.\n[10] Hendra Rahmawan, Yudi Satria Gondokaryono , The Simulation of\nStatic Load Balancing Algorithms ,Electrical Engineering .2009\n[11] Cortes A. Cortes, A. Ripoll, M. Senar, and E. Luque, \"Performance\nComparison of Dynamic Load-Balancing Strategies for Distributed\nComputing,\" Proc. 32nd Hawaii Conf. System Sciences, vol. 8,p. 8041,\n1999.\n[12] Raqabani A. Al-Raqabani, H. Barada, & R. Benlamri, Performance of\nprobing and coordinated load sharing, Proc. 17th IASTED Int. Conf. on\nParallel and Distributed Computing and Systems, Phoenix, Arizona,\nUSA, 2005, 66--71.\n[13] Alex King Cheung,Hans-Arno Jacobsen,\"Dynamic Load balancing in\nDistributed Content-Based Publish/Subscribe\",IFIP,2006.\n[14] Cardellini CARDELLINI, V., CASALICCHIO, E., COLAJANNI, M.,\nAND YU, P. 2002. The state of the art in locally distributed web-server\nsystems. ACM Comput. Surv. 34, 2 (June), 263-311.\n[15] CARDELLINI, V., COLAJANNI, M., AND YU, P. 1999. Dynamic load\nbalancing on web-server systems.IEEE Internet Comput. 3, 3 (May),\n28-39.\n[16] C. Yan, M. Zhu, and Y. Shi, \"A Response Time based Load Balancing\nAlgorithm for Service Composition,\" in Pervasive Computing and\nApplications, 2008. ICPCA 2008. Third International Conference on,\n2008, vol. 1, pp. 13 -16.\n[17] Aimrudee Jongtaveesataporn ,Shingo Takada. \"Enhancing enterprise\nservice bus capability for load balancing\". Journal WSEAS Transactions\non Computers archive Volume 9 Issue 3, March 2010\n[18] J. Balasubramanian, D. C. Schmidt, L. W.Dowdy, O. Othman,\n\"Evaluating the Performance of Middleware Load Balancing\nStrategies\", Proc. of 8th Intl.. Conf. on Enterprise Distributed Object\nComputing,2004, pp. 135-146.\n[19] Karasum E. Karasam, E. Ayanoglu, Effects of wavelength routing and\nselection algorithms on wavelength conversion gain in WDM optical\nnetworks, IEEE/ACM Transactions on Networking 6 (2) (1998)\n186\u252c\u2592196\n[20] Shan G. Shen, S. K. Bose, T. H. Cheng, C. Lu, and T. K. Chai,\n\"Efficient wavelength assignments for light paths in WDM optical\nnetworks with/without wavelength conversion,\" Photon.\nNetw.Commun. 2, 349-360 (2000).\n[21] Ossama Othman, Jaiganesh Balasubramanian, and Douglas\nC.Schmidt.\" The Design of an Adaptive Middleware Load Balancing\nand Monitoring Service\". In LNCS/LNAI: Proceedings of the Third\nInternational Workshop on Self-Adaptive Software, Heidelberg, June\n2003. Springer-Verlag\n[22] Grosu D. Grosu, A. T. Chronopoulos, and M. Y. Leung, \"Load\nbalancing in distributed systems: An approach using cooperative\ngames,\" in Proc.IPDPS, 2002, pp. 52-61.\n[23] Goyal Sandip Kumar Goyal, Dr. R.B. Patel. Adaptive and Dynamic\nLoad Balancing Methodologies for Distributed Environment,\nInternational Journal of Engineering Science and Technology (IJEST),\n3(3), 1835 - 1840.2011\n[24] Qin Xiao Qin, Hong Jiang, Yifeng Zhu, and David R. Swanson,\n\"Dynamic Load Balancing for I/O-Intensive Tasks on Heterogeneous\nClusters,\" in the Proceedings of the 10th International Conference on\nHigh Performance Computing (HiPC 2003), December 17-20, 2003,\nHyderabad, India.\n[25] J. Wang, J. Chen, Y. Wang, and D. Zheng, \"Intelligent Load Balancing\nStrategies for Complex Distributed Simulation Applications,\" 2009, pp.\n182-186.\n[26] N. Arap\u00e9, J. A. Colmenares, and N. V. Queipo, \"On the Development of\nan Enhanced Least Loaded Strategy for the CORBA Load Balancing\nand Monitoring Service,\" pp. 205-211, 2003.\n[27] F. J. L. Rosas and J. C. M. Romo, \"Improving Dynamic Load\nBalancing Under CORBA with a Genetic Strategy in a Neural\nSystem of Off-line Signature Verification,\" presented at the PDPTA,\n2007, pp. 510-516.\n[28] T. Kunz, \"The influence of different workload descriptions on a\nheuristic load balancing scheme,\" Software Engineering, IEEE\nTransactions on, vol. 17, no. 7, pp. 725 -730, Jul. 1991.\n[29] G. M\u251c\u255dhl, L. Fiege, and P. Pietzuch, Distributed event-based systems.\nSpringer-Verlag, 2006.\n[30] http://support.hyperic.com/display/SIGAR/Home"]}

The drastic increase in the usage of SMS technology has led service providers to seek for a solution that enable users of mobile devices to access services through SMSs. This has resulted in the proposal of solutions towards SMS-based service invocation in service oriented environments. However, the dynamic nature of service-oriented environments coupled with sudden load peaks generated by service request, poses performance challenges to infrastructures for supporting SMS-based service invocation. To address this problem we adopt load balancing techniques. A load balancing model with adaptive load balancing and load monitoring mechanisms as its key constructs is proposed. The load balancing model then led to realization of Least Loaded Load Balancing Framework (LLLBF). Evaluation of LLLBF benchmarked with round robin (RR) scheme on the queuing approach showed LLLBF outperformed RR in terms of response time and throughput. However, LLLBF achieved better result in the cost of high processing power.

Keywords

SMS (Short Message Service), Service Oriented Computing (SOC)., LLLBF (Least Loaded Load Balancing Framework)

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 3
    download downloads 3
  • 3
    views
    3
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
3
3
Green