• DocumentCode
    3170849
  • Title

    A Time-Sensitive Path Selection Algorithm for Connectionless Network

  • Author

    Newton, P.C. ; Arockiam, L. ; Kim, Tai-Hoon

  • Author_Institution
    Comput. Sci., Bishop Heber Coll., Tiruchirappalli
  • fYear
    2008
  • fDate
    13-15 Oct. 2008
  • Firstpage
    79
  • Lastpage
    82
  • Abstract
    The performance of a computer network is mostly affected by heavy traffic. The upcoming networks are more sensitive to time. Especially in multimedia networks, time is an important factor. So, efficient mechanisms are needed to improve the performance of the network. Connectionless network uses multiple paths to send the packets and achieves higher bandwidth. But, Connection-oriented network uses the same/single path to send all the packets. In this paper, we have proposed an algorithm to send all the packets through i-paths instead of multiple paths. Here, i-paths denote intelligent paths. Our algorithm thinks differently and generates intelligent paths. As the time factor directly affects throughput, a time-sensitive path selection algorithm is need of the hour. The outcome of this paper gives better solutions to save time and to reduce congestion.
  • Keywords
    Internet; bandwidth allocation; multimedia communication; radio networks; telecommunication traffic; connection-oriented network; connectionless network; heavy traffic; i-paths; intelligent paths; multimedia networks; time-sensitive path selection algorithm; Bandwidth; Computer networks; Computer science; Educational institutions; Intelligent networks; Internet; Multimedia computing; Telecommunication traffic; Throughput; Time factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Ubiquitous Multimedia Computing, 2008. UMC '08. International Symposium on
  • Conference_Location
    Hobart, ACT
  • Print_ISBN
    978-0-7695-3427-5
  • Type

    conf

  • DOI
    10.1109/UMC.2008.24
  • Filename
    4656521