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

Shared-risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: formulation and solution approaches 波长路由光网状网络中混合服务水平协议下的共享风险链路组(SRLG)多样化路径配置:制定和解决方法

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533306

Lu Shen, Xi Yang, B. Ramamurthy

{"title":"Shared-risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: formulation and solution approaches","authors":"Lu Shen, Xi Yang, B. Ramamurthy","doi":"10.1117/12.533306","DOIUrl":"https://doi.org/10.1117/12.533306","url":null,"abstract":"The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions. We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the static provisioning problem is formulated as a revenue maximization problem, whose objective is maximizing the total revenue value. When the network has sufficient resources, the problem becomes a capacity minimization problem with the objective of minimizing the number of used wavelength-links. We give integer linear programming (ILP) formulations for these problems. Because solving these ILP problems is extremely time consuming, we propose a tabu search heuristic to solve these problems within a reasonable time. Experimental results are presented to compare the solutions obtained by an ILP solver, the tabu search heuristic and a divide-and-conquer greedy heuristic.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"12 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":"122103248","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}

引用次数: 22

Grooming of multicast sessions in WDM ring networks WDM环网中组播会话的疏导

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533147

H. Madhyastha, N. Srinivas, G. Chowdhary, C. Murthy

{"title":"Grooming of multicast sessions in WDM ring networks","authors":"H. Madhyastha, N. Srinivas, G. Chowdhary, C. Murthy","doi":"10.1117/12.533147","DOIUrl":"https://doi.org/10.1117/12.533147","url":null,"abstract":"In this paper, we address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands. We consider this problem in the scenario of WDM ring networks. In order to support multicasting, individual nodes need to have the capability to duplicate traffic. We consider two different node architectures which perform the duplication in optical and electronic domain, respectively. As traffic duplication at the electronic level is much more expensive than the optical alternative, we study the problem of assigning routes and wavelengths to the multicast sessions so as to minimize electronic copying. The solution to this problem can be divided into three phases -- (1) routing of multicast sessions, (2) construction of circles by grouping non-overlapping arcs and (3) grouping these circles onto wavelengths. We propose a heuristic algorithm which implements the routing as well as circle construction phases simultaneously and then groups the circles. We present extensive simulation results to show that our approach leads to much lesser equipment cost than that obtained by routing each multicast session along its minimum spanning tree and then using the best known heuristic for circle construction.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"27 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":"114534877","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}

引用次数: 17

Matching fairness and performance by preventive traffic control in optical multiple access networks 基于预防流量控制的光多址网络公平性与性能匹配

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533832

N. Bouabdallah, L. Ciavaglia, E. Dotaro, N. Le‐Sauze

引用次数: 15

Dynamic bandwidth allocation algorithms in EPON: a simulation study EPON中动态带宽分配算法的仿真研究

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533543

D. Nikolova, B. Van Houdt, C. Blondia

引用次数: 21

Effect of ingress buffering on self-similarity of optical burst traffic 入口缓冲对光突发业务自相似性的影响

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533525

Rui Huang, G. Záruba

{"title":"Effect of ingress buffering on self-similarity of optical burst traffic","authors":"Rui Huang, G. Záruba","doi":"10.1117/12.533525","DOIUrl":"https://doi.org/10.1117/12.533525","url":null,"abstract":"Recently, optical burst switching and aggregated optical packet switching have gained significant exposure as possible future mechanisms for routing aggregated IP traffic over all-optical core networks. However, the limited buffering capacity in all-optical networks presents a major challenge, as current IP traffic displays strong self-similar properties. Reducing the burst loss rate of such long-range dependent traffic can be costly requiring a significant increase in either the network bandwidth or the buffer size of optical cross connects. In this paper, we revisit the possibility of using buffers to reduce self-similarity before the traffic is routed onto the all-optical core. The aim of this paper is to increase the understanding of the effect of packet/burst aggregation on the self-similarity measure of the traffic. In particular, we implement a simple burst assembly mechanism with two parameters, the maximum burst length L and the maximum burst delay d, so that incoming traffic is smoothed with a guaranteed delay bound. Unlike previous works, we simulate the burst assembler using more realistic input traffic sources, and analyze the results using both R/S plot and discrete wavelet analysis methods. Our detailed results show that buffering indeed reduces traffic self-similarity (an area of research controversy) when parameters L and d are set appropriately.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"68 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":"121901888","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}

引用次数: 3

Dynamic weights for OCSPF route computation in optical networks 光网络中OCSPF路由计算的动态权重

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533522

Bart Rousseau, F. Poppe, D. Papadimitriou

{"title":"Dynamic weights for OCSPF route computation in optical networks","authors":"Bart Rousseau, F. Poppe, D. Papadimitriou","doi":"10.1117/12.533522","DOIUrl":"https://doi.org/10.1117/12.533522","url":null,"abstract":"In current routing algorithms for wavelength switched optical transport networks, based on the Open Constrained Shortest Path First (OCSPF) concept, the effects of traffic dynamicity (the fact that lightpaths (a.k.a. optical connections or optical LSPs) are continuously being set-up and torn down) are not taken into account. Therefore, in this study four new link metrics are proposed, each of which could be used to replace the current metrics being used. Two metrics are based on the average load ρ on a link during a given timeframe. Two other metrics are based on an estimate of the number of setup requests nbr that will be blocked during the lifetime of the lightpath that is being set up. It is shown that the former two link metrics (i.e. those based on ρ) significantly reduce the blocking probability compared to the case in which a constant link metric is used. The latter two metrics (i.e. those based on nbr) however perform only slightly better or even worse than the original algorithm. In addition, it is observed that by taking into account the traffic dynamicity using the average load on a link, the amount of sustainable demand can be increased by about 10% for a given blocking probability.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"32 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":"122161425","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}

引用次数: 0

Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks 利用力结构满足不确定需求，最大限度地减少p环网络的冗余

OptiComm: Optical Networking and Communications Conference Pub Date : 2003-10-03 DOI: 10.1117/12.533178

G. Shen, W. Grover

引用次数: 22

Orthogonal spatial coding in indoor wireless optical link reducing power and bandwidth requirements 正交空间编码在室内无线光链路降低功率和带宽要求

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

Y. Alqudah, M. Kavehrad

引用次数: 2

Multicast traffic grooming in WDM networks WDM网络中的组播流量疏导

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

A. Kamal, R. Ul-Mustafa

引用次数: 49

Load balancing using adaptive alternate routing in IP-over-WDM optical burst switching networks IP-over-WDM光突发交换网络中使用自适应替代路由的负载均衡

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

Jing Li, M. Gurusamy, K. Chua

引用次数: 28