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

El-Sayed A. El-Badawy

dblp:11/2574 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 2Systems, architecture and hardware · 1

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
1 paper
Optical networks · 33% Wireless networking · 33% Network performance modeling · 33%

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

TopicWeightPapersLastEvidence papers
Optical networks
optical code-division multiple access
0.112008
Significance in adding a queuing subsystem to the R3T random access OCDMA protocol · IEEE Trans. Commun. 2008
Network performance modeling
queueing analysis
0.112008
Significance in adding a queuing subsystem to the R3T random access OCDMA protocol · IEEE Trans. Commun. 2008
Wireless networking
random access
0.112008
Significance in adding a queuing subsystem to the R3T random access OCDMA protocol · IEEE Trans. Commun. 2008

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

state diagram · 0.1mathematical modeling · 0.1
YearPublicationVenuePosition
2008 Significance in adding a queuing subsystem to the R3T random access OCDMA protocol
abstract
A queuing subsystem is proposed to the round robin receiver/transmitter (R/sup 3/T) optical code-division multiple-access (OCDMA) protocol. The corresponding state diagram and its mathematical model are outlined. We prove that significant improvement in terms of system throughput and blocking probability can be achieved by only adding a single buffer at each user node. Furthermore, the modified R/sup 3/T protocol can support higher traffic loads with acceptable delay and good efficiency.
Ziad A. El-Sahn, Yousef M. Abdelmalek, Hossam M. H. Shalaby, El-Sayed A. El-Badawy
IEEE Trans. Commun.4
2006 On optical CDMA MAC protocols
abstract
A media access control (MAC) protocol for optical code-division multiple-access (CDMA) packet networks with variable length data traffic is proposed. This protocol exhibits a sliding window with variable size. A model for interference level fluctuation and an accurate analysis for channel usage are presented. Both multiple access interference (MAI) and photodetector's shot noise are considered. Both chip-level and correlation receivers are adopted. The system performance is evaluated using traditional average system throughput and average delay. Finally, we apply error control codes (ECCs) in order to enhance the overall performance. Our results indicate that the performance can be enhanced to reach its peak using ECC with optimum number of correctable errors. Furthermore chip-level receivers are shown to give much higher performance than that of correlation receivers. Also, it has been shown that MAI is the main source of signal degradation.
M. A. A. Mohamed, Hossam M. H. Shalaby, El-Sayed A. El-Badawy
ISCAS3
2004 Optical CDMA protocol with selective retransmission
abstract
New protocol for optical code-division multiple access (CDMA) networks is proposed. Our proposed protocol is based on selective retransmission technique. A mathematical model is presented using a detailed state diagram. The protocol is analyzed using equilibrium point analysis (EPA), and its performance is examined using traditional throughput and average delay for several network parameters. We also compare the performance of the proposed protocol to the R/sup 3/T protocol based on go-back-n technique. Results show that a higher performance is achieved by the proposed protocol at the expense of system complexity.
M. A. A. Mohamed, Hossam M. H. Shalaby, El-Sayed A. El-Badawy
ISCC3