455 research outputs found
Recommended from our members
Survey of traffic control schemes and error control schemes for ATM networks
Among the techniques proposed for B-ISDN transfer mode, ATM concept is considered to be the most promising transfer technique because of its flexibility and efficiency. This paper surveys and reviews a number of topics related to ATM networks. Those topics cover congestion control, provision of multiple classes of traffic, and error control. Due to the nature of ATM networks, those issues are far more challenging than in conventional networks. Sorne of the more promising solutions to those issues are surveyed, and the corresponding results on performance are summarized. Future research problems in ATM protocol aspect are also presented
Investigation of delay jitter of heterogeneous traffic in broadband networks
Scope and Methodology of Study: A critical challenge for both wired and wireless networking vendors and carrier companies is to be able to accurately estimate the quality of service (QoS) that will be provided based on the network architecture, router/switch topology, and protocol applied. As a result, this thesis focuses on the theoretical analysis of QoS parameters in term of inter-arrival jitter in differentiated services networks by deploying analytic/mathematical modeling technique and queueing theory, where the analytic model is expressed in terms of a set of equations that can be solved to yield the desired delay jitter parameter. In wireless networks with homogeneous traffic, the effects on the delay jitter in reference to the priority control scheme of the ARQ traffic for the two cases of: 1) the ARQ traffic has a priority over the original transmission traffic; and 2) the ARQ traffic has no priority over the original transmission traffic are evaluated. In wired broadband networks with heterogeneous traffic, the jitter analysis is conducted and the algorithm to control its effect is also developed.Findings and Conclusions: First, the results show that high priority packets always maintain the minimum inter-arrival jitter, which will not be affected even in heavy load situation. Second, the Gaussian traffic modeling is applied using the MVA approach to conduct the queue length analysis, and then the jitter analysis in heterogeneous broadband networks is investigated. While for wireless networks with homogeneous traffic, binomial distribution is used to conduct the queue length analysis, which is sufficient and relatively easy compared to heterogeneous traffic. Third, develop a service discipline called the tagged stream adaptive distortion-reducing peak output-rate enforcing to control and avoid the delay jitter increases without bound in heterogeneous broadband networks. Finally, through the analysis provided, the differential services, was proved not only viable, but also effective to control delay jitter. The analytic models that serve as guidelines to assist network system designers in controlling the QoS requested by customer in term of delay jitter
Some aspects of traffic control and performance evaluation of ATM networks
The emerging high-speed Asynchronous Transfer Mode (ATM) networks are expected to integrate through statistical multiplexing large numbers of traffic sources having a broad range of statistical characteristics and different Quality of Service (QOS) requirements. To achieve high utilisation of network resources while maintaining the QOS, efficient traffic management strategies have to be developed. This thesis considers the problem of traffic control for ATM networks. The thesis studies the application of neural networks to various ATM traffic control issues such as feedback congestion control, traffic characterization, bandwidth estimation, and Call Admission Control (CAC). A novel adaptive congestion control approach based on a neural network that uses reinforcement learning is developed. It is shown that the neural controller is very effective in providing general QOS control. A Finite Impulse Response (FIR) neural network is proposed to adaptively predict the traffic arrival process by learning the relationship between the past and future traffic variations. On the basis of this prediction, a feedback flow control scheme at input access nodes of the network is presented. Simulation results demonstrate significant performance improvement over conventional control mechanisms. In addition, an accurate yet computationally efficient approach to effective bandwidth estimation for multiplexed connections is investigated. In this method, a feed forward neural network is employed to model the nonlinear relationship between the effective bandwidth and the traffic situations and a QOS measure. Applications of this approach to admission control, bandwidth allocation and dynamic routing are also discussed. A detailed investigation has indicated that CAC schemes based on effective bandwidth approximation can be very conservative and prevent optimal use of network resources. A modified effective bandwidth CAC approach is therefore proposed to overcome the drawback of conventional methods. Considering statistical multiplexing between traffic sources, we directly calculate the effective bandwidth of the aggregate traffic which is modelled by a two-state Markov modulated Poisson process via matching four important statistics. We use the theory of large deviations to provide a unified description of effective bandwidths for various traffic sources and the associated ATM multiplexer queueing performance approximations, illustrating their strengths and limitations. In addition, a more accurate estimation method for ATM QOS parameters based on the Bahadur-Rao theorem is proposed, which is a refinement of the original effective bandwidth approximation and can lead to higher link utilisation
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
Integration Protocols for Voice and Data Traffic
Increasing demands for multimedia services offer integration of multimedia
traffic as a hot issue in the future research areas. As a result, in the literature, many
multiplexing schemes have been proposed. However, most of them have been
implemented with a high complexity, others may be non-effective to satisfy the
multiplexing performance criteria, while the rest are still not subjected to a wide
range of analysis. Therefore, there is a critical need for comparing some of the
recommended multiplexing schemes as well as developing a simple and effective
integration protocol while still achieving reasonable bandwidth utilization.
This thesis is intended to examine integration protocols for multimedia traffic,
with primary focusing on voice-data integration. Firstly, a survey of the existing
multiplexing schemes and related issues are presented. Next, an Adaptive Round
Robin (ARR) protocol is proposed, as an alternative for voice-data integration, and
extensively simulated. Finally, further comparisons, based on computer simulations,
are carried out for various multiplexing schemes including Strictly Priority Servicing
(SPS), Fixed Round Robin (FRR), Dynamic Bandwidth Allocation/(T1, T2) and
Queue Length Threshold (QLT).As a contribution of the thesis, the proposed protocol tries to avoid the
drawbacks of the previous multiplexing schemes besides satisfying the multiplexing
performance criteria. The protocol differs from the others in that, it gives a limited
priority for voice over data, it organizes the incoming packets to the single First-in
First-out (FIFO) output buffer rather than the only outgoing scheduling, i.e., all data
sources are polled in order according to the adaptation policy; however, before a data
source can send a packet, all active voice sources are polled in order. Thus it
provides an improvement in voice delay performance without significant effect on
data delay performance over previous protocols. In addition, simulation comparisons
between various multiplexing schemes have been discussed. In these simulations
voice packets are assumed to be generated from on-off sources (talkspurt-silence
calls), which is closer to reality and which is not considered in most of the
performance analyses of previous schemes
An Adaptive Scheme for Admission Control in ATM Networks
This paper presents a real time front-end admission control scheme for ATM networks. A call management scheme which uses the burstiness associated with traffic sources in a heterogeneous ATM environment to effect dynamic assignment of bandwidth is presented. In the proposed scheme, call acceptance is based on an on-line evaluation of the upper bound on cell loss probability which is derived from the estimated distribution of the number of calls arriving. Using this scheme, the negotiated quality of service will be assured when there is no estimation error. The control mechanism is effective when the number of calls is large, and tolerates loose bandwidth enforcement and loose policing control. The proposed approach is very effective in the connection oriented transport of ATM networks where the decision to admit new traffic is based on thea priori knowledge of the state of the route taken by the traffic
Performance analysis of an asynchronous transfer mode multiplexer with Markov modulated inputs
Ankara : Department of Electrical and Electronics Engineering and the Institute of Engineering and Science of Bilkent University, 1993.Thesis (Ph.D.) -- Bilkent Iniversity, 1993.Includes bibliographical references leaves 108-113.Asynchronous Transfer Mode (ATM) networks have inputs which consist of superpositions of
correlated cell streams. Markov modulated processes are commonly used to characterize this
correlation. The first step through gaining an analytical insight in the performance issues of an
ATM network is the analysis of a single channel. One objective of this study is the performance
analysis of an ATM multiplexer whose input is a Markov modulated periodic arrival process.
Based on the transient behavior of the nD/D/1 queue, we present an approximate method
to compute the queue length distribution accurately. The method reduces to the solution of
a linear differential equation with variable coefficients. Another general traffic model is the
Markov Modulated Poisson Process (MMPP). We employ Pade approximations in transform
domain for the deterministic service time distribution in an M MPP/D/1 queue so as to compute
the distribution of the buffer occupancy. For both models, we also provide algorithms for
analysis in the case of finite queue capacities and for computation of effective bandwidth.Akar, NailPh.D
- …