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

Performance analysis of WDM optical packet switches with a hybrid buffering architecture 混合缓冲结构的WDM光分组交换机性能分析

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533538

Lin Li, S. Scott, J. Deogun

引用次数: 11

Study on integrated routing in IP-over-WDM networks IP-over-WDM网络中集成路由的研究

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533815

Tong Ye, Qingji Zeng, Zhizhong Zhang

{"title":"Study on integrated routing in IP-over-WDM networks","authors":"Tong Ye, Qingji Zeng, Zhizhong Zhang","doi":"10.1117/12.533815","DOIUrl":"https://doi.org/10.1117/12.533815","url":null,"abstract":"The problem of integrated routing in multifiber IP over WDM networks is studied in this paper. To solve this problem, a layered-graph is constructed and an algorithm, called integrated cost-based shortest path (ICSP) algorithm, is then proposed. ICSP can not only balance the traffic uniformly but also make a dynamic tradeoff between all the links in the layered-graph. A parameter rl is introduced to characterize the resource richness of an IP over WDM Network. Simulation results show that ICSP outperforms other algorithms significantly in terms of blocking probability in all the cases we studied, and the performances of other algorithms are affected by rl greatly. Because a multifiber network can be functionally equivalent to a single fiber network with limited wavelength conversion (WC), we make the first known attempt to investigate the impact of WC on dynamic integrated routing by studying the multifiber networks. Results show that the effect of WC depends on the granularities of label switched path (LSP) requests. If the granularity of each request is large, WC will improve the network performance; if the granularity of each request is small, WC will worsen the performance.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123752260","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}

引用次数: 5

Efficient mapping algorithms for survivable GMPLS networks 可生存GMPLS网络的有效映射算法

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533324

P. Laborczi

引用次数: 1

Amplifier placement in transparent DWDM ring networks 透明DWDM环形网络中的放大器放置

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533323

Tao Deng, S. Subramaniam

引用次数: 3

Policy-based shared path protection for dual link failures 双链路故障时基于策略的共享路径保护

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533302

Dahai Xu, Yizhi Xiong, C. Qiao

{"title":"Policy-based shared path protection for dual link failures","authors":"Dahai Xu, Yizhi Xiong, C. Qiao","doi":"10.1117/12.533302","DOIUrl":"https://doi.org/10.1117/12.533302","url":null,"abstract":"In this paper, we study novel shared path protection schemes that use different policies to deal with different dual-link failure scenarios in order to minimize total bandwidth consumption (or spare capacity allocation). Our work addresses two open problems. The first is minimum total bandwidth allocation under deterministic routing (i.e., when three link-disjoint paths, one active path and two backup paths are pre-selected for each connection). For the dual-link failure case, this problem is much more complex than a similar problem for the single-link failure case because one needs to decide which one of the two backup paths for a connection is preferred to reroute the traffic along its active path affected by a single-link (or a simultaneously dual-link) failure. We propose a new concept of policy, which specifies the preferred backup path to use, and study different policies (including no policy) which will result in different performances in terms of amount of bandwidth needed and different implementation complexity. The second open problem we address in this paper is to minimize additional bandwidth to be allocated for each connection under several different policies and adaptive routing in on-line setting. In this case, the solution entails how to find optimal paths for each connection. From our simulation results, we find that shared path protection with a policy can considerably reduce bandwidth consumption compared with shared path protection without a policy.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131983066","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}

引用次数: 6

Preplanned recovery with redundant multicast trees in optical networks 基于冗余组播树的光网络预计划恢复

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533829

Lan Kong, J. Deogun, Maher Ali

引用次数: 1

Signal-quality consideration for dynamic connection provisioning in all-optical wavelength-routed networks 全光波长路由网络中动态连接分配的信号质量考虑

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533316

Yurong Huang, Wushao Wen, J. Heritage, B. Mukherjee

{"title":"Signal-quality consideration for dynamic connection provisioning in all-optical wavelength-routed networks","authors":"Yurong Huang, Wushao Wen, J. Heritage, B. Mukherjee","doi":"10.1117/12.533316","DOIUrl":"https://doi.org/10.1117/12.533316","url":null,"abstract":"We investigate new connection-provisioning algorithms to efficiently provide signal-quality-guaranteed connections in an all-optical WDM mesh network. In the all-optical network, signal degradations incurred by non-ideal transmission medium accumulate along a lightpath. When the signal degradation reaches a certain level, the connection is not usable and is blocked due to transmission impairments in the physical layer. To ensure high service quality of provisioned connections, it is essential to develop intelligent routing and wavelength assignment (RWA) algorithms which can combat the effects of impairments when setting up a connection. For this purpose, we propose two impairment-aware RWA algorithms, namely impairment-aware best-path (IABP) algorithm and impairment-aware first-fit (IAFF) algorithm. The optical signal-to-noise raito (OSNR) requirement and polarization mode dispersion (PMD) effect are used as signal-quality constraints to avoid setting up a connection with unacceptable quality due to the effects of transmission impairments. With the signal-quality consideration, as compared to algorithms that are not impairment aware in a realistic optical network, our proposed impairment-aware algorithms efficiently provide signal-quality-guaranteed connection while significantly reducing connection-blocking probability, better utilizing network resources, and having a reasonable computational requirement. Also, the effect of channel bit rate is studied in this paper.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131308312","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}

引用次数: 25

On optimal traffic grooming in elemental network topologies 基本网络拓扑中的最优流量疏导

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533162

R. Dutta, Shu Huang, G. Rouskas

{"title":"On optimal traffic grooming in elemental network topologies","authors":"R. Dutta, Shu Huang, G. Rouskas","doi":"10.1117/12.533162","DOIUrl":"https://doi.org/10.1117/12.533162","url":null,"abstract":"We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design problem, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Our contribution is two-fold. In the first part of the paper we settle the complexity of traffic grooming in path and star networks by proving that a number of variants of the problem are computationally hard. Since routing and wavelength assignment in these two topologies is trivial, these results demonstrate that traffic grooming is itself an inherently difficult problem. Our results have implications for ring and other more general topologies, which we explore. In the second part, we design practical grooming algorithms with provable properties. Specifically, for all three topologies, we obtain a series of lower and upper bounds which are increasingly tighter but have considerably higher computational requirements; the series of upper bounds form an algorithm for the traffic grooming problem with strong performance guarantees. We also present corresponding heuristics with good performance. Our work is a first step towards a formal and systematic approach to the grooming problem in general topologies that builds upon results and algorithms for more elementary networks.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115380042","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}

引用次数: 28

Delay-line buffer modeling for asynchronous optical networks 异步光网络的延迟线缓冲器建模

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533547

R. C. Almeida, J. U. Pelegrini, H. Waldman

引用次数: 11

An analysis of path recovery schemes in GMPLS optical networks with various levels of pre-provisioning GMPLS光网络中不同预配置级别的路径恢复方案分析

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-01 DOI: 10.1117/12.533334

D. Griffith, R. Rouil, Stephan Klink, K. Sriram

引用次数: 5