#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1999

2011

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tolga Bektas, Osman Oguz, Iradj Ouveysi
- Computers & OR
- 2007

- Iradj Ouveysi, Andrew Wirth
- European Journal of Operational Research
- 1999

We investigate network planning and design under volatile conditions of link failures and trac overload. Our model is a non-simultaneous multi-commodity problem, with any particular two link failure being considered as one scenario. We show that the optimal solution model is not practically solvable for real-world problems and hence an ecient heuristic is… (More)

- Nicholas F. Maxemchuk, Iradj Ouveysi, Moshe Zukerman
- IEEE/ACM Transactions on Networking
- 2005

This paper proposes a new measure for network performance evaluation called topology lifetime. The measure provides insight into which one of a set of topologies is likely to last the longest before more capacity must be installed. The lifetime measure is not single valued, but considers growth as a function of a set of demand shifts (perturbation). One… (More)

- Moshe Zukerman, Musa A. Mammadov, Liansheng Tan, Iradj Ouveysi, Lachlan L. H. Andrew
- Computers & OR
- 2008

Introducing a new concept of (α, β)-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 ≤ α ≤ 1, nor more than β ≥ 1, times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications… (More)

In this paper we propose the use of optimization based clustering algorithms to determine hierarchical multicast trees. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artificial and real-world… (More)

The level of traac and the distribution of traac tend to vary in a telecommunications network. Obtaining a minimum-cost network for multi-hour traac proole is a large-scale optimization problem. We formulate this as a linear programming problem and use this as a basis for comparing the eecacy of the heuristics we introduce. Our heuristic is to view this as… (More)

- Moshe Zukerman, Liansheng Tan, Hanwu Wang, Iradj Ouveysi
- IEEE Communications Letters
- 2005

Introducing the concept of α-fairness, which allows for a bounded fairness compromise, so that no source is allocated less than a fraction α of its fair share, this letter studies tradeoffs between efficiency (utilization, throughput or revenue) and fairness in a general telecommunications network with relation to any fairness criterion. We formulate a… (More)

- Chun Tung Chou, Farzad Safaei, Paul Boustead, Iradj Ouveysi
- ICCCN
- 2003

Optical burst switches (OBSes) have been proposed to improve the utilization of a network of optical cross connect (OXCs). Current studies on OBS assume a network consisting of OBSes alone. While this is a reasonable assumption for evaluating a new technology, the question of how a network of OXCs can be evolved to a network of OBSes has not been studied.… (More)

- Farzad Safaei, Iradj Ouveysi, Moshe Zukerman, Rob Pattie
- IEEE Journal on Selected Areas in Communications
- 2001

This paper explores the potential benefits of programmable networks for telecommunication carriers. It particularly focuses on using a programmable network to offer a new type of wholesale product by adding value to the wholesale of pure carriage. By augmenting the wholesale of carriage with the wholesale of network-based computation, the need for server… (More)

- Iradj Ouveysi, Feng Shu, Wei Chen, Gangxiang Shen, Moshe Zukerman
- Optical Switching and Networking
- 2010