Channel measurements for a 50G passive optical network (PON) show a significant amount of intersymbol interference (ISI) due to chromatic dispersion (CD) and the use of low-cost, bandwidth-limited
The communication industry must adapt to deal with SDN which is set to rewrite the book of networking.
We consider the Buy-at-Bulk network design problem in which we wish to design a network for carrying multicommodity demands from a set of source nodes to a set of destination nodes.
We settle the complexity status of the robust network design problem by showing that a special case of the single-source hose model is coNP-Hard.
We settle the complexity status of the robust network design problem in undirected graphs.
In the Edge-Disjoint Paths problem with Congestion (EDPwC), we are given a graph with $M$ edges and a set of terminal pairs.
We show that there is no $(loglog M)^{1-ve}$ approximation for the undirected congestion minimization problem unless $NP subseteq ZPTIME(n^{polylog~n})$, where $M$ is the size of the graph and $ve$
We show that there is no $log^{{1over 3}-ve} M$ approximation for the undirected Edge-Disjoint Paths problem unless $NP subseteq ZPTIME(n^{polylog~n})$, where $M$ is the size of the graph and $ve$
In the edge-disjoint paths problem with congestion (EDPwC), we are given a graph with n nodes, a set of terminal pairs and an integer c.
The hardnesses and elastic moduli of strained layer superlattices with 40 cycles and 200 cycles of 25 angstrom ZnTe grown on GaAs substrates by MOCVD are investigated using a nanoindenter.
