Abstract: In this paper, we study statistical multiplexing of VBR
video in ATM networks. ATM promises to provide high speed realtime
multi-point to central video transmission for telemedicine
applications in rural hospitals and in emergency medical services.
Video coders are known to produce variable bit rate (VBR) signals
and the effects of aggregating these VBR signals need to be
determined in order to design a telemedicine network infrastructure
capable of carrying these signals. We first model the VBR video
signal and simulate it using a generic continuous-data autoregressive
(AR) scheme. We carry out the queueing analysis by the Fluid
Approximation Model (FAM) and the Markov Modulated Poisson
Process (MMPP). The study has shown a trade off: multiplexing
VBR signals reduces burstiness and improves resource utilization,
however, the buffer size needs to be increased with an associated
economic cost. We also show that the MMPP model and the Fluid
Approximation model fit best, respectively, the cell region and the
burst region. Therefore, a hybrid MMPP and FAM completely
characterizes the overall performance of the ATM statistical
multiplexer. The ramifications of this technology are clear: speed,
reliability (lower loss rate and jitter), and increased capacity in video
transmission for telemedicine. With migration to full IP-based
networks still a long way to achieving both high speed and high
quality of service, the proposed ATM architecture will remain of
significant use for telemedicine.
Abstract: For future Broad band ISDN, Asynchronous Transfer
Mode (ATM) is designed not only to support a wide range of traffic
classes with diverse flow characteristics, but also to guarantee the
different quality of service QOS requirements. The QOS may be
measured in terms of cell loss probability and maximum cell delay.
In this paper, ATM networks in which the virtual path (VP)
concept is implemented are considered. By applying the Markov
Deterministic process method, an efficient algorithm to compute the
minimum capacity required to satisfy the QOS requirements when
multiple classes of on-off are multiplexed on to a single VP. Using
the result, we then proposed a simple algorithm to determine different
combinations of VP to achieve the optimum of the total capacity
required for satisfying the individual QOS requirements (loss- delay).
Abstract: Unlike the best effort service provided by the internet
today, next-generation wireless networks will support real-time
applications. This paper proposes an adaptive early packet discard
(AEPD) policy to improve the performance of the real time TCP
traffic over ATM networks and avoid the fragmentation problem.
Three main aspects are incorporated in the proposed policy. First,
providing quality-of-service (QoS) guaranteed for real-time
applications by implementing a priority scheduling. Second,
resolving the partially corrupted packets problem by differentiating
the buffered cells of one packet from another. Third, adapting a
threshold dynamically using Fuzzy logic based on the traffic
behavior to maintain a high throughput under a variety of load
conditions. The simulation is run for two priority classes of the input
traffic: real time and non-real time classes. Simulation results show
that the proposed AEPD policy improves throughput and fairness
over that using static threshold under the same traffic conditions.
Abstract: Asynchronous Transfer Mode (ATM) is widely used
in telecommunications systems to send data, video and voice at a
very high speed. In ATM network optimizing the bandwidth through
dynamic routing is an important consideration. Previous research
work shows that traditional optimization heuristics result in suboptimal
solution. In this paper we have explored non-traditional
optimization technique. We propose comparison of two such
algorithms - Genetic Algorithm (GA) and Tabu search (TS), based on
non-traditional Optimization approach, for solving the dynamic
routing problem in ATM networks which in return will optimize the
bandwidth. The optimized bandwidth could mean that some
attractive business applications would become feasible such as high
speed LAN interconnection, teleconferencing etc. We have also
performed a comparative study of the selection mechanisms in GA
and listed the best selection mechanism and a new initialization
technique which improves the efficiency of the GA.
Abstract: This paper reports the feasibility of the ARMA model
to describe a bursty video source transmitting over a AAL5 ATM link
(VBR traffic). The traffic represents the activity of the action movie
"Lethal Weapon 3" transmitted over the ATM network using the Fore
System AVA-200 ATM video codec with a peak rate of 100 Mbps
and a frame rate of 25. The model parameters were estimated for a
single video source and independently multiplexed video sources. It
was found that the model ARMA (2, 4) is well-suited for the real data
in terms of average rate traffic profile, probability density function,
autocorrelation function, burstiness measure, and the pole-zero
distribution of the filter model.
Abstract: To support mobility in ATM networks, a number of
technical challenges need to be resolved. The impact of handoff
schemes in terms of service disruption, handoff latency, cost
implications and excess resources required during handoffs needs to
be addressed. In this paper, a one phase handoff and route
optimization solution using reserved PVCs between adjacent ATM
switches to reroute connections during inter-switch handoff is
studied. In the second phase, a distributed optimization process is
initiated to optimally reroute handoff connections. The main
objective is to find the optimal operating point at which to perform
optimization subject to cost constraint with the purpose of reducing
blocking probability of inter-switch handoff calls for delay tolerant
traffic. We examine the relation between the required bandwidth
resources and optimization rate. Also we calculate and study the
handoff blocking probability due to lack of bandwidth for resources
reserved to facilitate the rapid rerouting.
Abstract: To support user mobility for a wireless network new mechanisms are needed and are fundamental, such as paging, location updating, routing, and handover. Also an important key feature is mobile QoS offered by the WATM. Several ATM network protocols should be updated to implement mobility management and to maintain the already ATM QoS over wireless ATM networks. A survey of the various schemes and types of handover is provided. Handover procedure allows guarantee the terminal connection reestablishment when it moves between areas covered by different base stations. It is useful to satisfy user radio link transfer without interrupting a connection. However, failure to offer efficient solutions will result in handover important packet loss, severe delays and degradation of QoS offered to the applications. This paper reviews the requirements, characteristics and open issues of wireless ATM, particularly with regard to handover. It introduces key aspects of WATM and mobility extensions, which are added in the fixed ATM network. We propose a flexible approach for handover management that will minimize the QoS deterioration. Functional entities of this flexible approach are discussed in order to achieve minimum impact on the connection quality when a MT crosses the BS.
Abstract: Available Bit Rate Service (ABR) is the lower priority
service and the better service for the transmission of data. On wireline
ATM networks ABR source is always getting the feedback from
switches about increase or decrease of bandwidth according to the
changing network conditions and minimum bandwidth is guaranteed.
In wireless networks guaranteeing the minimum bandwidth is really a
challenging task as the source is always in mobile and traveling from
one cell to another cell. Re establishment of virtual circuits from start
to end every time causes the delay in transmission. In our proposed
solution we proposed the mechanism to provide more available
bandwidth to the ABR source by re-usage of part of old Virtual
Channels and establishing the new ones. We want the ABR source to
transmit the data continuously (non-stop) inorderto avoid the delay.
In worst case scenario at least minimum bandwidth is to be allocated.
In order to keep the data flow continuously, priority is given to the
handoff ABR call against new ABR call.
Abstract: In this paper, genetic algorithm (GA) is proposed for
the design of an optimization algorithm to achieve the bandwidth
allocation of ATM network. In Broadband ISDN, the ATM is a highbandwidth;
fast packet switching and multiplexing technique. Using
ATM it can be flexibly reconfigure the network and reassign the
bandwidth to meet the requirements of all types of services. By
dynamically routing the traffic and adjusting the bandwidth
assignment, the average packet delay of the whole network can be
reduced to a minimum. M/M/1 model can be used to analyze the
performance.