87 research outputs found

    Self-healing network architectures for multiwavelength optical metro/access networks.

    Get PDF
    Sun Xiaofeng.Thesis (M.Phil.)--Chinese University of Hong Kong, 2006.Includes bibliographical references (leaves 61-64).Abstracts in English and Chinese.Chapter CHAPTER 1 --- INTRODUCTION --- p.1Chapter 1.1 --- Optical network evolution --- p.2Chapter 1.1.1 --- Submarine and terrestrial long-haul fibre systems --- p.2Chapter 1.1.2 --- Metropolitan networks --- p.3Chapter 1.1.3 --- Access networks --- p.4Chapter 1.2 --- Motivation of this thesis --- p.6Chapter 1.3 --- Outline of this thesis --- p.7Chapter CHAPTER 2 --- PREVIOUS SELF-HEALING NETWORK ARCHITECTURES --- p.9Chapter 2.1 --- Introduction --- p.10Chapter 2.1.1 --- Previous protection architectures for access networks --- p.10Chapter 2.1.2 --- Previous protection architectures for metro access networks --- p.13Chapter 2.3 --- Previous protection architectures for metro backbone networks --- p.15Chapter 2.3.1 --- Unidirectional path-switched rings (UPSR) --- p.15Chapter 2.3.2 --- Bidirectional line-switched rings (BLSR) --- p.16Chapter 2.3.3 --- Ring interconnection and dual homing --- p.17Chapter 2.4 --- Summary --- p.19Chapter CHAPTER 3 --- SELF-HEALING NETWORK ARCHITECTURE FOR WDM OPTICAL ACCESS NETWORKS --- p.20Chapter 3.1 --- Introduction --- p.21Chapter 3.2 --- Star-Ring Protection Architecture (SRPA) --- p.21Chapter 3.2.1 --- Motivation --- p.21Chapter 3.2.2 --- Network topology of SRPA --- p.22Chapter 3.2.3 --- Wavelength assignment of SRPA --- p.22Chapter 3.2.4 --- Structure of ONU --- p.23Chapter 3.2.5 --- Protection mechanism --- p.25Chapter 3.2.6 --- Experimental demonstration --- p.26Chapter 3.2.7 --- Power budget --- p.28Chapter 3.2.8 --- Summary --- p.28Chapter 3.3 --- Duplicated-Tree Protection Architecture (DTPA) --- p.28Chapter 3.3.1 --- Motivation --- p.28Chapter 3.3.2 --- Network topology and wavelength assignment --- p.29Chapter 3.3.3 --- Structure of OLT --- p.30Chapter 3.3.4 --- Protection mechanism --- p.31Chapter 3.3.5 --- Experimental demonstration --- p.33Chapter 1.1.1 --- Summary --- p.34Chapter 1.4 --- Summary --- p.35Chapter CHAPTER 4 --- SINGLE-FIBER SELF-HEALING WDM RING NETWORK ARCHITECTURE FOR METRO ACCESS NETWORKS --- p.36Chapter 4.1 --- Introduction --- p.37Chapter 4.2 --- Network architecture and wavelength assignment --- p.37Chapter 4.3 --- Structure of access node --- p.39Chapter 4.4 --- Structure of hub node --- p.40Chapter 4.5 --- Protection mechanism --- p.42Chapter 4.6 --- Experimental demonstration --- p.43Chapter 4.7 --- Optimization of access node --- p.47Chapter 4.8 --- Scalability --- p.48Chapter 4.9 --- Summary --- p.49Chapter CHAPTER 5 --- SELF-HEALING WDM MESH NETWORK ARCHITECTURE FOR METRO BACKBONE NETWORKS… --- p.50Chapter 5.1 --- Introduction --- p.51Chapter 5.2 --- Network architecture and node structure --- p.51Chapter 5.3 --- Protection mechanism --- p.53Chapter 5.4 --- Experimental demonstration --- p.55Chapter 5.5 --- Summary --- p.57Chapter CHAPTER 6 --- SUMMARYAND FUTURE WORKS --- p.58Chapter 6.1 --- Summary of the Thesis --- p.59Chapter 6.2 --- Future Works --- p.59LIST OF PUBLICATIONS --- p.61REFERENCES --- p.6

    Impact of local competition and regulation on deployment of advanced telecommunications services for businesses

    Get PDF
    Thesis (S.M.)--Massachusetts Institute of Technology, Engineering Systems Division, Technology and Policy Program, 2003.Leaf 110 blank.Includes bibliographical references (leaves 103-107).This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.After a decade of development, advanced telecommunications services (ATS) are widely available in many markets. This thesis is concerned with the impact of local competition and government regulation on the deployment of advanced telecommunications services for business in the United States. These services include packet switching, digital signal level (DS) technologies and synchronous optical network (SONET) – optical carrier (OC) transport. Increasingly, businesses are using these services for intra and extra network communications. Access to advanced telecommunication services is important for economic development. Government policy makers are interested in identifying what steps can be taken to accelerate the roll-out of services in their communities. Business and corporate users are often interested in services that are different from what the residential customers desire. This thesis focuses on a broader range of advanced services of interest to the business customers than most empirical research to date. It also provides a better and more insightful metric at a finer level of granularity to address these questions. The impacts of local business conditions, rivalry and regulations on the deployment of advanced telecommunication services are analyzed by means of econometric analysis. A rich data set has been constructed which identifies the competitive, regulatory and economic climates at each incumbent’s wire center in the United States. A qualitative response model is used to estimate how business characteristics of the communities and their regulatory environments affect the deployment of ATS. I conclude that local competition, federal subsidies, 271 approval, and high unbundled network element (UNE) price to book cost ratio have positive impacts on advanced telecommunication services deployment, while federal price cap regulation and location in a rural area have negative impacts. These findings have significant implications on government regulatory policies. The thesis recommends regulatory policies, which focus on services, such as rate-based rate-of-return regulation over price caps and encourages competitors’ entry, facilities-based competition and federal support to accelerate deployment of advanced telecommunications services. It concludes by encouraging governments and organizations to support more research, experimentation and better data collection to increase understanding of underlying socio-economic and regulatory factors affecting deployment of advanced telecommunications services.by Guang-Lih Huang.S.M

    Planning broadband infrastructure - a reference model

    Get PDF

    Ethernet Networks for Real-Time Use in the ATLAS Experiment

    Get PDF
    Ethernet became today's de-facto standard technology for local area networks. Defined by the IEEE 802.3 and 802.1 working groups, the Ethernet standards cover technologies deployed at the first two layers of the OSI protocol stack. The architecture of modern Ethernet networks is based on switches. The switches are devices usually built using a store-and-forward concept. At the highest level, they can be seen as a collection of queues and mathematically modelled by means of queuing theory. However, the traffic profiles on modern Ethernet networks are rather different from those assumed in classical queuing theory. The standard recommendations for evaluating the performance of network devices define the values that should be measured but do not specify a way of reconciling these values with the internal architecture of the switches. The introduction of the 10 Gigabit Ethernet standard provided a direct gateway from the LAN to the WAN by the means of the WAN PHY. Certain aspects related to the actual use of WAN PHY technology were vaguely defined by the standard. The ATLAS experiment at CERN is scheduled to start operation at CERN in 2007. The communication infrastructure of the Trigger and Data Acquisition System will be built using Ethernet networks. The real-time operational needs impose a requirement for predictable performance on the network part. In view of the diversity of the architectures of Ethernet devices, testing and modelling is required in order to make sure the full system will operate predictably. This thesis focuses on the testing part of the problem and addresses issues in determining the performance for both LAN and WAN connections. The problem of reconciling results from measurements to architectural details of the switches will also be tackled. We developed a scalable traffic generator system based on commercial-off-the-shelf Gigabit Ethernet network interface cards. The generator was able to transmit traffic at the nominal Gigabit Ethernet line rate for all frame sizes specified in the Ethernet standard. The calculation of latency was performed with accuracy in the range of +/- 200 ns. We indicate how certain features of switch architectures may be identified through accurate throughput and latency values measured for specific traffic distributions. At this stage, we present a detailed analysis of Ethernet broadcast support in modern switches. We use a similar hands-on approach to address the problem of extending Ethernet networks over long distances. Based on the 1 Gbit/s traffic generator used in the LAN, we develop a methodology to characterise point-to-point connections over long distance networks. At higher speeds, a combination of commercial traffic generators and high-end servers is employed to determine the performance of the connection. We demonstrate that the new 10 Gigabit Ethernet technology can interoperate with the installed base of SONET/SDH equipment through a series of experiments on point-to-point circuits deployed over long-distance network infrastructure in a multi-operator domain. In this process, we provide a holistic view of the end-to-end performance of 10 Gigabit Ethernet WAN PHY connections through a sequence of measurements starting at the physical transmission layer and continuing up to the transport layer of the OSI protocol stack

    A year 2003 conceptual model for the U.S. telecommunications infrastructure.

    Full text link

    High performance computing and communications: Advancing the frontiers of information technology

    Full text link

    Architectures and protocols for sub-wavelength optical networks: contributions to connectionless and connection-oriented data transport

    Get PDF
    La ràpida evolució d’Internet i l’àmplia gamma de noves aplicacions (per exemple, multimèdia, videoconferència, jocs en línia, etc.) ha fomentat canvis revolucionaris en la manera com ens comuniquem. A més, algunes d’aquestes aplicacions demanden grans quantitats de recursos d’ample de banda amb diversos requeriments de qualitat de servei (QoS). El desenvolupament de la multiplexació per divisió de longitud d’ona (WDM) en els anys noranta va fer molt rendible la disponibilitat d’ample de banda. Avui dia, les tecnologies de commutació òptica de circuits són predominants en el nucli de la xarxa, les quals permeten la configuració de canals (lightpaths) a través de la xarxa. No obstant això, la granularitat d’aquests canals ocupa tota la longitud d’ona, el que fa que siguin ineficients per a proveir canals de menor ample de banda (sub-longitud d’ona). Segons la comunitat científica, és necessari augmentar la transparència dels protocols, així com millorar l’aprovisionament d’ample de banda de forma dinàmica. Per tal de fer això realitat, és necessari desenvolupar noves arquitectures. La commutació òptica de ràfegues i de paquets (OBS/OPS), són dues de les tecnologies proposades. Aquesta tesi contribueix amb tres arquitectures de xarxa destinades a millorar el transport de dades sub-longitud d’ona. En primer lloc, aprofundim en la naturalesa sense connexió en OBS. En aquest cas, la xarxa incrementa el seu dinamisme a causa de les transmissions a ràfega. A més, les col·lisions entre ràfegues degraden el rendiment de la xarxa fins i tot a càrregues molt baixes. Per fer front a aquestes col·lisions, es proposa un esquema de resolució de col·lisions pro actiu basat en un algorisme d’encaminament i assignació de longitud d’ona (RWA) que balanceja de forma automàtica i distribuïda la càrrega en la xarxa. En aquest protocol, el RWA i la transmissió de ràfegues es basen en l’explotació i exploració de regles de commutació que incorporen informació sobre contencions i encaminament. Per donar suport a aquesta arquitectura, s’utilitzen dos tipus de paquets de control per a l’encaminament de les ràfegues i l’actualització de les regles de commutació, respectivament. Per analitzar els beneficis del nou algorisme, s’utilitzen quatre topologies de xarxa diferents. Els resultats indiquen que el mètode proposat millora en diferents marges la resta d’algorismes RWA en funció de la topologia i sense penalitzar altres paràmetres com el retard extrem a extrem. La segona contribució proposa una arquitectura híbrida sense i orientada a connexió sobre la base d’un protocol de control d’accés al medi (MAC) per a xarxes OBS (DAOBS). El MAC ofereix dos mètodes d’accés: arbitratge de cua (QA) per a la transmissió de ràfegues sense connexió, i pre-arbitratge (PA) per serveis TDM orientats a connexió. Aquesta arquitectura permet una àmplia gamma d’aplicacions sensibles al retard i al bloqueig. Els resultats avaluats a través de simulacions mostren que en l’accés QA, les ràfegues de més alta prioritat tenen garantides zero pèrdues i latències d’accés molt baixes. Pel que fa a l’accés PA, es reporta que la duplicació de la càrrega TDM augmenta en més d’un ordre la probabilitat de bloqueig, però sense afectar en la mateixa mesura les ràfegues sense connexió. En aquest capítol també es tracten dos dels problemes relacionats amb l’arquitectura DAOBS i el seu funcionament. En primer lloc, es proposa un model matemàtic per aproximar el retard d’accés inferior i superior com a conseqüència de l’accés QA. En segon lloc, es formula matemàticament la generació i optimització de les topologies virtuals que suporten el protocol per a l’escenari amb tràfic estàtic. Finalment, l’última contribució explora els beneficis d’una arquitectura de xarxa òptica per temps compartit (TSON) basada en elements de càlcul de camins (PCE) centralitzats per tal d’evitar col·lisions en la xarxa. Aquesta arquitectura permet garantir l’aprovisionament orientat a connexió de canals sub-longitud d’ona. En aquest capítol proposem i simulem tres arquitectures GMPLS/PCE/TSON. A causa del enfocament centralitzat, el rendiment de la xarxa depèn en gran mesura de l’assignació i aprovisionament de les connexions. Amb aquesta finalitat, es proposen diferents algorismes d’assignació de ranures temporals i es comparen amb les corresponents formulacions de programació lineal (ILP) per al cas estàtic. Per al cas de tràfic dinàmic, proposem i avaluem mitjançant simulació diferents heurístiques. Els resultats mostren els beneficis de proporcionar flexibilitat en els dominis temporal i freqüencial a l’hora d’assignar les ranures temporals.The rapid evolving Internet and the broad range of new data applications (e.g., multimedia, video-conference, online gaming, etc.) is fostering revolutionary changes in the way we communicate. In addition, some of these applications demand for unprecedented amounts of bandwidth resources with diverse quality of service (QoS). The development of wavelength division multiplexing (WDM) in the 90's made very cost-effective the availability of bandwidth. Nowadays, optical circuit switching technologies are predominant in the core enabling the set up of lightpaths across the network. However, full-wavelength lightpath granularity is too coarse, which results to be inefficient for provisioning sub-wavelength channels. As remarked by the research community, an open issue in optical networking is increasing the protocol transparency as well as provisioning true dynamic bandwidth allocation at the network level. To this end, new architectures are required. Optical burst/packet switching (OBS/OPS) are two such proposed technologies under investigation. This thesis contributes with three network architectures which aim at improving the sub-wavelength data transport from different perspectives. First, we gain insight into the connectionless nature of OBS. Here, the network dynamics are increased due to the short-lived burst transmissions. Moreover, burst contentions degrade the performance even at very low loads. To cope with them, we propose a proactive resolution scheme by means of a distributed auto load-balancing routing and wavelength assignment (RWA) algorithm for wavelength-continuity constraint networks. In this protocol, the RWA and burst forwarding is based on the exploitation and exploration of switching rule concentration values that incorporate contention and forwarding desirability information. To support such architecture, forward and backward control packets are used in the burst forwarding and updating rules, respectively. In order to analyze the benefits of the new algorithm, four different network topologies are used. Results indicate that the proposed method outperforms the rest of tested RWA algorithms at various margins depending on the topology without penalizing other parameters such as end-to-end delay. The second contribution proposes a hybrid connectionless and connection-oriented architecture based on a medium access control (MAC) protocol for OBS networks (DAOBS). The MAC provides two main access mechanisms: queue arbitrated (QA) for connectionless bursts and pre-arbitrated (PA) for TDM connection-oriented services. Such an architecture allows for a broad range of delay-sensitive applications or guaranteed services. Results evaluated through simulations show that in the QA access mode highest priority bursts are guaranteed zero losses and very low access latencies. Regarding the PA mode, we report that doubling the offered TDM traffic load increases in more than one order their connection blocking, slightly affecting the blocking of other connectionless bursts. In this chapter, we also tackle two of the issues related with the DAOBS architecture and its operation. Firstly, we model mathematically the lower and upper approximations of the access delay as a consequence of the connectionless queue arbitrated access. Secondly, we formulate the generation of the virtual light-tree overlay topology for the static traffic case.Postprint (published version

    p-Cycle Based Protection in WDM Mesh Networks

    Get PDF
    Abstract p-Cycle Based Protection in WDM Mesh Networks Honghui Li, Ph.D. Concordia University, 2012 WDM techniques enable single fiber to carry huge amount of data. However, optical WDM networks are prone to failures, and therefore survivability is a very important requirement in the design of optical networks. In the context of network survivability, p-cycle based schemes attracted extensive research interests as they well balance the recovery speed and the capacity efficiency. Towards the design of p-cycle based survivableWDM mesh networks, some issues still need to be addressed. The conventional p-cycle design models and solution methods suffers from scalability issues. Besides, most studies on the design of p-cycle based schemes only cope with single link failures without any concern about single node failures. Moreover, loop backs may exist in the recovery paths along p-cycles, which lead to unnecessary stretching of the recovery path lengths. This thesis investigates the scalable and efficient design of segment p-cycles against single link failures. The optimization models and their solutions rely on large-scale optimization techniques, namely, Column Generation (CG) modeling and solution, where segment pcycle candidates are dynamically generated during the optimization process. To ensure full node protection in the context of link p-cycles, we propose an efficient protection scheme, called node p-cycles, and develop a scalable optimization design model. It is shown that, depending on the network topology, node p-cycles sometimes outperform path p-cycles in iii terms of capacity efficiency. Also, an enhanced segment p-cycle scheme is proposed, entitled segment Np-cycles, for full link and node protection. Again, the CG-based optimization models are developed for the design of segment Np-cycles. Two objectives are considered, minimizing the spare capacity usage and minimizing the CAPEX cost. It is shown that segment Np-cycles can ensure full node protection with marginal extra cost in comparison with segment p-cycles for link protection. Segment Np-cycles provide faster recovery speed than path p-cycles although they are slightly more costly than path p-cycles. Furthermore, we propose the shortcut p-cycle scheme, i.e., p-cycles free of loop backs for full node and link protection, in addition to shortcuts in the protection paths. A CG-based optimization model for the design of shortcut p-cycles is formulated as well. It is shown that, for full node protection, shortcut p-cycles have advantages over path p-cycles with respect to capacity efficiency and recovery speed. We have studied a whole sequence of protection schemes from link p-cycles to path p-cycles, and concluded that the best compromise is the segment Np-cycle scheme for full node protection with respect to capacity efficiency and recovery time. Therefore, this thesis offers to network operators several interesting alternatives to path p-cycles in the design of survivable WDM mesh networks against any single link/node failures
    • …
    corecore