101 research outputs found

    Dynamic bandwidth allocation in ATM networks

    Get PDF
    Includes bibliographical references.This thesis investigates bandwidth allocation methodologies to transport new emerging bursty traffic types in ATM networks. However, existing ATM traffic management solutions are not readily able to handle the inevitable problem of congestion as result of the bursty traffic from the new emerging services. This research basically addresses bandwidth allocation issues for bursty traffic by proposing and exploring the concept of dynamic bandwidth allocation and comparing it to the traditional static bandwidth allocation schemes

    Delay-aware Link Scheduling and Routing in Wireless Mesh Networks

    Get PDF
    Resource allocation is a critical task in computer networks because of their capital-intensive nature. In this thesis we apply operations research tools and technologies to model, solve and analyze resource allocation problems in computer networks with real-time traffic. We first study Wireless Mesh Networks, addressing the problem of link scheduling with end-to-end delay constraints. Exploiting results obtained with the Network Calculus framework, we formulate the problem as an integer non-linear optimization problem. We show that the feasibility of a link schedule does depend on the aggregation framework. We also address the problem of jointly solving the routing and link scheduling problem optimally, taking into account end-to-end delay guarantees. We provide guidelines and heuristics. As a second contribution, we propose a time division approach in CSMA MAC protocols in the context of 802.11 WLANs. By grouping wireless clients and scheduling time slots to these groups, not only the delay of packet transmission can be decreased, but also the goodput of multiple WLANs can be largely increased. Finally, we address a resource allocation problem in wired networks for guaranteed-delay traffic engineering. We formulate and solve the problem under different latency models. Global optimization let feasible schedules to be computed with instances where local resource allocation schemes would fail. We show that this is the case even with a case-study network, and at surprisingly low average loads

    Algoritmos de gestión de tráfico: Leaky Bucket, Token Bucket y Virtual Scheduling

    Get PDF
    Este artículo presenta los tres algoritmos principales empleados para el control de congestión en redes de comunicaciones: Leaky Bucket, Token Bucket y Virtual Scheduling. Su objetivo es evitar que el tráfi co llegue a niveles inaceptables de ..

    Performance Management in ATM Networks

    Get PDF
    ATM is representative of the connection-oriented resource provisioning classof protocols. The ATM network is expected to provide end-to-end QoS guaranteesto connections in the form of bounds on delays, errors and/or losses. Performancemanagement involves measurement of QoS parameters, and application of controlmeasures (if required) to improve the QoS provided to connections, or to improvethe resource utilization at switches. QoS provisioning is very important for realtimeconnections in which losses are irrecoverable and delays cause interruptionsin service. QoS of connections on a node is a direct function of the queueing andscheduling on the switch. Most scheduling architectures provide static allocationof resources (scheduling priority, maximum buffer) at connection setup time. Endto-end bounds are obtainable for some schedulers, however these are precluded forheterogeneously composed networks. The resource allocation does not adapt to theQoS provided on connections in real time. In addition, mechanisms to measurethe QoS of a connection in real-time are scarce.In this thesis, a novel framework for performance management is proposed. Itprovides QoS guarantees to real time connections. It comprises of in-service QoSmonitoring mechanisms, a hierarchical scheduling algorithm based on dynamicpriorities that are adaptive to measurements, and methods to tune the schedulers atindividual nodes based on the end-to-end measurements. Also, a novel scheduler isintroduced for scheduling maximum delay sensitive traffic. The worst case analysisfor the leaky bucket constrained traffic arrivals is presented for this scheduler. Thisscheduler is also implemented on a switch and its practical aspects are analyzed.In order to understand the implementability of complex scheduling mechanisms,a comprehensive survey of the state-of-the-art technology used in the industry isperformed. The thesis also introduces a method of measuring the one-way delayand jitter in a connection using in-service monitoring by special cells

    Renegotiable VBR service

    Get PDF
    In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic is shaped according to the contract. We advocate VBR renegotiation as an efficient mechanism to accommodate traffic fluctuations over the burst time-scale. This is in line with the Integrated Service of the IETF with the Resource reSerVation Protocol (RSVP), where the negotiated contract may be modified periodically. In this thesis, we analyse the fundamental elements needed for solving the VBR renegotiation. A source periodically estimates the needs based on: (1) its future traffic, (2) cost objective, (3) information from the past. The issues of this estimation are twofold: future traffic prediction given a prediction, the optimal change. In the case of a CBR specification the optimisation problem is trivial. But with a VBR specification this problem is complex because of the multidimensionality of the VBR traffic descriptor and the non zero condition of the system at the times where the parameter set is changed. We, therefore, focus on the problem of finding the optimal change for sources with pre-recorded or classified traffic. The prediction of the future traffic is out of the scope of this thesis. Traditional existing models are not suitable for modelling this dynamic situation because they do not take into account the non-zero conditions at the transient moments. To address the shortfalls of the traditional approaches, a new class of shapers, the time varying leaky bucket shaper class, has been introduced and characterised by network calculus. To our knowledge, this is the first model that takes into account non-zero conditions at the transient time. This innovative result forms the basis of Renegotiable VBR Service (RVBR). The application of our RVBR mathematical model to the initial problem of supporting the applications' QoS requirements while efficiently allocating the network resources results in simple, efficient algorithms. Through simulation, we first compare RVBR service versus VBR service and versus renegotiable CBR service. We show that RVBR service provides significant advantages in terms of resource costs and resource utilisation. Then, we illustrate that when the service assumes zero conditions at the transient time, the source could potentially experience losses in the case of policing because of the mismatch between the assumed bucket and buffer level and the policed bucket and buffer level. As an example of RVBR service usage, we describe the simulation of RVBR service in a scenario where a sender transmits a MPEG2 video over a network using RSVP reservation protocol with Controlled-Load service. We also describe the implementation design of a Video on Demand application, which is the first example of an RVBR-enabled application. The simulation and experimentation results lead us to believe that RVBR service provides an adequate service (in terms of QoS guaranteed and of efficient resource allocation) to sources with pre-recorded or classified traffic

    Hybrid token-CDMA MAC protocol for wireless networks.

    Get PDF
    Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2009.Ad hoc networks are commonly known to implement IEEE 802.11 standard as their medium access control (MAC) protocol. It is well known that token passing MAC schemes outperform carrier-sense-multiple-access (CSMA) schemes, therefore, token passing MAC protocols have gained popularity in recent years. In recent years, the research extends the concept of token passing ' scheme to wireless settings since they have the potential of achieving higher channel utilization than CSMA type schemes. In this thesis, a hybrid Token-CDMA MAC protocol that is based on a token passing scheme with the incorporation of code division multiple access (CDMA) is introduced. Using a dynamic code distribution algorithm and a modified leaky-bucket policing system, the hybrid protocol is able to provide both Quality of Service (QoS) and high network resource utilization, while ensuring the stability of a network. This thesis begins with the introduction of a new MAC protocol based on a token-passing strategy. The input traffic model used in the simulation is a two-state Markov Modulated Poisson Process (MMPP). The data rate QoS is enforced by implementing a modified leaky bucket mechanism in the proposed MAC scheme. The simulation also takes into account channel link errors caused by the wireless link by implementing a multi-layered Gilbert-Elliot model. The performance of the proposed MAC scheme is examined by simulation, and compared to the performance of other MAC protocols published in the literature. Simulation results demonstrate that the proposed hybrid MAC scheme is effective in decreasing packet delay and significantly shortens the length of the queue. The thesis continues with the discussion of the analytical model for the hybrid Token CDMA protocol. The proposed MAC scheme is analytically modelled as a multiserver multiqueue (MSMQ) system with a gated service discipline. The analytical model is categorized into three sections viz. the vacation model, the input model and the buffer model. The throughput and delay performance are then computed and shown to closely match the simulation results. Lastly, cross-layer optimization between the physical (PHY) and MAC layers for the hybrid token-CDMA scheme is discussed. The proposed joint PHY -MAC approach is based on the interaction between the two layers in order to enable the stations to dynamically adjust the transmission parameters resulting in reduced mutual interference and optimum system performance

    Resource management for multimedia traffic over ATM broadband satellite networks

    Get PDF
    PhDAbstract not availabl
    • …
    corecore