OptiComm: Optical Networking and Communications Conference最新文献

{"title":"Overspill routing in optical networks: a new architecture for future-proof IP-over-WDM networks","authors":"E. Van Breusegem, J. Cheyns, D. Colle, M. Pickavet, P. Demeester","doi":"10.1117/12.533317","DOIUrl":"https://doi.org/10.1117/12.533317","url":null,"abstract":"Packet switched based network architectures exhibit a high degree of resource sharing and consequently make very efficient use of the available bandwidth. On the other hand, they experience a great amount of transit traffic in IP routers, increasing costs. Wavelength switched based concepts can reduce this transit traffic, but have limited resource sharing and consequently need more resources (wavelengths) to avoid losses. We present a new hybrid network architecture, Overspill Routing In Optical Networks (ORION), which combines the benefits of wavelength switched networks and packet switched networks. An example node hardware design and corresponding control architecture is presented. A case study quantifying the benefits of ORION when compared to three other network architectures is also discussed.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114390485","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":"Minimal-delay traffic grooming for WDM star networks","authors":"Hongsik Choi, Nikhil Garg, Hyeong-Ah Choi","doi":"10.1117/12.533184","DOIUrl":"https://doi.org/10.1117/12.533184","url":null,"abstract":"All-optical networks face the challenge of reducing slower opto-electronic conversions by managing assignment of traffic streams to wavelengths in an intelligent manner, while at the same time utilizing bandwidth resources to the maximum. This challenge becomes harder in networks closer to the end users that have insufficient data to saturate single wavelengths as well as traffic streams outnumbering the usable wavelengths, resulting in traffic grooming which requires costly traffic analysis at access nodes. We study the problem of traffic grooming that reduces the need to analyze traffic, for a class of network architecture most used by Metropolitan Area Networks; the star network. The problem being NP-complete, we provide an efficient twice-optimal-bound greedy heuristic for the same, that can be used to intelligently groom traffic at the LANs to reduce latency at the access nodes. Simulation results show that our greedy heuristic achieves a near-optimal solution.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128368301","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":"Analysis of single-hop traffic grooming in mesh WDM optical networks","authors":"C. Xin, C. Qiao, S. Dixit","doi":"10.1117/12.533301","DOIUrl":"https://doi.org/10.1117/12.533301","url":null,"abstract":"Traffic grooming is a significant task in internetworking between an optical wavelength-routed core network that supplies \"pipes\" at the wavelength-granularity, and the attached client (e.g., IP) networks that usually require connections of sub-wavelength granularity. The focus of this study is to develop a theoretical performance analysis model for online traffic grooming in mesh optical networks. This paper first briefly discusses the difficulty in applying the analytic models developed for circuit-switched networks (including wavelength-routed optical networks) to the traffic grooming problem. It then develops a link blocking model based on the continuous time Markov chain and queueing theory, and finally conducts end-to-end performance analysis based on the Erlang fixed-point approximation. The results obtained from the analytic model are shown to match well with numerical results obtained from simulations.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125929951","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":"CHEETAH: circuit-switched high-speed end-to-end transport architecture","authors":"M. Veeraraghavan, Xuan Zheng, Hyuk Lee, M. Gardner, Wu-chun Feng","doi":"10.1117/12.533340","DOIUrl":"https://doi.org/10.1117/12.533340","url":null,"abstract":"Leveraging the dominance of Ethernet in LANs and SONET/SDH in MANs and WANs, we propose a service called CHEETAH (Circuit-switched High-speed End-to-End Transport ArcHitecture). The service concept is to provide end hosts with high-speed, end-to-end circuit connectivity on a call-by-call shared basis, where a \"circuit\" consists of Ethernet segments at the ends that are mapped into Ethernet-over-SONET long-distance circuits. This paper focuses on the file-transfer application for such circuits. For this application, the CHEETAH service is proposed as an add-on to the primary Internet access service already in place for enterprise hosts. This allows an end host that is sending a file to first attempt setting up an end-to-end Ethernet/EoS circuit, and if rejected, fall back to the TCP/IP path. If the circuit setup is successful, the end host will enjoy a much shorter file-transfer delay than on the TCP/IP path. To determine the conditions under which an end host with access to the CHEETAH service should attempt circuit setup, we analyze mean file-transfer delays as a function of call blocking probability in the circuit-switched network, probability of packet loss in the IP network, round-trip times, link rates, and so on.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121367993","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":"A new analytical approach for the estimation of blocking probabilities in wavelength-routing networks","authors":"H. Waldman, Divanilson R. Campelo, R. C. Almeida","doi":"10.1117/12.533534","DOIUrl":"https://doi.org/10.1117/12.533534","url":null,"abstract":"The paper introduces a new analytical approach for estimating blocking probabilities in all-optical networks. The assumptions of the classical Lee approximation are discussed and their effects are evaluated. The paper proposes a better substitute for the independent link assumption. The new assumption takes all active paths, as well as all free links, as independent objects on the network topology. The new model is shown to generate estimates that fit exactly the blocking probabilities obtained through simulations on linear topologies using Poissonian, spatially homogeneous traffic. An extension to regular meshes is presented that is asymptotically good for very small and very large nodal degrees. Finally, the independent wavelength assumption is also evaluated for two different wavelength assignment algorithms.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132369166","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":"Wavelength converter and fiber delay-line sharing in WDM optical packet switches: dimensioning and performance issues","authors":"Zhizhong Zhang, Yunlin Zhang, Qingji Zeng, Jianxin Wang","doi":"10.1117/12.533327","DOIUrl":"https://doi.org/10.1117/12.533327","url":null,"abstract":"In this paper, two switch models -- MOD1, employs a set of nondegenerate fiber delay-lines (FDLs) shared among the input lines, and MOD2, employs a set of degenerate FDLs and tunable wavelength converters (TOWCs) shared among the input lines, are proposed to handle contention. We demonstrate that for a prefixed packet loss probability constraints, e.g., 10-6, and for nonbursty traffic, if the wavelengths per fiber is no less than 8, a very small number of FDLs is sufficient to obtain a reasonable packet loss probability for both models, i.e., without the need to use TOWCs for MOD2, used for MOD1 equals to those of the FDLs and TOWCs used for MOD2, MOD2 performs much better than MOD1 even if no TOWC is used. With the increase of the average burst length, the number of TOWCs needed by MOD2 needs to be increased so as to maintain a reasonable packet loss probability. However, even for the traffic with high degree of burstness, MOD2 is still a cost effective and robust solution.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121447839","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":"Multiserver switch scheduling for high speed optical switches","authors":"P. Golla, J. Blanton, G. Damm","doi":"10.1117/12.533529","DOIUrl":"https://doi.org/10.1117/12.533529","url":null,"abstract":"A switch matrix implemented as an optical crossbar using semiconductor optical amplifiers is able to accommodate extreme concentrations of data traffic. Due to the need to reduce optical guard band overhead it is beneficial to switch fixed size bursts of data cells on a time slot basis. The high capacity of the optical matrix supports multiple optical ports per burst card, and the implementation of multiple queue servers per burst card helps make better use of the multiplicity of ports. Problems associated with arbitrating multiple ports and multiple servers per burst card have been resolved by extending the operation of existing iterative, single server scheduling algorithms. The multiserver arbitration time will be in proportion to the number of servers -- corresponding to the channels of DWDM link -- unless a reconciliation stage is used after each iteration when an arbiter per server is used. The reconciliation stage sets the problem of broken data dependencies between server arbitrations in this case. Further, to address the time limitations for computing the scheduling solution, parallel arbiter implementations have been developed and tested against single arbiter designs. Again, the broken dependencies between iterations of an arbitration are addressed through the use of a grant reconciliation stage. The use of multiple queue servers per burst card also resolves some of the data loss problems related to polarized traffic. Simulations of the multiple server and parallel arbiter implementations have demonstrated their efficiency compared to previous implementations. Compounded to this problem is maintaining high throughput of the switch matrix while observing data transit time limits. This involves balancing two contradictory requirements; switch or line card efficiency and data transit times. To improve efficiency it is desirable to transmit only full packets. However, to prevent loss of data due to timeout it will be necessary to transmit some incomplete packets. We investigate three approaches -- thrifty, conservative, and greedy request policies. Using data content and age we demonstrate that unevenly distributed traffic can be handled better with multiserver switching matrices.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125312261","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":"Subnetwork partitioning and section restoration in translucent optical networks","authors":"Ezhan Karasan, M. Arisoylu","doi":"10.1117/12.533305","DOIUrl":"https://doi.org/10.1117/12.533305","url":null,"abstract":"We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We formulate the problem of designing restorable subnetworks in translucent networks as an Integer Linear Programming (ILP) problem, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations and it is 2-connected. A greedy heuristic algorithm for the same problem is also proposed for planar network topologies. We propose section restoration for translucent networks where failed connections are rerouted inside the subnetwork which contains the failed link. The network design problem of determining working and restoration capacities with section restoration is formulated as an ILP problem. Numerical results show that section restoration generates fiber costs which are close to those with the path restoration technique for the mesh topologies used in this study. It is also shown that the number of transponders with the translucent optical network is substantially reduced compared to opaque networks.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132753609","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":"A distributed signaling scheme for provisioning dynamic traffic in wavelength-routed networks","authors":"K. Lu, J. Jue, Gaoxi Xiao, I. Chlamtac, T. Ozugur","doi":"10.1117/12.533310","DOIUrl":"https://doi.org/10.1117/12.533310","url":null,"abstract":"Provisioning dynamic traffic is a major challenge in wavelength-routed networks. While the routes of connections are mainly determined by using global state information, different connections that share the same link may still compete for the same resources. These conflicts can cause significant blocking, a problem that becomes more serious as traffic becomes more dynamic and as the state information changes more frequently. Therefore, it is increasingly important to design appropriate signaling schemes to avoid blocking due to contention between different simultaneous connection requests. In this paper, we propose a new distributed signaling scheme, Intermediate-Node Initiated Reservation (IIR), for establishing dynamic lightpaths in wavelength-routed networks. In the framework of IIR, reservations may be initiated at any set of nodes along the path of a connection, and multiple wavelengths may be reserved. Two IIR implementations are designed for networks with no wavelength conversion and with sparse wavelength conversion. Extensive simulation results show that the IIR scheme outperforms the original schemes under various network and traffic conditions. Simulation results also show that the IIR scheme performs better in networks where number of wavelength per fiber is large, or in networks with sparse wavelength conversion.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125298180","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":"A hybrid protection-restoration mechanism for enhancing dual-failure restorability in optical mesh-restorable networks","authors":"M. Sivakumar, C. Maciocco, M. Mishra, K. Sivalingam","doi":"10.1117/12.533166","DOIUrl":"https://doi.org/10.1117/12.533166","url":null,"abstract":"In this paper, we investigate the problem of enhancing dual-failure restorability in path-protected mesh-restorable optical wavelength division multiplexed (WDM) networks. A key finding of recent studies that have demonstrated the need to survive simultaneous dual-link failures is that designs providing complete (i.e. 100%) protection from all dual-failures may need almost thrice the spare capacity compared to a system that protects against all single-link failures. However, it has also been shown that systems designed for 100% single-link failure protection can provide reasonable protection from dual-link failures. Thus, the motivation of this work is to develop a hybrid mechanism that provides maximum (close to 100%) dual-failure restorability with minimum additional spare capacity. The system architecture considered is a circuit-switched WDM network with dynamic arrival of sessions requests. We also consider sparse wavelength conversion, where only some nodes have converters. We propose an adaptive mechanism, which we term active protection, that builds upon a pro-active path protection to provide complete single-failure restorability and adds dynamic segment-based restoration. The objective is to optimize network survivability (and minimize spare capacity needs) with ragard to dual-link failures while maintaining complete single-failure restorability. The basic premise of the algorithm is to identify scenarios in the dual-link failure model that necessitate additional spare capacity and provide protection for those scenarios only. Our findings indicate that the proposed scheme achieves close to complete (100%) dual-failure restorability with only maximum of 3% wavelength-links needing two backups even at high loads. Moreover, at moderate to high loads, our scheme attains close to 16% improvement over the base model that provides complete single-failure restorability.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114372242","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}