Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hooshang Ghafouri-Shiraz

dblp:08/3920 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Optical networks · 29% Routing and switching · 26% Network performance modeling · 20%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Datacenter networks
load balancing
0.112007
On Traffic Allocations in Optical Packet Switches · IEEE J. Sel. Areas Commun. 2007
Optical networks › optical switching
optical packet switching
0.112007
On Traffic Allocations in Optical Packet Switches · IEEE J. Sel. Areas Commun. 2007
Network performance modeling › packet loss
packet loss analysis
0.112007
On Traffic Allocations in Optical Packet Switches · IEEE J. Sel. Areas Commun. 2007
Routing and switching › traffic engineering
traffic allocation
0.112007
On Traffic Allocations in Optical Packet Switches · IEEE J. Sel. Areas Commun. 2007
Optical networks
optical code-division multiple access
0.012002
Unipolar codes with ideal in-phase cross-correlation for spectral amplitude-coding optical CDMA systems · IEEE Trans. Commun. 2002
Coding theory › sequences › sequence design
optical orthogonal codes
0.012002
Unipolar codes with ideal in-phase cross-correlation for spectral amplitude-coding optical CDMA systems · IEEE Trans. Commun. 2002
Network optimization and economics
resource allocation
0.012007
On Traffic Allocations in Optical Packet Switches · IEEE J. Sel. Areas Commun. 2007
Routing and switching › traffic engineering
traffic distribution
0.012007
On Traffic Allocations in Optical Packet Switches · IEEE J. Sel. Areas Commun. 2007

Methods — techniques the papers use, named apart from their topics

load balancing algorithm · 0.1convex optimization · 0.1algebraic code construction · 0.1
YearPublicationVenuePosition
2007 Capacity Enhancement in Synchronous Optical Overlapping PPM-CDMA Network by a Novel Spreading Code
abstract
In this paper we have proposed a novel prime spreading sequence family hereby referred to as "Double-Padded Modified Prime Code (DPMPC)" for direct-detection optical code- division multiple-access (OCDMA) networks. The new code has been applied to overlapping pulse-position modulation (OPPM) synchronous OCDMA network and the performance of system is evaluated and compared with existing prime codes family. In addition, we have also introduced a new interference cancellation technique which significantly improves the system capacity of OCDMA networks.
Mohammad Massoud Karbassian, Hooshang Ghafouri-Shiraz
GLOBECOM2
2007 Performance evaluation of multi-fiber optical packet switches
Gaoxi Xiao, Hooshang Ghafouri-Shiraz
Comput. Networks3
2007 On Traffic Allocations in Optical Packet Switches
abstract
In this paper, we study the impacts of traffic allocations on the performance of optical packet switches (OPS). In particular, two different cases are investigated where traffic loads are distributed over different (i) time slots (time dimension); and (ii) output ports (space dimension), respectively. These two cases are of significant importance as each has different applications and they form the basis of some more complicated schemes. Our main contributions are three fold. Firstly, for the most fundamental OPS configuration, we prove that its packet loss is a convex function of traffic load. For any other node configuration, we prove that its packet loss remains as a convex function of traffic load as long as a simple condition is satisfied. Secondly, for any OPS with its packet loss as a convex function of traffic load, we propose a simple algorithm for efficiently comparing some different traffic allocations and telling which one of them leads to the lowest packet loss. We also show that in either time or space dimension, the best packet-loss performance is achieved when traffic loads are uniformly distributed. Thirdly, for OPS with limited capability of adjusting a given traffic distribution, we propose a Load Balancing (LB) algorithm to minimize the packet loss. These contributions provide some useful guidelines and algorithms for achieving efficient traffic allocations in various OPS networks.
Gaoxi Xiao, Hooshang Ghafouri-Shiraz
IEEE J. Sel. Areas Commun.3
2002 Unipolar codes with ideal in-phase cross-correlation for spectral amplitude-coding optical CDMA systems
abstract
Unipolar codes with ideal in phase cross-correlation are important in spectral amplitude-coding optical code-division multiple-access (CDMA) systems since these codes eliminate multiuser interference and also suppress the effect of phase-induced intensity noise. However, very little research work has been done on such codes although codes with ideal cross-correlation have been studied for many years. In the paper by Zhou et al.(see Electron. Lett., vol.36, p.728-29, 2000), such a code has been introduced without a clear construction method. In this paper, we firstly review this old code, and then construct two new codes with ideal in-phase cross-correlation in algebraic ways. Both of the proposed new codes are obtained by modifying former codes with ideal cross-correlation. It has been shown that the system performance can be improved significantly by using codes with ideal in-phase cross-correlation instead of the Hadamard code. These codes can also be used in synchronous optical CDMA systems for multiuser interference cancellation.
Zou Wei, Hooshang Ghafouri-Shiraz
IEEE Trans. Commun.2