OptiComm: Optical Networking and Communications Conference最新文献_第6页

Interdomain routing in optical networks 光网络中的域间路由

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436052

M. Francisco, Stephen Simpson, Lambros Pezoulas, Changcheng Huang, I. Lambadaris, William St-Arnaud

引用次数: 14

Reconfigurability of single-hub WDM ring networks 单中心WDM环网的可重构性

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436064

Kayi Lee, K. Siu

引用次数: 10

Traffic grooming for survivable WDM mesh networks 可生存WDM网状网络的流量疏导

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436065

S. Thiagarajan, Arun Kumar Somani

{"title":"Traffic grooming for survivable WDM mesh networks","authors":"S. Thiagarajan, Arun Kumar Somani","doi":"10.1117/12.436065","DOIUrl":"https://doi.org/10.1117/12.436065","url":null,"abstract":"This paper addresses the problem of dynamically establishing dependable low-rate traffic stream connections in WDM mesh networks with traffic grooming capabilities. To establish a dependable connection, we set up link-disjoint primary and backup traffic stream paths between the source and destination and use backup multiplexing to reduce the overhead of backup traffic streams. We present a dynamic algorithm to obtain the optimal spare capacity on a wavelength on a link when a number of backup traffic streams are multiplexed onto it. We propose two schemes for grooming traffic streams onto wavelengths: Mixed Primary-Backup Grooming Policy (MGP) and Segregated Primary-Backup Grooming Policy (SGP). We illustrate how these schemes can be applied in a WDM mesh network scenario along with a routing and wavelength assignment algorithm. We conduct simulation experiments to evaluate the effectiveness of the proposed schemes on different network topologies, using different routing and wavelength assignment methods. The effect of change in granularity and change in the number of alternate paths on the grooming policies are also presented. From the simulation results, it is inferred that SGP is useful in network topologies, such as mesh-torus, characterized by good connectivity and a good amount of traffic switching and mixing at the nodes. On the other hand, MGP is useful in network topologies, such as a ring, characterized by low connectivity and high load correlation.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121960066","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}

引用次数: 93

Some studies on the logical topology design of large multi-hop optical networks 大型多跳光网络逻辑拓扑设计的一些研究

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436062

A. Haque, Y. Aneja, S. Bandyopadhyay, A. Jaekel, A. Sengupta

{"title":"Some studies on the logical topology design of large multi-hop optical networks","authors":"A. Haque, Y. Aneja, S. Bandyopadhyay, A. Jaekel, A. Sengupta","doi":"10.1117/12.436062","DOIUrl":"https://doi.org/10.1117/12.436062","url":null,"abstract":"Existing approaches for logical topology design and routing for multi-hop optical networks become intractable for large networks. One approach is to treat the logical topology design problem separately from the routing problem which can be solved as a LP problem. The straightforward formulation of the LP problem has been reported but this is also feasible only for relatively smaller networks since the basis size for the simplex method is O(n(superscript 3)) where n is the number of nodes in the network. In this paper, by exploiting the special structure of the routing problem, we present an efficient column generation scheme embedded into the revised simplex method. This approach makes it feasible to handle networks with relatively large number of nodes. To study the approach experimentally we have used a number of traffic based heuristics for generating the logical topologies. These include a variation of the well known HLDA heuristic and two simple traffic based heuristics to generate logical topologies based on regular graphs. Many researchers feel that regular graphs are not well suited for wide area optical networks. The interesting result is that logical topologies based on regular graphs perform quite well compared to others. This suggests that it is useful to consider regular graphs as possible topologies for wide area networks and should be included as potential candidates for large wide area networks.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355281","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}

引用次数: 7

Blocking performance of tree establishment in time-space switched optical networks 时空交换光网络中树形建立的阻塞性能

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436057

R. Srinivasan, Arun Kumar Somani

引用次数: 2

Effective wavelength assignment algorithms in a wavelength-routed network 波长路由网络中的有效波长分配算法

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436059

Yang Qin, C. Siew, Bo Li

{"title":"Effective wavelength assignment algorithms in a wavelength-routed network","authors":"Yang Qin, C. Siew, Bo Li","doi":"10.1117/12.436059","DOIUrl":"https://doi.org/10.1117/12.436059","url":null,"abstract":"This paper addresses the problem of wavelength assignment and wavelength routing in a wide-area optical network, where Wavelength Division Multiplexing (WDM) technology has emerged as the transmission and switching choice. One of the major design issues in this network is the assignment of the limited number of wavelengths among network stations so that higher aggregate capacity can be achieved. The problem of wavelength assignment and routing is proved to be NP-hard problem. The present literature on this topic is a large repertoire of heuristics that produce good solutions in a reasonable amount of time. These heuristic, however, have restricted applicability in a practical environment because they have a number of fundamental problems including high time complexity, lack of scalability with respect to optimal solutions. In this paper, we propose genetic based algorithm with an objective to simultaneously meet the goals of height performance and fast running time. In addition, we propose to apply the Greedy Random Adaptive Search Procedure (GRASP) to solve the wavelength assignment problem. We demonstrate that our proposed algorithms can achieve lower blocking probability while taking considerably less running time when compared to one of the best known heuristic wavelength assignment algorithms proposed by Zhang and Acampora, in which close to optimal solution can be obtained.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128348176","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}

引用次数: 1

Network applications of packet-optical layer interworking 分组光层互连的网络应用

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436067

J. Fitchett, H. Mouftah, Billy Wu, J. Gruber

引用次数: 1

Designing a survivable IP-over-WDM network 设计一个可生存的IP-over-WDM网络

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436049

C. Assi, Y. Ye, A. Shami, I. Habib, Mohamed A. Ali, S. Dixit

{"title":"Designing a survivable IP-over-WDM network","authors":"C. Assi, Y. Ye, A. Shami, I. Habib, Mohamed A. Ali, S. Dixit","doi":"10.1117/12.436049","DOIUrl":"https://doi.org/10.1117/12.436049","url":null,"abstract":"In this paper we investigate the problem of designing a survivable IP over WDM networks. We present a novel integrated protection scheme to dynamically allocate restorable bandwidth guaranteed path. Restoration implies that a flow of data is successfully routed if both an active path and another alternate link-disjoint path are setup at the same time. The new scheme takes advantage of the recent development in MPLS/MP(lambda) S to provide integrated end-to-end survivability, and incorporates network state information (such as the cost information in physical links, the bandwidth usage on each lightpath, and intermediate router forwarding speed) into protection path allocation. We design a survivable logical topology on top of the underlying physical connectivity that connects IP routers. Unlike the conventional approach for designing a static logical topology where the traffic demand is known a priori, we dynamically construct the logical connections between IP routers. This approach leads to a new QoS routing problem where it is necessary to dynamically route both an active path and a backup path in order to satisfy a request to set-up a restorable bandwidth guaranteed paths. Simultaneously establishing backup paths ensures fast restoration by eliminating path computation and path set-up signaling delays.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733224","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}

引用次数: 4

New distributed control scheme for real-time wavelength-routed optical networks 实时波长路由光网络分布式控制新方案

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436051

A. Shami, Y. Ye, C. Assi, Mohamed A. Ali, S. Dixit

引用次数: 0

Heuristic routing algorithm for shared protection in connection-oriented networks 面向连接网络中共享保护的启发式路由算法

OptiComm: Optical Networking and Communications Conference Pub Date : 2001-08-09 DOI: 10.1117/12.436054

Shengli Yuan, J. Jue

引用次数: 10