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

Statistical characterisation and stochastic modelling of 1-layer variable bit rate H.261 video codec traffic

The Integrated Services Digital Network(ISDN) is under re-design to provide flexibility which will ensure efficient network utilisation in the provision of broadband services. The main broadband services envisaged for provision on the Broadband ISDN(B-ISDN) are : Videophone; Videoconferencing; Television and High Definition TV. The B-ISDN will be a packet switched network where the packets(cells) will be transferred by the Asynchronous Transfer Mode(ATM) concept. Unlike voice and data services, the impact video services will have on the BISDN is unknown and hence loss of information is difficult to predict. Present videophone terminals are based on the CCITT H.261 Video Coding standard hence the picture quality is variable because video codec traffic is transmitted at a constant rate. To maintain a constant quality picture the codec output data must be transmitted at a variable rate or alternatively, for constant rate video codecs extra information must be made available to achieve constant picture quality. This latter technique is 2- Layer video coding where the first layer transmits at a constant rate and the second layer at a variable rate. The ATM B-ISDN promises constant picture quality video services, therefore to achieve this aim the impact variable rate video sources will have on the network must be determined by network simulation, thus variable rate video source models must be derived. To statistically characterise and stochastically model 1-Layer VBR(Variable Bit Rate) H.261 Video Codec traffic, here a videophone sequence is analysed by two alternative strategies : Talk-Listen and Motion Level. This analysis also found that 2-Layer H.261 Video Codec traffic can be stochastically modelled via a 1-Layer VBR H.261 Video Codec traffic model. Numerous hierarchical stochastic models with the ability to capture the statistical characteristics of long video sequences, in particular the short-term and long-term autocorrelations, are presented. One such model was simulated and the resulting simulated traffic was analysed to confirm the advantage hierarchical stochastic models have over non-hierarchical stochastic models in modelling video source traffic

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

GUIDELINES FOR THE DESIGN OF ENHANCED, COST EFFECTIVE NETWORKS IN A MANUFACTURING ENVIRONMENT

Investigations into the transmission of real-time interactive speech over local area networks (LAN) in an industriai/commerciai environment to eventually obviate the need for a private automatic branch exchange and ultimately prepare the way for a single interactive integrated information system (PS) that provides work stations, which are networked via a LAN, with a fully interactive speech and graphics facility commensurate with the future requirements in computer integrated manufacturing (CIM). The reasons for conducting this programme of research were that existing LANs do not offer a real time interactive speech facility. Any verbal communication between workstation users on the LAN has to be carried out over a telephone network (PABX). This necessitates the provision of a second completely separate network with its associated costs. Initial investigations indicate that there is sufGcient capacity on existing LANs to support both data and real-time speech provided certain data packet delay criteria can be met. Earlier research work (in the late 1980s) has been conducted at Bell Labs and MIT. [Ref 25, 27 & 28], University of Strathclyde [Ref 24] and at BTRL [Ref 22 and 37]. In all of these cases the real time implementation issues were not fijlly addressed. In this thesis the research work reported provides the main criteria for the implementation of real-time interactive speech on both existing and newly installed networks. With such enhanced communication facilities, designers and engineers on the shop floor can be projected into their suppliers, providing a much greater integration between manufacturer and supplier which will be beneficial as Concurrent and Simultaneous Engineering Methodologies are further developed. As a result, various LANs have been evaluated as to their suitability for the transmission of real time interactive speech. As LANs, in general, can be separated into those with either deterministic or stochastic access mechanisms, investigations were carried out into the ability of both the: (i) Token Passing Bus LANs supporting the Manufacturing and Automation Protocol (MAP)—Deterministic and (u) Carrier Sense Multiple Access/Collision Detection (CSMA/CD) LANs supporting the Technical Office Protocol (TOP)— Stochastic to support real time interactive speech, as both are used extensively in commerce and manufacturing. The thesis that real time interactive speech can be transmitted over LANs employed in a computer integrated manufacturing environment has to be moderated following the tests carried out in this work, as follows:- The Token Passing LAN presents no serious problems under normal traffic conditions, however, the CSMA/CD LAN can only be used in relatively light traffic conditions i.e. below 30% of its designed maximum capacity, providing special arrangements are made to minimise the access, transmission and processing delays of speech packets. Given that a certain amount of delay is inevitable in packet switched systems (LANs), investigations have been carried out into techniques for reducing the subjective efifect of speech packet loss on real-time interactive systems due to the unacceptable delays caused by the conditions mentioned above

3G Wideband CDMA : packet-based optimisation for high data-rate downlink transmission

A third generation (3G) of mobile communication systems, based on Wideband CDMA, are intended to offer high-speed packet-based services. Network operators wish to maximise the throughput in the downlink of3G systems, which requires efficient allocation ofresources. This thesis considers the problem ofmaximising throughput in an interference dominated channel. Cooperative broadcasting is a theoretical technique to mitigate this problem. Its implementation in practical systems requires efficient resource allocati.on to maximise the thr(oughput whilst meeting system and user-imposed constramts. A resource allocation approach is presented for implementing cooperative broadcasting. Users are paired and a teclmique for allocating resources between the pair is developed. Then, a method for pairing the users is considered. Simulation results are presented, which show a throughput improvement over existing resource allocation approaches. The problem ofcontrolling the distribution ofrandomly arriving data to meet the resource allocation specifications is examined. A single-threshold buffer is proposed, which requires fewer calculations than an existing double-threshold buffer. Simulation results are presented which show a throughput improvement may be realised, greater than that which would achievable using other rate control schemes. Cooperative broadcasting may lead to transmissions to some users being allocated low power. When full channel infonnation is available at the transmitter, a water filling solution may be used to maximise capacity. However, when combined with buffer management, erasure may result. This erasure may be overcome using an erasure protection code. Such a code is examined. When combined with Turbo coding, ajoint detector may be used for providing error and erasure protection. Analysis ofthis detector shows a lower limit on the error rate, dependent on the probability of erasure. Simulation results show that using this approach the error rate is significantly improved. This code can then be used to increase capacity, whilst achieving low error rates.Imperial Users onl

Space station data system analysis/architecture study. Task 4: System definition report

Functional/performance requirements for the Space Station Data System (SSDS) are analyzed and architectural design concepts are derived and evaluated in terms of their performance and growth potential, technical feasibility and risk, and cost effectiveness. The design concepts discussed are grouped under five major areas: SSDS top-level architecture overview, end-to-end SSDS design and operations perspective, communications assumptions and traffic analysis, onboard SSDS definition, and ground SSDS definition

Proceedings of a IIASA Conference on Computer Communications Networks

This publication contains the papers presented at the Conference on Computer Networks organized by the Computer Science Project of IIASA in October 1974. This area is one of the main concerns of the Computer Science Project, but also has a broader significance for the Institute. IIASA deals with various problems of industrialization and its consequences, and inevitably depends on permanent working contacts with a number of national institutions. The interdisciplinary and international character of the Institute is essential to success in finding solutions to these problems. Applied research today depends heavily on the use of large amounts of data and data processing. We believe that connecting computers installed in various national institutions will contribute significantly to the achievements of the main goals, allowing for the exchange of data and programs, and in this way facilitating the understanding of problems, resulting in faster solutions. This Conference was the first of a series of conferences and workshops to be held on this topic. In addition to the exchange of ideas and the discussion of problems arising in networking, it was intended also to identify people and institutions that were interested in establishing links contributing to the achievement of the goals of the Institute. In addition to the presentation of papers and formal discussions, discussions on the periphery of the conference were probably of equal importance. The papers presented do not reflect the spirit of cooperation which was very characteristic of the conference. However, we feel that the publication of these papers will be useful to the scientific community and give a picture of recent developments in this area. Mr. J. Sexton and Miss U. Sichra are staff members of the Computer Science Project who devoted a great deal of their time and efforts to the editing of the papers. Mrs. H. MacKinnon was especially helpful in the technical editing and polishing of a number of the papers presented

Discrete-time queueing models with priorities

This PhD-dissertation contains analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the system contents and packet delays of both classes. The results are applicable in heterogeneous telecommunication networks, when delay-sensitive traffic gets transmission priority over best-effort traffic. Our results predict the influence of priority scheduling on the QoS (Quality-of-Service) of the different types of traffic