On IP over WDM burst-switched long haul and metropolitan area networks

The IP over Wavelength Division Multiplexing (WDM) network is a natural evolution ushered in by the phenomenal advances in networking technologies and technical breakthroughs in optical communications, fueled by the increasing demand in the reduction of operation costs and the network management complexity. The unprecedented bandwidth provisioning capability and the multi-service supportability of the WDM technology, in synergy with the data-oriented internetworking mechanisms, facilitates a common shared infrastructure for the Next Generation Internet (NGJ). While NGI targets to perform packet processing directly on the optical transport layer, a smooth evolution is critical to success. Intense research has been conducted to design the new generation optical networks that retain the advantages of packet-oriented transport prototypes while rendering elastic network resource utilization and graded levels of service. This dissertation is focused on the control architecture, enabling technologies, and performance analysis of the WDM burst-switched long haul and Metropolitan Area Networks (MANs). Theoretical analysis and simulation results are reported to demonstrate the system performance and efficiency of proposed algorithms. A novel transmission mechanism, namely, the Forward Resource Reservation (ERR) mechanism, is proposed to reduce the end-to-end delay for an Optical Burst Switching (OBS)-based IP over WDM system. The ERR scheme adopts a Linear Predictive Filter and an aggressive reservation strategy for data burst length prediction and resource reservation, respectively, and is extended to facilitate Quality of Service (QoS) differentiation at network edges. The ERR scheme improves the real-time communication services for applications with time constraints without deleterious system costs. The aggressive strategy for channel holding time reservations is proposed. Specifically, two algorithms, the success probability-driven (SPD) and the bandwidth usage-driven (BUD) ones, are proposed for resource reservations in the FRRenabled scheme. These algorithms render explicit control on the latency reduction improvement and bandwidth usage efficiency, respectively, both of which are important figures of performance metrics. The optimization issue for the FRR-enabled system is studied based on two disciplines - addressing the static and dynamic models targeting different desired objectives (in terms of algorithm efficiency and system performance), and developing a \u27\u27crank back\u27\u27 based signaling mechanism to provide bandwidth usage efficiency. The proposed mechanisms enable the network nodes to make intelligent usage of the bandwidth resources. In addition, a new control architecture with enhanced address resolution protocol (E-ARP), burst-based transmission, and hop-based wavelength allocation is proposed for Ethernet-supported IP over WDM MANs. It is verified, via theoretical analysis and simulation results, that the E-ARP significantly reduces the call setup latency and the transmission requirements associated with the address probing procedures; the burst-based transport mechanism improves the network throughput and resource utilization; and the hop-based wavelength allocation algorithm provides bandwidth multiplexing with fairness and high scalability. The enhancement of the Ethernet services, in tandem with the innovative mechanisms in the WDM domain, facilitates a flexible and efficient integration, thus making the new generation optical MAN optimized for the scalable, survivable, and IP-dominated network at gigabit speed possible

Design and implementation of high speed multimedia network.

