234 research outputs found
Recommended from our members
Performance analysis of an ATM network with multimedia traffic: a simulation study
Traffic and congestion control are important in enabling ATM networks to maintain the Quality of Service (QoS) required by end users. A Call Admission Control (CAC) strategy ensures that the network has sufficient resources available at the start of each call, but this does not prevent a traffic source from violating the negotiated contract. A policing strategy (User Parameter Control (UPC)) is also required to enforce the negotiated rates for a particular connection and to protect conforming users from network overload.
The aim of this work is to investigate traffic policing and bandwidth management at the User to Network Interface (UNI). A policing function is proposed which is based on the leaky bucket (LB) which offers improved performance for both real time (RT) traffic such as speech and video and non-real time (non-RT) traffic, mainly data by taking into account the QoS requirements. A video cell in violation of the negotiated bit rate causes the remainder of the slice to be discarded. This 'tail clipping' provides protection for the decoder from damaged video slices. Speech cells are coded using a frequency domain coder, which places the most significant bits of a double speech sample into a high priority cell and the least significant bits into a high priority cell. In the case of congestion, the low priority cell can be discarded with little impact on the intelligibility of the received speech. However, data cells require loss-free delivery and are buffered rather than being discarded or tagged for subsequent deletion. This triple strategy is termed the super leaky bucket (SLB).
Separate queues for RT and non-RT traffic, are also proposed at the multiplexer, with non pre-emptive priority service for RT traffic if the queue exceeds a predetermined threshold. If the RT queue continues to grow beyond a second threshold, then all low priority cells (mainly speech) are discarded. This scheme protects non-RT traffic from being tagged and subsequently discarded, by queueing the cells and also by throttling back non-RT sources during periods of congestion. It also prevents the RT cells from being delayed excessively in the multiplexer queue.
A simulation model has been designed and implemented to test the proposal. Realistic sources have been incorporated into the model to simulate the types of traffic which could be expected on an ATM network.
The results show that the S-LB outperforms the standard LB for video cells. The number of cells discarded and the resulting number of damaged video slices are significantly reduced. Dual queues with cyclic service at the multiplexer also reduce the delays experienced by RT cells. The QoS for all categories of traffic is preserved
On the time scales in video traffic characterization for queueing behavior
To guarantee quality of service (QoS) in future integrated service networks, traffic sources must be characterized to capture the traffic characteristics relevant to network performance. Recent studies reveal that multimedia traffic shows burstiness over multiple time scales and long range dependence (LRD). While researchers agree on the importance of traffic correlation there is no agreement on how much correlation should be incorporated into a traffic model for performance estimation and dimensioning of networks. In this article, we present an approach for defining a relevant time scale for the characterization of VER video traffic in the sense of queueing delay. We first consider the Reich formula and characterize traffic by the Piecewise Linear Arrival Envelope Function (PLAEF). We then define the cutoff interval above which the correlation does not affect the queue buildup. The cutoff interval is the upper bound of the time scale which is required for the estimation of queue size and thus the characterization of VER video traffic. We also give a procedure to approximate the empirical PLAEF with a concave function; this significantly simplifies the calculation in the estimation of the cutoff interval and delay bound with little estimation loss. We quantify the relationship between the time scale in the correlation of video traffic and the queue buildup using a set of experiments with traces of MPEG/JPEG-compressed video. We show that the critical interval i.e. the range for the correlation relevant to the queueing delay, depends on the traffic load: as the traffic load increases, the range of the time scale required for estimation for queueing delay also increases. These results offer further insights into the implication of LRD in VER video traffic. (C) 1999 Elsevier Science B.V. Ail rights reserved
A new charging scheme for ATM based on QoS
PhDNew services are emerging rapidly within the world of telecommunications. Charging
strategies that were appropriate for individual transfer capabilities are no longer appropriate
for an integrated broadband communications network. There is currently a range of
technologies (such as cable television, telephony and narrow band ISDN) for the different
services in use and a limited number of charging schemes are applicable for each of the
underlying technologies irrespective of the services used over it. Difficulties arise when a
wide range of services has to be supported on the same integrated technology such as
asynchronous transfer mode (ATM); in such cases the type of service in use and the impact
it has on the network becomes much more important. The subject of this thesis, therefore,
is the charging strategies for integrated broadband communications networks. That is, the
identification of the requirements associated with ATM charging schemes and the proposal
of a new approach to charging for ATM called the “quality of service based charging
scheme”.
Charging for ATM is influenced by three important components: the type and content of a
service being offered; the type of customer using the services; and the traffic characteristics
belonging to the application supporting the services. The first two issues will largely be
dependent on the business and regulatory requirements of the operators. The last item, and
an essential one for ATM, is the bridge between technology and business; how are the
resources used by a service quantified? Charging that is based on resource usage at the
network level was the prime focus of the research reported here.
With the proposed charging scheme, a distinction is first made between the four different
ATM transfer capabilities that will support various services and the different quality of
service requirements that may be applicable to each of them. Then, resources are
distributed among buffers set-up to support the combination of these transfer capabilities
and quality of services. The buffers are dimensioned according to the M/D/1/K and the
ND/D/1 queuing analysis to determine the buffer efficiency and quality of service
requirements. This dimensioning provides the basis for fixing the price per unit of resource
and time. The actual resource used by a connection is based on the volume of cells
transmitted or peak cell rate allocation in combination with traffic shapers if appropriate.
Shapers are also dimensioned using the quality of service parameters. Since the buffer
4
efficiency is dependent on the quality of service requirements, users (customers) of ATM
networks buy quality of service. The actual price of a connection is further subjected to a
number of transformations based on the size of the resource purchased, the time of the day
at which a connection is made, and the geographical locality of the destination switch.
It is demonstrated that the proposed charging scheme meets all the requirements of
customers and of network operators. In addition the result of the comparison of the new
scheme with a number of existing, prominent, ATM charging schemes is presented,
showing that the performance of the proposed scheme is better in terms of meeting the
expectations of both the customers and the network operators
Quality of Service Controlled Multimedia Transport Protocol
PhDThis research looks at the design of an open transport protocol that supports a range of
services including multimedia over low data-rate networks. Low data-rate multimedia
applications require a system that provides quality of service (QoS) assurance and flexibility.
One promising field is the area of content-based coding. Content-based systems use an array
of protocols to select the optimum set of coding algorithms. A content-based transport
protocol integrates a content-based application to a transmission network.
General transport protocols form a bottleneck in low data-rate multimedia
communicationbsy limiting throughpuot r by not maintainingt iming requirementsT. his work
presents an original model of a transport protocol that eliminates the bottleneck by
introducing a flexible yet efficient algorithm that uses an open approach to flexibility and
holistic architectureto promoteQ oS.T he flexibility andt ransparenccyo mesi n the form of a
fixed syntaxt hat providesa seto f transportp rotocols emanticsT. he mediaQ oSi s maintained
by defining a generic descriptor. Overall, the structure of the protocol is based on a single
adaptablea lgorithm that supportsa pplication independencen, etwork independencea nd
quality of service.
The transportp rotocol was evaluatedth rougha set of assessmentos:f f-line; off-line
for a specific application; and on-line for a specific application. Application contexts used
MPEG-4 test material where the on-line assessmenuts eda modified MPEG-4 pl; yer. The
performanceo f the QoSc ontrolledt ransportp rotocoli s often bettert hano thers chemews hen
appropriateQ oS controlledm anagemenatl gorithmsa re selectedT. his is shownf irst for an
off-line assessmenwt here the performancei s compared between the QoS controlled
multiplexer,a n emulatedM PEG-4F lexMux multiplexers chemea, ndt he targetr equirements.
The performanceis also shownt o be better in a real environmentw hen the QoS controlled
multiplexeri s comparedw ith the real MPEG-4F lexMux scheme
Video traffic modeling and delivery
Video is becoming a major component of the network traffic, and thus there has been a great interest to model video traffic. It is known that video traffic possesses short range dependence (SRD) and long range dependence (LRD) properties, which can drastically affect network performance. By decomposing a video sequence into three parts, according to its motion activity, Markov-modulated self-similar process model is first proposed to capture autocorrelation function (ACF) characteristics of MPEG video traffic. Furthermore, generalized Beta distribution is proposed to model the probability density functions (PDFs) of MPEG video traffic.
It is observed that the ACF of MPEG video traffic fluctuates around three envelopes, reflecting the fact that different coding methods reduce the data dependency by different amount. This observation has led to a more accurate model, structurally modulated self-similar process model, which captures the ACF of the traffic, both SRD and LRD, by exploiting the MPEG structure. This model is subsequently simplified by simply modulating three self-similar processes, resulting in a much simpler model having the same accuracy as the structurally modulated self-similar process model.
To justify the validity of the proposed models for video transmission, the cell loss ratios (CLRs) of a server with a limited buffer size driven by the empirical trace are compared to those driven by the proposed models. The differences are within one order, which are hardly achievable by other models, even for the case of JPEG video traffic.
In the second part of this dissertation, two dynamic bandwidth allocation algorithms are proposed for pre-recorded and real-time video delivery, respectively. One is based on scene change identification, and the other is based on frame differences. The proposed algorithms can increase the bandwidth utilization by a factor of two to five, as compared to the constant bit rate (CBR) service using peak rate assignment
DSL-based triple-play services
This research examines the triple play service based on the ADSL technology. The voice over IP will be checked and combined with the internet data by two monitoring programs in order to examine the performance that this service offers and then will be compared with the usual method of internet connection.This research examines the triple play service based on the ADSL technology. The voice over IP will be checked and combined with the internet data by two monitoring programs in order to examine the performance that this service offers and then will be compared with the usual method of internet connection.
Dynamic bandwidth allocation in ATM networks
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
Application of learning algorithms to traffic management in integrated services networks.
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN027131 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
- …