#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2004

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang
- IEEE/ACM Transactions on Networking
- 2005

We study the problem of determining the minimum number of limited-range wavelength converters needed to construct strictly, wide-sense, and rearrangeably nonblocking optical cross-connects for both unicast and multicast traffic patterns. We give the exact formula to compute this number for rearrangeably and wide-sense nonblocking cross-connects under both… (More)

- Hung Q. Ngo, Dazhen Pan, Chunming Qiao
- INFOCOM
- 2004

Constructing wavelength division multiplexing (WDM) switches with cheap components and low complexity is an important problem in optical networking. Typically, there are two request models widely considered. In one model, a connection request asks to go from a wavelength on an input fiber of the WDM switch to a particular wavelength on an output fiber. In… (More)

- Dazhen Pan, Vishal Anand, Hung Q. Ngo
- ICC
- 2004

Constructing wavelength division multiplexing (WDM) multicast switches with cheap components and low complexity is an important problem in optical networking, since multicasting is one of the key requirements of emerging bandwidth-intensive applications such as video conferencing, video on demand and online gaming. In this paper we present several new… (More)

- Hung Q. Ngo, Dazhen Pan, Chunming Qiao
- IEEE/ACM Transactions on Networking
- 2006

Constructing fast wavelength division multiplexing switches with cheap, integratable components, less power consumption and noise accumulation, and low complexity is an important problem in optical networking. Typically, there are two request models widely considered. In one model, a connection request asks to go from a wavelength on an input fiber of the… (More)

- H.Q. Ngo, Yang Wang, Dazhen Pan
- IEEE/ACM Transactions on Networking
- 2009

We formulate a graph model called [<i>w</i>,<i>f</i>]<i>-distributors</i> which is useful in analyzing the structures and comparing the quantitative complexities and qualitative features of optical multicast cross-connects. Using the formulation we show that two strictly nonblocking multicast optical cross-connects under two different request models are… (More)

- Hung Q. Ngo, Yang Wang, Dazhen Pan
- IEEE/ACM Trans. Netw.
- 2009

We formulate a graph model called [<i>w, f</i>]-distributors which is useful in analyzing the structures and comparing the quantitative complexities and qualitative features of optical multicast cross-connects. Using the formulation we show that two strictly nonblocking multicast optical cross-connects under two different request models are equivalent… (More)

- Dazhen Pan
- 2004

A language L is in NP if there is a Turing machine which can verify, in polynomial time, if a string x is in L, given that the Turing machine is provided with a good “witness string” w. Hence, NP can be viewed as the class of languages which have an interactive proof system in which there is a polynomial time verifier V (Turing machine) and an infinitely… (More)

- Dazhen Pan
- 2004

To date, thousands of natural optimization problems have been shown to be NP-hard [6, 13]. Designing approximation algorithms [4, 17, 21] has become a standard path to attack these problems. For some problem, however, it is even NP-hard to approximate the optimal solution to within a certain ratio. The TRAVELING SALESMAN PROBLEM (TSP), for instance, has no… (More)

- ‹
- 1
- ›