Placing regenerators in optical networks to satisfy multiple sets of requests.

The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [10], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d,p ≥ 2 it does not admit a PTASUnknown control sequence '\textsc', even if G has maximum degree at most 3 and the lightpaths have length O(d)(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln (d ·p). We then study the case where G is a path, proving that the problem is NP-hard for any d,p ≥ 2, even if there are two edges of the path such that any lightpath uses at least one of them. Interestingly, we show that the problem is polynomial-time solvable in paths when all the lightpaths share the first edge of the path, as well as when the number of lightpaths sharing an edge is bounded. Finally, we generalize our model in two natural directions, which allows us to capture the model of [10] as a particular case, and we settle some questions that were left open in [10]

Effect Of Reconfiguration On Ip Packet Traffic In Wdm Networks

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2007Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2007Günümüzde iletişim ağlarına erişen insan sayısı ve iletişim uygulamalarının ihtiyaç duyduğu band genişliği ihtiyacı hızla artmaya devam etmektedir. Artan trafik istekleri daha geniş band genişliği kullanımına olanak verebilen optik iletişim ağlarının tasarımını tetiklemektedir. Bir veya daha fazla sayıda optik fiberi kapsayabilen bir ışıkyolu alt katmanda yer alan optik altyapının üzerinde iletişim kanalları sağlamaktadır. Sanal topoloji tasarımı, verilen bir trafik matrisine göre bir grup ışık yolunun kurulması olarak tanımlanabilir. Trafikte meydana gelecek bir değişiklik yeniden konfigürasyon kararının alınmasına neden olabilir. Sanal topoloji yeniden konfigürasyonu, hem yeni sanal topolojinin belirlenmesini hem de bu yeni topolojiye geçişi içermektedir. Bu tez çalışmasında IP/WDM ağlarda sanal topoloji yeniden konfigürasyonunun IP paket trafiği üzerindeki etkileri incelenmiştir. Çalışma kapsamında, çeşitli yeniden kofigürasyon algoritmaları gerçeklenmiş ve Fishnet tabanlı bir IP simülatörü üzerinde test edilmiştir. Gerçeklenen sanal topoloji tasarım algoritmalarına ait paket gecikmeleri/kayıpları incelenmiş ve algoritmaların başarımları karşılaştırılmıştır.Today, both the amount of people accessing communication networks and new communication applications which require high data transfer rates are exponentially increasing. Growing traffic demands triggered the design of optical communication networks which will be able to provide larger bandwidth utilization. A lightpath, which can span multiple fiber links, provides communication channels over the underlying optical communication infrastructure. Virtual Topology Design (VTD) means establishment of a set of lightpaths under a given traffic pattern. A change in traffic pattern may trigger reconfiguration decision. Virtual Topology Reconfiguration (VTR) contains determination of a new virtual topology and migration between the old and new virtual topologies. In this thesis, the effects of virtual topology reconfiguration on Internet Protocol (IP) packet traffic on IP over WDM networks were studied. Various reconfiguration algorithms were implemented and tested on a Fishnet based IP simulator. Packet delays/losses are investigated during reconfiguration procedure for performance comparison of implemented reconfiguration algorithms.Yüksek LisansM.Sc