Hua Zhang, Jie Zhang, Lei Wang, Tao Liu, Wu Jia, Zhicheng Li, Meng Qiu, W. Gu
{"title":"Dynamic end-to-end optimization for quality of transmission in reconfigurable transparent optical networks","authors":"Hua Zhang, Jie Zhang, Lei Wang, Tao Liu, Wu Jia, Zhicheng Li, Meng Qiu, W. Gu","doi":"10.1364/JON.7.000573","DOIUrl":"https://doi.org/10.1364/JON.7.000573","url":null,"abstract":"An approach for dynamically optimizing end-to-end quality of transmission (QoT) has been proposed. In this study, the function of the standard control plane of the automatically switched optical network is enhanced to perceive transmission impairments and control tunable physical impairment compensators in the physical layer. The QoT optimization model and algorithm are also developed to make a set of joint compensation budgets, and the compensator performance is adjusted dynamically according to these budgets. Thus end-to-end QoT optimization can be realized on the fly. Simulation results indicate that dynamic end-to-end QoT optimization can implement smooth distribution of signal quality and acceptable transmission performance. Simultaneously, compared with the case of separate compensation by using individual adaptive impairment compensators along the route, end-to-end QoT optimization can also avoid unnecessary compensator adjustments and can lower operating expenditures.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"573-584"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000573","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal multilayer grooming-oriented design for inter-ring traffic protection in DNI multiring WDM networks","authors":"L. Resendo, M. Ribeiro, J. Pires","doi":"10.1364/JON.7.000533","DOIUrl":"https://doi.org/10.1364/JON.7.000533","url":null,"abstract":"We propose optimal approaches to integrating traffic grooming and the protection strategies of virtual ring (VR) and drop and continue (DC) in dual-node interconnection (DNI) multiring translucent networks. A multilayer design matches the optimal solutions from the electronic layer to the physical topology available using a particular DNI-routing-and-wavelength-assignment formulation. Study cases with 20 different traffic matrices are performed over translucent and opaque networks with 13 nodes. Despite the excessive traffic duplication of the VR, there is only a minor distinction from the DC performance, even under heavy intra-ring traffic, thanks to an optimally chosen intra-ring lightpath in translucent networks.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"533-549"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000533","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66589030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reconfigurable encoder-decoder structure for 2D OCDMA systems","authors":"M. Aljada, K. Alameh","doi":"10.1364/JON.7.000635","DOIUrl":"https://doi.org/10.1364/JON.7.000635","url":null,"abstract":"We propose and experimentally demonstrate a 2.5Gbits/s reconfigurable encoder-decoder structure that can be used for two-dimensional (time-wavelength) optical code-division multiple access (OCDMA) systems. Each encoder and decoder is constructed using a single opto-very-large-scale-integrated (VLSI) processor for encoding N users, thus eliminating the need for optical switching between encoders. The opto-VLSI processor synthesizes wavelength codewords through computer-generated digital phase holograms, which can switch the wavelength through different true-time-delay paths. The encoded signal can be successfully retrieved at the decoder side only when the digital phase holograms of the encoder and the decoder are matched. The system performance is measured in terms of the generated autocorrelation and cross-correlation functions as well as eye diagrams.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"635-644"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000635","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66589336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Impact of routing and wavelength selection strategies on GMPLS-controlled distributed restoration","authors":"N. Sambo, I. Cerutti, A. Giorgetti, P. Castoldi","doi":"10.1364/JON.7.000388","DOIUrl":"https://doi.org/10.1364/JON.7.000388","url":null,"abstract":"The restorability problem in wavelength-routed networks without wavelength converters is investigated. A distributed control plane based on the generalized multiprotocol label switching (GMPLS) suite is considered for disseminating link-state information and reserving network resources. Different routing and wavelength selection strategies are proposed and a detailed performance analysis is carried out during restoration. Simulation results evaluate the blocking probability due to both lack of available resources (i.e., forward blocking) and resource contentions (i.e., backward blocking). Performance comparison provides some insightful suggestions to be applied to GMPLS-controlled wavelength-routed networks without wavelength converters. First, it is recommended to perform routing and wavelength selection separately at the lightpath source and destination, respectively. Second, routing can be computed on link-state information advertised during provisioning, without the need of flooding link-state information during restoration. In fact, during restoration, the resource contention among concurrent signaling instances is the dominant cause of blocking (i.e., backward blocking overcomes forward blocking). For this reason, intelligent routing and wavelength selection strategies aiming at avoiding or limiting resource contentions can help to improve restorability. In particular, among those strategies, the proposed wavelength selection has a better ability to reduce resource contentions than the routing strategies.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"388-399"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000388","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multidomain shared protection with limited information via MPP and p-cycles","authors":"J. Szigeti, L. Gyarmati, T. Cinkler","doi":"10.1364/JON.7.000400","DOIUrl":"https://doi.org/10.1364/JON.7.000400","url":null,"abstract":"The Internet consists of a collection of more than 21,000 domains called autonomous systems operated mostly under different authorities (operators-providers) that, although they cooperate over different geographical areas, compete in a country or other area. Recently, the path computation element concept has been proposed to generalized multiprotocol label switching controlled optical borne networks to make routing decisions for interdomain connections taking into account traffic engineering, quality of service, and resilience considerations. Still the question of protection shareability emerges. For dedicated protection it is enough to know the topology of the network to be able to calculate disjoint paths. However, to reduce network resource usage by sharing of protection resources (e.g., end-to-end shared protection) it is also mandatory to know the exact working and protection path pairs for all the demands. This can be checked within a domain where not only the full topology and link-state information is flooded but also the working and protection paths are known for each connection; however; over the domain boundaries for security and scalability reasons no such information is being spread. We propose using two techniques that do not require flooding the information on working and protection paths while still allowing the sharing of resources. These two techniques are the multidomain p-cycles and the multidomain multipath routing with protection. After explaining the principles of these methods we evaluate the trade-off between the resource requirement and availability of these techniques by simulations.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"400-409"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000400","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Upstream access and local area networking in passive optical networks with a single reflective semiconductor optical amplifier","authors":"N. Nadarajah, A. Nirmalathas","doi":"10.1364/JON.7.000513","DOIUrl":"https://doi.org/10.1364/JON.7.000513","url":null,"abstract":"We propose and experimentally demonstrate three novel schemes for upstream access and local area network emulation among customers in a passive optical network using a single reflective semiconductor optical amplifier (RSOA) placed at the customer premises. The first scheme uses the broadband amplified spontaneous emission spectra of the RSOA for the transport of the local area network traffic among the customers, while the second scheme uses the optical carriers delivered to each optical network unit from the central office for the wavelength seeding of the RSOA to facilitate the transport of the local area network traffic. The third scheme describes the self-seeding process of the RSOA with the use of fiber Bragg gratings placed at the optical network unit to facilitate the upstream access and local area network traffic. These schemes for optical layer local area networking among the customers are experimentally demonstrated with more than 2Gbits/s downstream data, 1Gbit/s upstream access traffic, and 1Gbit/s local area network traffic. Moreover, the results of the experiments of all three schemes are compared further and discussed in terms of bandwidth of the local area network traffic, seeding optical power into the reflective semiconductor optical amplifier, and power budget.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"513-532"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000513","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Experimental evaluation of GMPLS enhanced routing for differentiated survivability in all-optical networks","authors":"R. Martínez, R. Casellas, R. Muñoz","doi":"10.1364/JON.7.000496","DOIUrl":"https://doi.org/10.1364/JON.7.000496","url":null,"abstract":"Future intelligent optical networks (IONs) are devised to support a wide variety of clients, each having their own reliability requirements, such as availability. These networks thus need to support differentiated recovery schemes fulfilling those requirements while achieving efficient network performance (e.g., resource usage). We specifically focus on dedicated path protection (DPP) and shared path protection (SPP) recovery within generalized multiprotocol label switching (GMPLS) all-optical networks. In this context, the standard GMPLS open shortest path first-traffic engineering (OSPF-TE) protocol does not convey the required routing information in order to achieve a desirable network performance. The novelty of this work is twofold. First, to present enhanced GMPLS routing approaches for both SPP and DPP recovery schemes that, besides maximizing resource usage, also address connection blocking mostly due to the wavelength continuity constraint. Second, to evaluate these implemented schemes in a real experimental ION named ADRENALINE testbed. A detailed description of the routing approaches along with their required extensions to current GMPLS OSPF-TE is provided. The experimental performance comparison is conducted considering three figures of merit: connection blocking probability, restoration overbuild, and connection setup delay. The evaluation of the aforementioned schemes may help network operators to select a survivability scheme for a given client.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"496-512"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000496","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lightpath routing for maximum reliability in optical mesh networks","authors":"Shengli Yuan, Saket Varma, J. Jue","doi":"10.1364/JON.7.000449","DOIUrl":"https://doi.org/10.1364/JON.7.000449","url":null,"abstract":"We consider the problem of maximizing the reliability of connections in optical mesh networks against simultaneous failures of multiple fiber links that belong to a shared-risk link group (SRLG). We study the single-lightpath, parallel-lightpaths, and lightpath protection problems for connections between two end nodes, as well as the lightpath-ring problems for connections of three or more end nodes. We first study the special problems where all SRLGs have the same failure probability. In these problems, every SRLG is represented by a distinct color and every fiber link is associated with one or more colors, depending on the SRLGs to which the link belongs. We formulate the problems as minimum-color lightpath problems. By minimizing the number of colors on the lightpaths, the failure probability of the lightpaths can be minimized. We prove the problems to be NP-hard. We then extend the results to the general problems where the failure probabilities of the SRLGs may differ. Heuristic algorithms are proposed for larger instances of the problems, and the heuristics are evaluated through simulations.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"449-466"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000449","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Window-based burst assembly scheme for TCP traffic over OBS","authors":"K. Ramantas, K. Vlachos, Ó. D. Dios, C. Raffaelli","doi":"10.1364/JON.7.000487","DOIUrl":"https://doi.org/10.1364/JON.7.000487","url":null,"abstract":"The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"487-495"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000487","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved reliability of free-space optical mesh networks through topology design","authors":"Ziping Hu, P. Verma, J. Sluss","doi":"10.1364/JON.7.000436","DOIUrl":"https://doi.org/10.1364/JON.7.000436","url":null,"abstract":"We propose a method for the topology design of free-space optical (FSO) mesh networks in order to enhance network reliability under a defined degree constraint of each FSO node. The methodology presented enlarges the minimum angle between adjacent links at each node. Simulation results show that, compared to other methods, the proposed algorithm not only provides a higher connectivity and lower delay for FSO networks but also makes the constructed FSO networks more tolerant in a dynamic environment.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"436-448"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000436","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66588959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}