Iraj Saniee | Bell Labs (original) (raw)

Papers by Iraj Saniee

Current transport network architectures are complex and ex- pensive to manage as they typically c... more Current transport network architectures are complex and ex- pensive to manage as they typically consist of multiple layers (packet, TDM and WDM layers). We propose a cost-effective transport network archi- tecture that relies on a single data-plane layer by exploiting joint time and wavelength multiplexing at the WDM layer. We describe the architecture that emulates fast switching in the network

It is increasingly acknowledged that we are on the verge of the next technological revolution and... more It is increasingly acknowledged that we are on the verge of the next technological revolution and the fourth industrial revolution, driven by the digitization and interconnection of all physical elements and infrastructure under the control of advanced intelligent systems. Therefore, there will be a new era of automation that should result in enhanced productivity. However, such productivity enhancements
have been anticipated before, particularly during the third industrial revolution commonly known as the ‘information age’, and have failed to materialize. Were the productivity increases observed following the first and second industrial revolutions a one-time aberration that will not be repeated in the new digital age? In this paper, we attempt to address
this question by a semi-quantitative analysis of the prior productivity jumps and their physical technological origins, and extend this analysis to the latent set of analogous digital technologies. Using this approach, we project that there will indeed be a second productivity jump in the United States that will occur in the 2028–2033 timeframe when the
aggregate of the of constituent technologies reaches the tipping point at 51 percent penetration.

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2013

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications, 2008

2016 IEEE International Conference on Big Data (Big Data), 2016

Understanding key structural properties of large-scale networks is crucial for analyzing and opti... more Understanding key structural properties of large-scale networks is crucial for analyzing and optimizing their performance and improving their reliability and security. Here, through an analysis of a collection of data networks across the globe as measured and documented by previous researchers, we show that communications networks at the Internet protocol (IP) layer possess global negative curvature. We show that negative curvature is independent of previously studied network properties, and that it has a major impact on core congestion: the load at the core of a finite negatively curved network with N nodes scales as N2, as compared to N1.5 for a generic finite flat network.

Proceedings of the 2009 Ieee International Conference on Communications, Jun 14, 2009

Corr, Feb 17, 2011

The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the gr... more The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the Dirichlet spectral gap of these networks is substantially larger than the standard spectral gap and is likely to remain non-zero in the infinite graph limit. We first prove this result for finite regular trees, and show that the Dirichlet spectral gap in the infinite tree limit converges to the spectral gap of the infinite tree. We also perform Dirichlet spectral clustering on the IP-layer networks and show that it often yields cuts near the network core that create genuine single-component clusters. This is much better than traditional spectral clustering where several disjoint fragments near the periphery are liable to be misleadingly classified as a single cluster. Spectral clustering is often used to identify bottlenecks or congestion; since congestion in these networks is known to peak at the core, our results suggest that Dirichlet spectral clustering may be better at finding bona-fide bottlenecks.

In this work we prove that the giant component of the Erd\"os--Renyi random graph G(n,c/n)G(n,c/n)G(n,c/n) for ... more In this work we prove that the giant component of the Erd\"os--Renyi random graph G(n,c/n)G(n,c/n)G(n,c/n) for c a constant greater than 1 (sparse regime), is not Gromov delta\deltadelta-hyperbolic for any positive delta\deltadelta with probability tending to one as ntoinftyn\to\inftyntoinfty. As a corollary we provide an alternative proof that the giant component of G(n,c/n)G(n,c/n)G(n,c/n) when c>1 has zero spectral gap almost surely as ntoinftyn\to\inftyntoinfty.

ABSTRACT In this paper we study the problem of jointly performing scheduling and congestion contr... more ABSTRACT In this paper we study the problem of jointly performing scheduling and congestion control in mobile ad-hoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: ldr We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. ldr We describe a wireless greedy primal dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. ldr We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. ldr We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program.

We study bootstrap percolation with the threshold parameter thetageq2\theta \geq 2thetageq2 and the initial proba... more We study bootstrap percolation with the threshold parameter thetageq2\theta \geq 2thetageq2 and the initial probability ppp on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of non-negative integers and starting from any node, all nodes at the same graph distance from it have the same degree. We show the existence of the critical threshold pf(theta)in(0,1)p_f(\theta) \in (0,1)pf(theta)in(0,1) such that with high probability, (i) if p>pf(theta)p > p_f(\theta)p>pf(theta) then the periodic tree becomes fully active, while (ii) if p<pf(theta)p < p_f(\theta)p<pf(theta) then a periodic tree does not become fully active. We also derive a system of recurrence equations for the critical threshold pf(theta)p_f(\theta)pf(theta) and compute these numerically for a collection of periodic trees and various values of theta\thetatheta, thus extending previous results for regular (homogeneous) trees.