by Yeung Chung Toa.Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.Includes bibliographical references (leaves 63-[65]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Bandwidth required by multimedia applications --- p.1Chapter 1.2 --- Real-time requirement --- p.2Chapter 1.3 --- Multicasting --- p.2Chapter 1.4 --- Other networks --- p.3Chapter 1.5 --- Overview of CUM LAUDE NET --- p.5Chapter 1.5.1 --- Protocols --- p.7Chapter 1.5.2 --- Network Services --- p.8Chapter 1.6 --- Scope of the Thesis --- p.9Chapter 2 --- Network Architecture --- p.11Chapter 2.1 --- CUM LAUDE NET Architectural Overview --- p.11Chapter 2.2 --- Level One Network Architecture --- p.12Chapter 2.3 --- Level-One Router --- p.14Chapter 2.3.1 --- packet forwarding --- p.14Chapter 2.3.2 --- packet insertion --- p.15Chapter 2.3.3 --- packet removal --- p.15Chapter 2.3.4 --- fault protection --- p.15Chapter 2.4 --- Hub --- p.16Chapter 2.5 --- Host & Network Interface Card --- p.17Chapter 3 --- Protocol --- p.19Chapter 3.1 --- Design Overview --- p.19Chapter 3.2 --- Layering --- p.20Chapter 3.3 --- "Segment, Datagram, and Packet Format" --- p.21Chapter 3.3.1 --- IP/VCI field --- p.23Chapter 3.4 --- Data Link --- p.23Chapter 3.4.1 --- byte format and data link synchronization --- p.23Chapter 3.4.2 --- access control byte --- p.24Chapter 3.4.3 --- packet/frame boundary --- p.26Chapter 3.5 --- Fast Packet Routing Protocol --- p.26Chapter 3.5.1 --- Level-2/Level-l Bridge/Router --- p.27Chapter 3.5.2 --- Level-1 Hub --- p.29Chapter 3.5.3 --- Local Host NIC --- p.29Chapter 3.6 --- Media Access Control Protocol I : ACTA --- p.30Chapter 3.7 --- Media Access Control Protocol II: Hub Polling --- p.34Chapter 3.8 --- Protocol Implementation on CUM LAUDE NET --- p.36Chapter 4 --- Hardware Implementation & Performance of Routers and NIC --- p.40Chapter 4.1 --- Functionality of Router --- p.40Chapter 4.2 --- Important Components Used in the Router Design --- p.43Chapter 4.2.1 --- TAXI Transmitter and Receiver --- p.43Chapter 4.2.2 --- First-In-First-Out Memory (FIFO) --- p.44Chapter 4.3 --- Design of Router --- p.45Chapter 4.3.1 --- Version 1 --- p.45Chapter 4.3.2 --- Version 2 --- p.47Chapter 4.3.3 --- Version 3 --- p.50Chapter 4.4 --- Lessons Learned from the High Speed Router Design --- p.57Chapter 5 --- Conclusion --- p.61Bibliography --- p.6

Convergence of IP-based and optical transport networks

Today Network and Service Providers are aware of the increasing data traffic volumes and as such they are strategically moving investigations toward a single integrated voice and data infrastructure. In this context IP is gaining the role of the integration layer for multiple services. Nevetheless incumbent NSPs that build a multi-service IP network are going to need connectivity to its preexisting legacy networks (e.g. ATM. SONET, SDH). This reason motivates the introduction of a client-independent Optical Transport Network (OTN) as a missing link to guarantee a smooth evolution from legacy networks to a data-centric OTN. The scope of this paper is to give some guidelines about the definition of functionality and architectures of a multilayers infrastructure supporting the transport of data and circuit-based services. Particularly, the identification of the different service requirements, as well as the understanding of the allowed degradation, provide a picture of the needed survivability mechanism of IP over OTN scenarios

IP and ATM integration: A New paradigm in multi-service internetworking

ATM is a widespread technology adopted by many to support advanced data communication, in particular efficient Internet services provision. The expected challenges of multimedia communication together with the increasing massive utilization of IP-based applications urgently require redesign of networking solutions in terms of both new functionalities and enhanced performance. However, the networking context is affected by so many changes, and to some extent chaotic growth, that any approach based on a structured and complex top-down architecture is unlikely to be applicable. Instead, an approach based on finding out the best match between realistic service requirements and the pragmatic, intelligent use of technical opportunities made available by the product market seems more appropriate. By following this approach, innovations and improvements can be introduced at different times, not necessarily complying with each other according to a coherent overall design. With the aim of pursuing feasible innovations in the different networking aspects, we look at both IP and ATM internetworking in order to investigating a few of the most crucial topics/ issues related to the IP and ATM integration perspective. This research would also address various means of internetworking the Internet Protocol (IP) and Asynchronous Transfer Mode (ATM) with an objective of identifying the best possible means of delivering Quality of Service (QoS) requirements for multi-service applications, exploiting the meritorious features that IP and ATM have to offer. Although IP and ATM often have been viewed as competitors, their complementary strengths and limitations from a natural alliance that combines the best aspects of both the technologies. For instance, one limitation of ATM networks has been the relatively large gap between the speed of the network paths and the control operations needed to configure those data paths to meet changing user needs. IP\u27s greatest strength, on the other hand, is the inherent flexibility and its capacity to adapt rapidly to changing conditions. These complementary strengths and limitations make it natural to combine IP with ATM to obtain the best that each has to offer. Over time many models and architectures have evolved for IP/ATM internetworking and they have impacted the fundamental thinking in internetworking IP and ATM. These technologies, architectures, models and implementations will be reviewed in greater detail in addressing possible issues in integrating these architectures s in a multi-service, enterprise network. The objective being to make recommendations as to the best means of interworking the two in exploiting the salient features of one another to provide a faster, reliable, scalable, robust, QoS aware network in the most economical manner. How IP will be carried over ATM when a commercial worldwide ATM network is deployed is not addressed and the details of such a network still remain in a state of flux to specify anything concrete. Our research findings culminated with a strong recommendation that the best model to adopt, in light of the impending integrated service requirements of future multi-service environments, is an ATM core with IP at the edges to realize the best of both technologies in delivering QoS guarantees in a seamless manner to any node in the enterprise

Design and implementation of a fault-tolerant multimedia network and a local map based (LMB) self-healing scheme for arbitrary topology networks.

by Arion Ko Kin Wa.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 101-[106]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Overview --- p.1Chapter 1.2 --- Service Survivability Planning --- p.2Chapter 1.3 --- Categories of Outages --- p.3Chapter 1.4 --- Goals of Restoration --- p.4Chapter 1.5 --- Technology Impacts on Network Survivability --- p.5Chapter 1.6 --- Performance Models and Measures in Quantifying Network Sur- vivability --- p.6Chapter 1.7 --- Organization of Thesis --- p.6Chapter 2 --- Design and Implementation of A Survivable High-Speed Mul- timedia Network --- p.8Chapter 2.1 --- An Overview of CUM LAUDE NET --- p.8Chapter 2.2 --- The Network Architecture --- p.9Chapter 2.2.1 --- Architectural Overview --- p.9Chapter 2.2.2 --- Router-Node Design --- p.11Chapter 2.2.3 --- Buffer Allocation --- p.12Chapter 2.2.4 --- Buffer Transmission Priority --- p.14Chapter 2.2.5 --- Congestion Control --- p.15Chapter 2.3 --- Protocols --- p.16Chapter 2.3.1 --- Design Overview --- p.16Chapter 2.3.2 --- ACTA - The MAC Protocol --- p.17Chapter 2.3.3 --- Protocol Layering --- p.18Chapter 2.3.4 --- "Segment, Datagram and Packet Format" --- p.20Chapter 2.3.5 --- Fast Packet Routing --- p.22Chapter 2.3.6 --- Local Host NIU --- p.24Chapter 2.4 --- The Network Restoration Strategy --- p.25Chapter 2.4.1 --- The Dual-Ring Model and Assumptions --- p.26Chapter 2.4.2 --- Scenarios of Network Failure and Remedies --- p.26Chapter 2.4.3 --- Distributed Fault-Tolerant Algorithm --- p.26Chapter 2.4.4 --- Distributed Auto-Healing Algorithm --- p.28Chapter 2.4.5 --- The Network Management Signals --- p.31Chapter 2.5 --- Performance Evaluation --- p.32Chapter 2.5.1 --- Restoration Time --- p.32Chapter 2.5.2 --- Reliability Measures --- p.34Chapter 2.5.3 --- Network Availability During Restoration --- p.41Chapter 2.6 --- The Prototype --- p.42Chapter 2.7 --- Technical Problems Encountered --- p.45Chapter 2.8 --- Chapter Summary and Future Development --- p.46Chapter 3 --- A Simple Experimental Network Management Software - NET- MAN --- p.48Chapter 3.1 --- Introduction to NETMAN --- p.48Chapter 3.2 --- Network Management Basics --- p.49Chapter 3.2.1 --- The Level of Management Protocols --- p.49Chapter 3.2.2 --- Architecture Model --- p.51Chapter 3.2.3 --- TCP/IP Network Management Protocol Architecture --- p.53Chapter 3.2.4 --- A Standard Network Management Protocol On Internet - SNMP --- p.54Chapter 3.2.5 --- A Standard For Managed Information --- p.55Chapter 3.3 --- The CUM LAUDE Network Management Protocol Suite (CNMPS) --- p.56Chapter 3.3.1 --- The Architecture --- p.53Chapter 3.3.2 --- Goals of the CNMPS --- p.59Chapter 3.4 --- Highlights of NETMAN --- p.61Chapter 3.5 --- Functional Descriptions of NETMAN --- p.63Chapter 3.5.1 --- Topology Menu --- p.64Chapter 3.5.2 --- Fault Manager Menu --- p.65Chapter 3.5.3 --- Performance Meter Menu --- p.65Chapter 3.5.4 --- Gateway Utility Menu --- p.67Chapter 3.5.5 --- Tools Menu --- p.67Chapter 3.5.6 --- Help Menu --- p.68Chapter 3.6 --- Chapter Summary --- p.68Chapter 4 --- A Local Map Based (LMB) Self-Healing Scheme for Arbitrary Topology Networks --- p.70Chapter 4.1 --- Introduction --- p.79Chapter 4.2 --- An Overview of Existing DCS-Based Restoration Algorithms --- p.72Chapter 4.3 --- The Network Model and Assumptions --- p.74Chapter 4.4 --- Basics of the LMB Scheme --- p.75Chapter 4.4.1 --- Restoration Concepts --- p.75Chapter 4.4.2 --- Terminology --- p.76Chapter 4.4.3 --- Algorithm Parameters --- p.77Chapter 4.5 --- Performance Assessments --- p.78Chapter 4.6 --- The LMB Network Restoration Scheme --- p.80Chapter 4.6.1 --- Initialization - Local Map Building --- p.80Chapter 4.6.2 --- The LMB Restoration Messages Set --- p.81Chapter 4.6.3 --- Phase I - Local Map Update Phase --- p.81Chapter 4.6.4 --- Phase II - Update Acknowledgment Phase --- p.82Chapter 4.6.5 --- Phase III - Restoration and Confirmation Phase --- p.83Chapter 4.6.6 --- Phase IV - Cancellation Phase --- p.83Chapter 4.6.7 --- Re-Initialization --- p.84Chapter 4.6.8 --- Path Route Monitoring --- p.84Chapter 4.7 --- Performance Evaluation --- p.84Chapter 4.7.1 --- The Testbeds --- p.84Chapter 4.7.2 --- Simulation Results --- p.86Chapter 4.7.3 --- Storage Requirements --- p.89Chapter 4.8 --- The LMB Scheme on ATM and SONET environment --- p.92Chapter 4.9 --- Future Work --- p.94Chapter 4.10 --- Chapter Summary --- p.94Chapter 5 --- Conclusion and Future Work --- p.96Chapter 5.1 --- Conclusion --- p.95Chapter 5.2 --- Future Work --- p.99Bibliography --- p.101Chapter A --- Derivation of Communicative Probability --- p.107Chapter B --- List of Publications --- p.11

Novel algorithms for fair bandwidth sharing on counter rotating rings

Rings are often preferred technology for networks as ring networks can virtually create fully connected mesh networks efficiently and they are also easy to manage. However, providing fair service to all the stations on the ring is not always easy to achieve. In order to capitalize on the advantages of ring networks, new buffer insertion techniques, such as Spatial Reuse Protocol (SRP), were introduced in early 2000s. As a result, a new standard known as IEEE 802.17 Resilient Packet Ring was defined in 2004 by the IEEE Resilient Packet Ring (RPR) Working Group. Since then two addenda have been introduced; namely, IEEE 802.17a and IEEE 802.17b in 2006 and 2010, respectively. During this standardization process, weighted fairness and queue management schemes were proposed to be used in the standard. As shown in this dissertation, these schemes can be applied to solve the fairness issues noted widely in the research community as radical changes are not practical to introduce within the context of a standard. In this dissertation, the weighted fairness aspects of IEEE 802.17 RPR (in the aggressive mode of operation) are studied; various properties are demonstrated and observed via network simulations, and additional improvements are suggested. These aspects have not been well studied until now, and can be used to alleviate some of the issues observed in the fairness algorithm under some scenarios. Also, this dissertation focuses on the RPR Medium Access Control (MAC) Client implementation of the IEEE 802.17 RPR MAC in the aggressive mode of operation and introduces a new active queue management scheme for ring networks that achieves higher overall utilization of the ring bandwidth with simpler and less expensive implementation than the generic implementation provided in the standard. The two schemes introduced in this dissertation provide performance comparable to the per destination queuing implementation, which yields the best achievable performance at the expense of the cost of implementation. In addition, till now the requirements for sizing secondary transit queue of IEEE 802.17 RPR stations (in the aggressive mode of operation) have not been properly investigated. The analysis and suggested improvements presented in this dissertation are then supported by performance evaluation results and theoretical calculations. Last, but not least, the impact of using different capacity links on the same ring has not been investigated before from the ring utilization and fairness points of view. This dissertation also investigates utilizing different capacity links in RPR and proposes a mechanism to support the same

A high speed fault-tolerant multimedia network and connectionless gateway for ATM networks.

by Patrick Lam Sze Fan.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 163-[170]).Chapter 1 --- Introduction --- p.1Chapter 2 --- Fault-tolerant CUM LAUDE NET --- p.7Chapter 2.1 --- Overview of CUM LAUDE NET --- p.7Chapter 2.2 --- Network architecture of CUM LAUDE NET --- p.8Chapter 2.3 --- Design of Router-node --- p.10Chapter 2.3.1 --- Architecture of the Router-node --- p.10Chapter 2.3.2 --- Buffers Arrangement of the Router-node --- p.12Chapter 2.3.3 --- Buffer transmission policies --- p.13Chapter 2.4 --- Protocols of CUM LAUDE NET --- p.14Chapter 2.5 --- Frame Format of CUM LAUDE NET --- p.15Chapter 2.6 --- Fault-tolerant (FT) and Auto-healing (AH) algorithms --- p.16Chapter 2.6.1 --- Overview of the algorithms --- p.16Chapter 2.6.2 --- Network Failure Scenarios --- p.18Chapter 2.6.3 --- Design and Implementation of the Fault Tolerant Algorithm --- p.19Chapter 2.6.4 --- Design and Implementation of the Auto Healing Algorithm --- p.26Chapter 2.6.5 --- Network Management Signals and Restoration Times --- p.27Chapter 2.6.6 --- Comparison of fault-tolerance features of other networks with the CUM LAUDE NET --- p.31Chapter 2.7 --- Chapter Summary --- p.31Chapter 3 --- Overview of the Asynchronous Transfer Mode (ATM) --- p.33Chapter 3.1 --- Introduction --- p.33Chapter 3.2 --- ATM Network Interfaces --- p.34Chapter 3.3 --- ATM Virtual Connections --- p.35Chapter 3.4 --- ATM Cell Format --- p.36Chapter 3.5 --- ATM Address Formats --- p.36Chapter 3.6 --- ATM Protocol Reference Model --- p.38Chapter 3.6.1 --- The ATM Layer --- p.39Chapter 3.6.2 --- The ATM Adaptation Layer --- p.39Chapter 3.7 --- ATM Signalling --- p.44Chapter 3.7.1 --- ATM Signalling Messages and Call Setup Procedures --- p.45Chapter 3.8 --- Interim Local Management Interface (ILMI) --- p.47Chapter 4 --- Issues of Connectionless Gateway --- p.49Chapter 4.1 --- Introduction --- p.49Chapter 4.2 --- The Issues --- p.50Chapter 4.3 --- ATM Internetworking --- p.51Chapter 4.3.1 --- LAN Emulation --- p.52Chapter 4.3.2 --- IP over ATM --- p.53Chapter 4.3.3 --- Comparing IP over ATM and LAN Emulation --- p.59Chapter 4.4 --- Connection Management --- p.61Chapter 4.4.1 --- The Indirect Approach --- p.62Chapter 4.4.2 --- The Direct Approach --- p.63Chapter 4.4.3 --- Comparing the two approaches --- p.64Chapter 4.5 --- Protocol Conversion --- p.65Chapter 4.5.1 --- Selection of Protocol Converter --- p.68Chapter 4.6 --- Packet Forwarding Modes --- p.68Chapter 4.7 --- Bandwidth Assignment --- p.70Chapter 4.7.1 --- Bandwidth Reservation --- p.71Chapter 4.7.2 --- Fast Bandwidth Reservation --- p.72Chapter 4.7.3 --- Bandwidth Advertising --- p.72Chapter 4.7.4 --- Bandwidth Advertising with Cell Drop Detection --- p.73Chapter 4.7.5 --- Bandwidth Allocation on Source Demand --- p.73Chapter 4.7.6 --- The Common Problems --- p.74Chapter 5 --- Design and Implementation of the Connectionless Gateway --- p.77Chapter 5.1 --- Introduction --- p.77Chapter 5.1.1 --- Functions Definition of Connectionless Gateway --- p.79Chapter 5.2 --- Hardware Architecture of the Connectionless Gateway --- p.79Chapter 5.2.1 --- Imposed Limitations --- p.82Chapter 5.3 --- Software Architecture of the Connectionless Gateway --- p.83Chapter 5.3.1 --- TCP/IP Internals --- p.84Chapter 5.3.2 --- ATM on Linux --- p.85Chapter 5.4 --- Network Architecture --- p.88Chapter 5.4.1 --- IP Addresses Assignment --- p.90Chapter 5.5 --- Internal Structure of Connectionless Gateway --- p.90Chapter 5.5.1 --- Protocol Stacks of the Gateway --- p.90Chapter 5.5.2 --- Gateway Operation by Example --- p.93Chapter 5.5.3 --- Routing Table Maintenance --- p.97Chapter 5.6 --- Additional Features --- p.105Chapter 5.6.1 --- Priority Output Queues System --- p.105Chapter 5.6.2 --- Gateway Performance Monitor --- p.112Chapter 5.7 --- Setup an Operational ATM LAN --- p.117Chapter 5.7.1 --- SVC Connections --- p.117Chapter 5.7.2 --- PVC Connections --- p.119Chapter 5.8 --- Application of the Connectionless Gateway --- p.120Chapter 6 --- Performance Measurement of the Connectionless Gateway --- p.121Chapter 6.1 --- Introduction --- p.121Chapter 6.2 --- Experimental Setup --- p.121Chapter 6.3 --- Measurement Tools of the Experiments --- p.123Chapter 6.4 --- Descriptions of the Experiments --- p.124Chapter 6.4.1 --- Log Files --- p.125Chapter 6.5 --- UDP Control Rate Test --- p.126Chapter 6.5.1 --- Results and analysis of the UDP Control Rate Test --- p.127Chapter 6.6 --- UDP Maximum Rate Test --- p.138Chapter 6.6.1 --- Results and analysis of the UDP Maximum Rate Test --- p.138Chapter 6.7 --- TCP Maximum Rate Test --- p.140Chapter 6.7.1 --- Results and analysis of the TCP Maximum Rate Test --- p.140Chapter 6.8 --- Request/Response Test --- p.144Chapter 6.8.1 --- Results and analysis of the Request/Response Test --- p.144Chapter 6.9 --- Priority Queue System Verification Test --- p.149Chapter 6.9.1 --- Results and analysis of the Priority Queue System Verifi- cation Test --- p.150Chapter 6.10 --- Other Observations --- p.153Chapter 6.11 --- Solutions to Improve the Performance --- p.154Chapter 6.12 --- Future Development --- p.157Chapter 7 --- Conclusion --- p.158Bibliography --- p.163A List of Publications --- p.17