Communications

Volume 3, Issue 2, March 2015

  • Assessment of Service Level Agreements and QoS Functions for Web and Video Traffic Using OPNET Simulator

    Binyam Shiferaw Heyi

    Issue: Volume 3, Issue 2, March 2015
    Pages: 24-34
    Received: Jul. 08, 2015
    Accepted: Jul. 20, 2015
    Published: Jul. 25, 2015
    Downloads:
    Views:
    Abstract: Basically Internet it’s a connection of small and large networks. From the beginning Internet used only for transferring some information between two computers but nowadays Internet are huge commercial communication network. As usual Internet used for communication between applications. The first Internet applications weren’t so sensitive for packe... Show More
  • A Technique for Improving Telecommunications Planning Based on Indices of Growth

    Thomas Kokumo Yesufu, Anthony Olutope Fakeye

    Issue: Volume 3, Issue 2, March 2015
    Pages: 35-41
    Received: Jul. 10, 2015
    Accepted: Jul. 18, 2015
    Published: Jul. 25, 2015
    Downloads:
    Views:
    Abstract: Subscribers’ indices of growth are essential for planning and ensuring the rapid pursuit of best practices by telecommunication systems in Nigeria. Based on network principles and the established process of telecommunications planning, a questionnaire was developed and administered to 300 stakeholders that were randomly selected from existing subsc... Show More
  • The Proof of Quantum Search Algorithm Optimization and the Simulation of the Algorithm Implementation

    Hong-Tao Zhang, Yong-Tao Dai, Ling-Ying Tu, Jun Shu, Hong-Mei Xiong, Yi-Fan Hu

    Issue: Volume 3, Issue 2, March 2015
    Pages: 42-48
    Received: Jul. 10, 2015
    Accepted: Jul. 18, 2015
    Published: Jul. 28, 2015
    Downloads:
    Views:
    Abstract: This paper illustrated the optimality of Grover quantum search algorithm, and simulated the number of iterations and the specific implementation steps of quantum search algorithm with QCL in Linux operating systems, then validated the time complexity of Grover's quantum searching algorithm is O(√(N)) while the algorithm's time complexity on classic... Show More