Current transport network architectures are complex and ex- pensive to manage as they typically c... more Current transport network architectures are complex and ex- pensive to manage as they typically consist of multiple layers (packet, TDM and WDM layers). We propose a cost-effective transport network archi- tecture that relies on a single data-plane layer by exploiting joint time and wavelength multiplexing at the WDM layer. We describe the architecture that emulates fast switching in the network

It is increasingly acknowledged that we are on the verge of the next technological revolution and... more It is increasingly acknowledged that we are on the verge of the next technological revolution and the fourth industrial revolution, driven by the digitization and interconnection of all physical elements and infrastructure under the control of advanced intelligent systems. Therefore, there will be a new era of automation that should result in enhanced productivity. However, such productivity enhancements
have been anticipated before, particularly during the third industrial revolution commonly known as the ‘information age’, and have failed to materialize. Were the productivity increases observed following the first and second industrial revolutions a one-time aberration that will not be repeated in the new digital age? In this paper, we attempt to address
this question by a semi-quantitative analysis of the prior productivity jumps and their physical technological origins, and extend this analysis to the latent set of analogous digital technologies. Using this approach, we project that there will indeed be a second productivity jump in the United States that will occur in the 2028–2033 timeframe when the
aggregate of the of constituent technologies reaches the tipping point at 51 percent penetration.

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2013

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications, 2008

2016 IEEE International Conference on Big Data (Big Data), 2016

Understanding key structural properties of large-scale networks is crucial for analyzing and opti... more Understanding key structural properties of large-scale networks is crucial for analyzing and optimizing their performance and improving their reliability and security. Here, through an analysis of a collection of data networks across the globe as measured and documented by previous researchers, we show that communications networks at the Internet protocol (IP) layer possess global negative curvature. We show that negative curvature is independent of previously studied network properties, and that it has a major impact on core congestion: the load at the core of a finite negatively curved network with N nodes scales as N2, as compared to N1.5 for a generic finite flat network.

Proceedings of the 2009 Ieee International Conference on Communications, Jun 14, 2009

Corr, Feb 17, 2011

The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the gr... more The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the Dirichlet spectral gap of these networks is substantially larger than the standard spectral gap and is likely to remain non-zero in the infinite graph limit. We first prove this result for finite regular trees, and show that the Dirichlet spectral gap in the infinite tree limit converges to the spectral gap of the infinite tree. We also perform Dirichlet spectral clustering on the IP-layer networks and show that it often yields cuts near the network core that create genuine single-component clusters. This is much better than traditional spectral clustering where several disjoint fragments near the periphery are liable to be misleadingly classified as a single cluster. Spectral clustering is often used to identify bottlenecks or congestion; since congestion in these networks is known to peak at the core, our results suggest that Dirichlet spectral clustering may be better at finding bona-fide bottlenecks.

In this work we prove that the giant component of the Erd\"os--Renyi random graph G(n,c/n)G(n,c/n)G(n,c/n) for ... more In this work we prove that the giant component of the Erd\"os--Renyi random graph G(n,c/n)G(n,c/n)G(n,c/n) for c a constant greater than 1 (sparse regime), is not Gromov delta\deltadelta-hyperbolic for any positive delta\deltadelta with probability tending to one as ntoinftyn\to\inftyntoinfty. As a corollary we provide an alternative proof that the giant component of G(n,c/n)G(n,c/n)G(n,c/n) when c>1 has zero spectral gap almost surely as ntoinftyn\to\inftyntoinfty.

ABSTRACT In this paper we study the problem of jointly performing scheduling and congestion contr... more ABSTRACT In this paper we study the problem of jointly performing scheduling and congestion control in mobile ad-hoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: ldr We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. ldr We describe a wireless greedy primal dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. ldr We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. ldr We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program.

We study bootstrap percolation with the threshold parameter thetageq2\theta \geq 2thetageq2 and the initial proba... more We study bootstrap percolation with the threshold parameter thetageq2\theta \geq 2thetageq2 and the initial probability ppp on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of non-negative integers and starting from any node, all nodes at the same graph distance from it have the same degree. We show the existence of the critical threshold pf(theta)in(0,1)p_f(\theta) \in (0,1)pf(theta)in(0,1) such that with high probability, (i) if p>pf(theta)p > p_f(\theta)p>pf(theta) then the periodic tree becomes fully active, while (ii) if p<pf(theta)p < p_f(\theta)p<pf(theta) then a periodic tree does not become fully active. We also derive a system of recurrence equations for the critical threshold pf(theta)p_f(\theta)pf(theta) and compute these numerically for a collection of periodic trees and various values of theta\thetatheta, thus extending previous results for regular (homogeneous) trees.