M. de Leenheer, Chris Develder, J. Vermeir, J. Buysse, F. De Turck, B. Dhoedt, P. Demeester
{"title":"Performance analysis of a hybrid optical switch","authors":"M. de Leenheer, Chris Develder, J. Vermeir, J. Buysse, F. De Turck, B. Dhoedt, P. Demeester","doi":"10.1109/ONDM.2008.4578401","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578401","url":null,"abstract":"To cope with ever-increasing traffic demands in transport networks, all-optical switching is currently perceived as a solution to remove bottlenecks imposed by O/E/O conversions during data transfer. The successful realization of this concept is in large part dependent on the optical switch, which must support a wide range of traffic patterns, while remaining feasible to build both in an economical and practical sense. In this paper, we show a generic design for a hybrid optical switch composed of both slow and fast switching fabrics, and present a performance analysis to provide deeper insight in its behaviour. To this end, we propose and evaluate scheduling algorithms required at the edge of the network to map traffic on the different portions of the core switch, and present a simulation analysis covering a wide range of traffic parameters and switch design choices. These results show the effectiveness of the hybrid switch in catering for short-lived circuits (bursts) by only a limited amount of costly high-speed switching components.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127349887","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":"Capacity and availability comparison of OMS protection schemes in ASON/GMPLS mesh networks","authors":"L. Velasco, S. Spadaro, J. Comellas, G. Junyent","doi":"10.1109/ONDM.2008.4578423","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578423","url":null,"abstract":"Link protection schemes provide high lightpath availability with very limited amount of signaling. When these protection schemes are applied over mesh networks with p-cycles it is also possible to reach service recovery within 50 ms after failure detection. In this paper we compare dedicated and shared link protection schemes over mesh-based ASON/GMPLS networks with defined p-cycles. The comparison is performed in terms of traffic capacity and lightpath availability. An analytical model to calculate the lightpaths availability is also discussed.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187585","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}
M. Gunkel, M. Schneiders, S. Vorbeck, W. Weiershausen, R. Leppla, F. Rumpf, R. Herber, Volker Fürst, Markus Rodenfels
{"title":"Aggregation networks: Cost comparison of WDM ring vs. double star topology","authors":"M. Gunkel, M. Schneiders, S. Vorbeck, W. Weiershausen, R. Leppla, F. Rumpf, R. Herber, Volker Fürst, Markus Rodenfels","doi":"10.1109/ONDM.2008.4578398","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578398","url":null,"abstract":"Due to the increasing demand for higher transmission capacity, originated from upcoming Triple-Play services, network operators are forced to increase the transmission capacity in the backbone and aggregation networks and drive down the costs per bit/s. Many concepts have been presented, optimizing backbone network and increasing the network capacity by introducing higher data rates or channel count. In this paper we focus on aggregation network architectures investigating appropriate architectures for the aggregation of broadband services for an incumbent European network operator. These architectures have to be cost effective and ensure high service availability. These requirements can be met by either aggregating via star topology, using several stages of Ethernet aggregation nodes, by a ring topology using cost effective optical add/drop multiplexers (OADM), or furthermore a mixture of star and ring topologies. The right choice depends on the traffic load, the traffic forecast, distribution of the traffic matrix and underlying fiber graph.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052270","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":"Regular reconfiguration of light-trees in multilayer optical networks","authors":"M. Perényi, P. Soproni, T. Cinkler, D. Larrabeiti","doi":"10.1109/ONDM.2008.4578411","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578411","url":null,"abstract":"In this paper we study dynamically changing multicast trees (light-trees) in double-layer optical networks. In this scenario, the continuous changing of multicast endpoints causes the degradation of the tree. Therefore a huge amount of network resources can be spared by regular reconfiguration. The benefit of reconfiguration is investigated for different routing algorithms and reconfiguration periods.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158713","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}
R. Muoz, R. Martínez, R. Casellas, R. Morro, C. Cavazzoni, S. Pizzaja, M. Jaeger, H. Foisel, J. Jiminez, C. Garcia, H. Dentler
{"title":"Experimental demonstration of ASON-GMPLS signaling interworking in the NOBEL2 multi-domain multi-layer control plane emulator","authors":"R. Muoz, R. Martínez, R. Casellas, R. Morro, C. Cavazzoni, S. Pizzaja, M. Jaeger, H. Foisel, J. Jiminez, C. Garcia, H. Dentler","doi":"10.1109/ONDM.2008.4578415","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578415","url":null,"abstract":"Both the OIF and IETF inter-domain interfaces for control plane enabled networks are based on GMPLS protocols. OIF interfaces include ITU-T/ASON specic extensions, resulting in interoperability issues. Moreover, the connection services considered by the OIF are focused on SONET/SDH, OTN (i.e., G.709)and Ethernet, but do not consider lambda services for all-optical transport networks (i.e., without O/E/O conversion) as supported by GMPLS. Previous interoperability experiences are based on implementing an ASON-GMPLS gateway at the edge nodes in order to have the same inter-domain interface between domain edges. Regarding to the LSC switching, it is addressed introducing proprietary extension to OIF interfaces allowing to request Lambda services. This paper presents a protocol-unaware solution for enabling seamless interworking based on a centralized ASON-GMPLS proxy transparent for domain edges. Experimental demonstration has been performed in the integrated NOBEL2 Pan-European control plane emulator.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116549814","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":"Availability and cost estimation of secured FTTH architectures","authors":"I. B. Heard","doi":"10.1109/ONDM.2008.4578390","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578390","url":null,"abstract":"In this paper are presented the availability and the relative deployment costs of secured and non secured GPON architectures. The perimeter considered ranges from the OLT shelf to the ONT. Unavailability and failure frequency of tree and bus architectures were reported for three distinct deployment scenarios. The same calculations were performed for four secured architectures based on tree and bus architectures. The relative deployment cost of the secured architectures compared to the tree architecture has been estimated. This study reveals that the tree and bus architectures have, with the input parameters considered in this study, an unavailability of about 1 hour. Unavailability falls below 5 min/year for a doubling of the costs in case of complete redundancy of the architecture. Comparatively to the tree architecture, a decrease of 9 min/year is acquired with an extra cost of about 10% in case the most shared part of the optical distribution network is protected against single fiber failure. For the four investigated secured achitectures, the relative cost extends from 2.3 to 1.1 with respect to the tree architecture.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728292","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}
T. El-Gorashi, B. Pranggono, R. Mehmood, J. Elmirghani
{"title":"A data Mirroring technique for SANs in a Metro WDM sectioned ring","authors":"T. El-Gorashi, B. Pranggono, R. Mehmood, J. Elmirghani","doi":"10.1109/ONDM.2008.4578420","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578420","url":null,"abstract":"This paper introduces a new data mirroring technique for storage area networks (SANs) in a metropolitan area wavelength division multiplexing (WDM) sectioned ring scenario. Performance is evaluated through simulation of a network with 16 nodes, 4 wavelengths, 1 Gb/s access node rate and 5 Gb/s SAN node rate under different asymmetries of both Poisson and self-similar traffic. Results of average node throughput, queuing delay and transmission buffer packet dropping probability are presented and analyzed. A modified version of the MAC protocol that improves performance in term of mirroring time and bandwidth utilization is introduced and evaluated.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128916884","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}
M. Rodelgo-Lacruz, C. López-Bravo, F. González-Castaño
{"title":"Guaranteeing packet order in Load Balanced distributed Schedulers for WASPENT optical packet switches","authors":"M. Rodelgo-Lacruz, C. López-Bravo, F. González-Castaño","doi":"10.1109/ONDM.2008.4578391","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578391","url":null,"abstract":"In [5] we proposed the load balanced WASPNET scheduler (LBWS), a novel scheduling approach for WASPNET optical packet switching (OPS) nodes. Unlike the original WASPNET description, LBWS is fully distributed and its computational cost is independent of switch size. Since it predicts packet delays at packet ingress based on a deterministic evolution of the switch configuration, it is not necessary to emulate RAM memories. However, LBWS does not maintain packet sequence. In this paper we present the LBWS algorithm with packet ordering (OLBWS), the first proposal to prevent mis-sequencing in a LBWS scheduler. We show that, despite the simplicity of the algorithm, a reasonable throughput can be achieved.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115889792","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":"Assessment and performance evaluation of PCE-based inter-layer traffic engineering","authors":"S. Gunreben, F. Rambach","doi":"10.1109/ONDM.2008.4578399","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578399","url":null,"abstract":"Multi-layer (ML) and multi-domain networks require path computation elements (PCE) for constraint-based path calculation. In this paper we introduce and evaluate qualitatively as well as quantitatively the PCE scenarios newly proposed by the IETF for PCE-based inter-layer traffic engineering. Requirements on additional communication, on hardware and on optimality of path computation serve as the qualitative metrics in our comparison. The path setup delay is derived analytically and serves as the quantitative metric. We derive the results using simulations on the ML German reference network with 17 nodes and back-up our results by two different ML TE routing algorithms. We show that one single ML PCE performs best in the overall qualitatively and quantitatively comparison.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116645337","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":"Solving large size instances of the RWA problem using graph partitioning","authors":"Lucile Belgacem, Nicolas Puech","doi":"10.1109/ONDM.2008.4578389","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578389","url":null,"abstract":"In this paper, we propose a new heuristic to solve large instances of the Routing and Wavelength Assignment problem (RWA). First, the initial instance is split into several smaller instances that are optimally solved using the ILP formulation of the problem. This decomposition is obtained by partitioning the set of edges of the network and is such that the different instances can be solved independently. Then the local solutions are combined in order to obtain a feasible solution of the initial instance. Herein the method is used to solve the Static Lightpath Establishment problem (SLE), but can be easily applied to any RWA problem. We validate the proposed method on a real network and on large random instances. The obtained results are compared with the optimal ones or with those of a sequential algorithm.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141709","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}