• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Decoupling delay and bandwidth in stateless core networks

    Thumbnail
    View/Open
    200411026.pdf (981.1Kb)
    Date
    2006
    Author
    Shah, Parag
    Metadata
    Show full item record
    Abstract
    The use of network applications like VoIP, video conferencing and online stock marketing has greatly increased over the past few years. These applications require performance bounds on bandwidth, delay and delay variations otherwise they become useless. The solutions proposed by IETF, an authorized Internet body, for providing performance guarantees are not in favor of Internet’s scalability and robustness. In an attempt to provide guaranteed services Dr. I. Stoica had proposed the Stateless Core (SCORE) architecture as a part of his doctoral work at CMU. The SCORE can support all functionalities of the current Internet. Moreover, it can support guaranteed services proposed by IETF without affecting current Internet’s scalability and robustness. Core Jitter Virtual Clock (CJVC) is the scheduling discipline that provides absolute service guarantee in SCORE domain. The delay bound provided by CJVC depends on the reserved rate of the flow. The coupling of delay and bandwidth is considered to be a drawback of CJVC as the flows requiring low delay bound need to reserve large bandwidth. The well-known stateful guaranteed service disciplines like Weighted Fair Queueing (WFQ) and Delay Earliest Due-Date (D-EDD) also have the same problem. Several solutions like Service Curve based Earliest Deadline (SCED) and Rate Controlled Static Priority (RCSP) have been proposed for the mentioned coupling problem but they are limited to stateful networks. In this thesis, we propose a new scheduling discipline for the same problem but in stateless core network. The proposal is to emulate RCSP scheduling discipline algorithm in SCORE domain. Basic admission control algorithm has also been proposed in the course of emulating the behaviour of RCSP in SCORE architecture.
    URI
    http://drsr.daiict.ac.in/handle/123456789/124
    Collections
    • M Tech Dissertations [820]

    Related items

    Showing items related by title, author, creator and subject.

    • Queueing-theoretic framework for perfermance analysis of mobile ad hoc networks with finite buffer nodes 

      Shah, Sapan (Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
      Wireless Ad Hoc network is a decentralized wireless network which allows nodes to join and create networks without any infrastructure. These kinds of networks are advantageous because they can be readily deployed anywhere, ...
    • Wireless sensor network based automatic meter reading: WSNAMR 

      Sutariya, Mahesh R. (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Automatic Meter Reading is technology evolved from 1995[3] or before, for remote collection of utilities measurement data which involve Electricity, Gas and Water etc. In this process of evolution every time new idea was ...
    • Comparative study between exponential back off and dynamic waiting strategies for medium access in wireless ad hoc networks 

      Shah, Rahul (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      IEEE 802.11 DCF (IEEE 802.11 Distributed Coordination Function) is widely used MAC protocol for wireless channel access. Although it is developed for single hop networks where all nodes are in the same radio range, it can ...

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV