Analysis of network traffic and its applications /
Quality of service (QoS) is an important issue in high speed packet switching networks that support a diverse set of services, including videoconference, telemedicine, distance education, video on demanding, voice mail, and so on. The success in the deployment and management of such networks will cr...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1999.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=731685811&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
| Summary: | Quality of service (QoS) is an important issue in high speed packet switching networks that support a diverse set of services, including videoconference, telemedicine, distance education, video on demanding, voice mail, and so on. The success in the deployment and management of such networks will critically depend on how well we know the network tragic behaviour. In this dissertation, we study the network tragic and related issues in the high speed packet switching networks which support real time communication. We concentrate on the techniques for analysis of the network traffic and its applications in the network management. The contributions of this dissertation are: 1. We develop a comprehensive methodology which can be used to evaluate upper bounds of connections' end-trend delays for networks with static priority driven scheduling discipline and arbitrary topology. This methodology has been adopted in the NetEx project which collaborates with Honeywell Technology Center, Minneapolis in a DARPA funded Real-Time Adaptive Resource Management project. 2. We prove that to and an optimal static priority assignment for connections in a network system is an Np-hard problem if the network system has more than two switches. Furthermore, we propose a suboptimal static priority assignment algorithm based on the location and tragic information of connections. Our simulation results show that the proposed algorithm performs better than other well known static priority assignment algorithms. 3. We develop criteria for testing the stability of an ATM network with arbitrary topology. For a specialized ring topology (Cruz-Gallager-Parekh ring), we prove that the network is stable if the total utilization of each link is less than 73.2%. |
|---|---|
| Item Description: | Vita. "Major Subject: Computer Engineering". |
| Physical Description: | xi, 118 leaves : illustrations ; 28 cm. Issued also on microfiche from University Microfilm Inc. |
| Bibliography: | Includes bibliographical references (leaves 109-116). |