The Experts below are selected from a list of 501 Experts worldwide ranked by ideXlab platform
F. Neri - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Crosstalk Minimization in Microring-Based Wavelength Routing Matrices
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Co-Authors: A. Bianco, D. Cuda, M. Garrich, Guido Gavilanes Castillo, Valentina Martina, F. NeriAbstract:Optical switching fabrics (OSF) are gaining interest because they promise to satisfy the higher information densities demanded by each successive generation of high-end routers and switches. Silicon microring resonators (MRR) can be employed to perform switching operations directly in the optical domain. However, similarly to other devices used to build all-optical switching fabrics, such as Arrayed Waveguide Gratings (AWG), MRR-based switching fabrics might show a limited scalability in terms of port count due to the crosstalk accumulation caused by the spatial wavelengths reuse. We consider an OSF built on a Wavelength-Routing-Matrix (WRM) based on MRRs, we highlight its scalability issues and we propose a new design as well as two different strategies to limit the wavelength spatial reuse.
-
Microring-based wavelength Routing Matrix
2011 37th European Conference and Exhibition on Optical Communication, 2011Co-Authors: A. Bianco, D. Cuda, M. Garrich, R. Gaudino, G. Gavilanes, F. NeriAbstract:We introduce a passive wavelength Routing Matrix based on microring resonators for optical packet switching architectures. We assess its technological feasibility and physical scalability which is limited by the coherent crosstalk accumulation.
-
Crosstalk Minimization in Microring-Based Wavelength Routing Matrices
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Co-Authors: A. Bianco, D. Cuda, M. Garrich, Guido Gavilanes Castillo, Valentina Martina, F. NeriAbstract:Optical switching fabrics (OSF) are gaining interest because they promise to satisfy the higher information densities demanded by each successive generation of high-end routers and switches. Silicon microring resonators (MRR) can be employed to perform switching operations directly in the optical domain. However, similarly to other devices used to build all-optical switching fabrics, such as Arrayed Waveguide Gratings (AWG), MRR-based switching fabrics might show a limited scalability in terms of port count due to the crosstalk accumulation caused by the spatial wavelengths reuse. We consider an OSF built on a Wavelength-Routing-Matrix (WRM) based on MRRs, we highlight its scalability issues and we propose a new design as well as two different strategies to limit the wavelength spatial reuse.
Georgios B. Giannakis - One of the best experts on this subject based on the ideXlab platform.
-
Robust network traffic estimation via sparsity and low rank
2013 IEEE International Conference on Acoustics Speech and Signal Processing, 2013Co-Authors: Morteza Mardani, Georgios B. GiannakisAbstract:Accurate estimation of origin-to-destination (OD) traffic flows provides valuable input for network management tasks. However, lack of flow-level observations as well as intentional and unintentional anomalies pose major challenges toward achieving this goal. Leveraging the low intrinsic-dimensionality of OD flows and the sparse nature of anomalies, this paper proposes a convex program with nuclear-norm and ℓ1-norm regularization terms to estimate the nominal and anomalous traffic components, using a small subset of (possibly anomalous) flow counts in addition to link counts. Analysis and simulations confirm that the said estimator can exactly recover sufficiently low-dimensional nominal traffic and sparse enough anomalies when the Routing Matrix is column-incoherent, and an adequate amount of flow counts are randomly sampled. The results offer valuable insights about the measurement types and network scenaria giving rise to accurate traffic estimation. Tests with real Internet data corroborate the effectiveness of the novel estimator.
-
ICASSP - Robust network traffic estimation via sparsity and low rank
2013 IEEE International Conference on Acoustics Speech and Signal Processing, 2013Co-Authors: Morteza Mardani, Georgios B. GiannakisAbstract:Accurate estimation of origin-to-destination (OD) traffic flows provides valuable input for network management tasks. However, lack of flow-level observations as well as intentional and unintentional anomalies pose major challenges toward achieving this goal. Leveraging the low intrinsic-dimensionality of OD flows and the sparse nature of anomalies, this paper proposes a convex program with nuclear-norm and l1-norm regularization terms to estimate the nominal and anomalous traffic components, using a small subset of (possibly anomalous) flow counts in addition to link counts. Analysis and simulations confirm that the said estimator can exactly recover sufficiently low-dimensional nominal traffic and sparse enough anomalies when the Routing Matrix is column-incoherent, and an adequate amount of flow counts are randomly sampled. The results offer valuable insights about the measurement types and network scenaria giving rise to accurate traffic estimation. Tests with real Internet data corroborate the effectiveness of the novel estimator.
-
Distributed Routing Algorithms for Wireless Multihop Networks
2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007Co-Authors: Alejandro Ribeiro, Georgios B. Giannakis, Nicholas D. SidiropoulosAbstract:We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) Matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal Routing Matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
-
ICASSP (3) - Distributed Routing Algorithms for Wireless Multihop Networks
2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007Co-Authors: Alejandro Ribeiro, Georgios B. Giannakis, Nicholas D. SidiropoulosAbstract:We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) Matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal Routing Matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
-
A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks
2006 Fortieth Asilomar Conference on Signals Systems and Computers, 2006Co-Authors: Alejandro Ribeiro, Nicholas D. Sidiropoulos, Georgios B. GiannakisAbstract:We introduce a novel approach to Routing based on the so called pairwise packet delivery ratio Matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which Routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal Routing protocols by selecting the Routing Matrix from a convex polygon containing all feasible Routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.
Nicholas D. Sidiropoulos - One of the best experts on this subject based on the ideXlab platform.
-
Distributed Routing Algorithms for Wireless Multihop Networks
2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007Co-Authors: Alejandro Ribeiro, Georgios B. Giannakis, Nicholas D. SidiropoulosAbstract:We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) Matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal Routing Matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
-
ICASSP (3) - Distributed Routing Algorithms for Wireless Multihop Networks
2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007Co-Authors: Alejandro Ribeiro, Georgios B. Giannakis, Nicholas D. SidiropoulosAbstract:We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) Matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal Routing Matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
-
A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks
2006 Fortieth Asilomar Conference on Signals Systems and Computers, 2006Co-Authors: Alejandro Ribeiro, Nicholas D. Sidiropoulos, Georgios B. GiannakisAbstract:We introduce a novel approach to Routing based on the so called pairwise packet delivery ratio Matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which Routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal Routing protocols by selecting the Routing Matrix from a convex polygon containing all feasible Routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.
Alejandro Ribeiro - One of the best experts on this subject based on the ideXlab platform.
-
Distributed Routing Algorithms for Wireless Multihop Networks
2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007Co-Authors: Alejandro Ribeiro, Georgios B. Giannakis, Nicholas D. SidiropoulosAbstract:We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) Matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal Routing Matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
-
ICASSP (3) - Distributed Routing Algorithms for Wireless Multihop Networks
2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007Co-Authors: Alejandro Ribeiro, Georgios B. Giannakis, Nicholas D. SidiropoulosAbstract:We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) Matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal Routing Matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
-
A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks
2006 Fortieth Asilomar Conference on Signals Systems and Computers, 2006Co-Authors: Alejandro Ribeiro, Nicholas D. Sidiropoulos, Georgios B. GiannakisAbstract:We introduce a novel approach to Routing based on the so called pairwise packet delivery ratio Matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which Routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal Routing protocols by selecting the Routing Matrix from a convex polygon containing all feasible Routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.
A. Bianco - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Crosstalk Minimization in Microring-Based Wavelength Routing Matrices
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Co-Authors: A. Bianco, D. Cuda, M. Garrich, Guido Gavilanes Castillo, Valentina Martina, F. NeriAbstract:Optical switching fabrics (OSF) are gaining interest because they promise to satisfy the higher information densities demanded by each successive generation of high-end routers and switches. Silicon microring resonators (MRR) can be employed to perform switching operations directly in the optical domain. However, similarly to other devices used to build all-optical switching fabrics, such as Arrayed Waveguide Gratings (AWG), MRR-based switching fabrics might show a limited scalability in terms of port count due to the crosstalk accumulation caused by the spatial wavelengths reuse. We consider an OSF built on a Wavelength-Routing-Matrix (WRM) based on MRRs, we highlight its scalability issues and we propose a new design as well as two different strategies to limit the wavelength spatial reuse.
-
Microring-based wavelength Routing Matrix
2011 37th European Conference and Exhibition on Optical Communication, 2011Co-Authors: A. Bianco, D. Cuda, M. Garrich, R. Gaudino, G. Gavilanes, F. NeriAbstract:We introduce a passive wavelength Routing Matrix based on microring resonators for optical packet switching architectures. We assess its technological feasibility and physical scalability which is limited by the coherent crosstalk accumulation.
-
Crosstalk Minimization in Microring-Based Wavelength Routing Matrices
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Co-Authors: A. Bianco, D. Cuda, M. Garrich, Guido Gavilanes Castillo, Valentina Martina, F. NeriAbstract:Optical switching fabrics (OSF) are gaining interest because they promise to satisfy the higher information densities demanded by each successive generation of high-end routers and switches. Silicon microring resonators (MRR) can be employed to perform switching operations directly in the optical domain. However, similarly to other devices used to build all-optical switching fabrics, such as Arrayed Waveguide Gratings (AWG), MRR-based switching fabrics might show a limited scalability in terms of port count due to the crosstalk accumulation caused by the spatial wavelengths reuse. We consider an OSF built on a Wavelength-Routing-Matrix (WRM) based on MRRs, we highlight its scalability issues and we propose a new design as well as two different strategies to limit the wavelength spatial reuse.
