Advances in Computer Science and Information Technology. Networks and Communications. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part I

Research Article

Improve Service Discovery Performance over Different Networks Utilization and Sizes

Download
193 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-27299-8_20,
        author={Intisar Al-Mejibli and Martin Colley and Salah Al-Majeed},
        title={Improve Service Discovery Performance over Different Networks Utilization and Sizes},
        proceedings={Advances in Computer Science and Information Technology. Networks and Communications. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part I},
        proceedings_a={CCSIT PART I},
        year={2012},
        month={11},
        keywords={Dropped messages Service discovery protocols Network Utilization},
        doi={10.1007/978-3-642-27299-8_20}
    }
    
  • Intisar Al-Mejibli
    Martin Colley
    Salah Al-Majeed
    Year: 2012
    Improve Service Discovery Performance over Different Networks Utilization and Sizes
    CCSIT PART I
    Springer
    DOI: 10.1007/978-3-642-27299-8_20
Intisar Al-Mejibli1,*, Martin Colley1,*, Salah Al-Majeed1,*
  • 1: University of Essex
*Contact email: ialmej@essex.ac.uk, martin@essex.ac.uk, ssaleha@essex.ac.uk

Abstract

Service discovery requests’ messages have a vital role in sharing and locating resources in many of service discovery protocols. Sending more messages than a link can handle may cause congestion and loss of messages which dramatically influences the performance of these protocols. Re-send the lost messages result in latency and inefficiency in performing the tasks which user(s) require from the connected nodes. This paper propose an algorithm to improve the services discovery protocols performance by separating each consecutive burst of messages with a specific period of time which calculated regarding the available network resources. In addition, this paper explains the impact of increasing the number of clients and the consumed network resources on the proposed algorithm.