Nicolas Puech

Nicolas Puech

Auto-generated profile, based on publicly available information

Nicolas Puech

Télécom ParisTech, Paris

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2006 in Proceedings of 15th International Conference on Computer Communications and Networks
Verified
Conference Paper
Closed access
MEMohamed Ezzahdi
Mohamed Ezzahdi
SZSawsan Zahr
Sawsan Zahr
Mohamed KOUBAAMohamed KOUBAA
Mohamed KOUBAA
NPNicolas Puech
Nicolas Puech
MGMaurice Gagnaire
Maurice Gagnaire
Over the last decade, numerous routing and wavelength assignment (RWA) algorithms have been developed for WDM optical networks planning. Most of these algorithms neglect the feasibility of the obtained lightpaths. In this paper, we propose a new algorithm, called LERP (Lightpath Establishment with Regenerator Placement), that enables to solve the problem of RWA in guaranteeing the feasibility of the obtained solution. A lightpath is said admissible if the BER (Bit Error Rate) at its destination node remains acceptable (remains under a given threshold). In the case of BER non-admissibility, one or more electrical regenerators may be placed along the lightpath. The LERP algorithm aims at minimizing the number of regenerators necessary to guarantee the quality of transmission along the lightpath. The originality of the our approach consists in considering simultaneously four physical layer impairments, namely, chromatic dispersion, polarization mode dispersion, amplified spontaneous emission and non-linear phase shift. The efficiency of the LERP algorithm is demonstrated via a numerical comparison with one of the alternative solutions proposed in the literature. Numerical simulations have been carried out in the context of the 18-node NSF network.

1 June 2007
Verified
Conference Paper
Closed access
NSN. Skorin-Kapov
N. Skorin-Kapov
OTO. Tonguz
O. Tonguz
NPN. Puech
N. Puech
Self-organization is a phenomenon that has been observed in many real-life complex networks and the associated concepts have been utilized in various branches of science. As capacity requirements in transparent optical networks (TONs) increase, so does their complexity. This in turn makes designing scalable security mechanisms critical, particularly due to the high speeds and transparency inherent in TONs. These security mechanisms should be able to handle unforseen attacks, as well as component faults. In this paper, we explore the possibilities of applying self-organizing concepts to failure management in transparent optical networks. With further investigation, we hope to develop a network architecture which can self-organize into a functional structure in the presence of failures and other changes in the environment. If successful, this could significantly improve the scalability and robustness of such networks.

19 May 2009 in IEEE Communications Magazine
Verified
Journal Article
Closed access
NSNina Skorin-Kapov
Nina Skorin-Kapov
OTOzan K. Tonguz
Ozan K. Tonguz
NPNicolas Puech
Nicolas Puech
Security and reliability issues are of utmost importance in transparent optical networks due to the extremely large fiber throughput. Fast and successful reaction and restoration mechanisms performed by failure management can prevent loss of large amounts of critical data, which can cause severe service disruption. In this article we discuss failure management issues in TONs, the mechanisms involved, and optical monitoring techniques. Furthermore, we propose applying structural properties of self-organizing systems to create a "small world" hybrid supervisory plane that can enable faster system-wide communication. We also investigate the possibility of a scale-free structure aimed at improving robustness in the network and propose various topology generation algorithms.

3 September 2002
Verified
Conference Paper
Closed access
JKJosue Kuri
Josue Kuri
NPNicolas Puech
Nicolas Puech
MGMaurice Gagnaire
Maurice Gagnaire
We propose a Tabu Search (TS) algorithm to solve the problem of designing a logical topology for packet-switched traffic over a WDM mesh network. The cost of mapping such a logical topology over a physical network is taken into account. The algorithm provides approximate solutions of good quality (i.e., close to the optimal ones) to the corresponding optimization problem and allows us to solve problem instances of large size, which is usually impossible with algorithms solving exactly the Integer Linear Programming (ILP) formulations of the problem. The algorithm makes it possible to evaluate the cost-performance tradeoff between designing a logical topology with small congestion and a large number of (possibly expensive) lightpaths and designing a less expensive topology with higher congestion.