1999
DOI: 10.1109/26.795827
|View full text |Cite
|
Sign up to set email alerts
|

A Markov chain model for an optical shared-memory packet switch

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2004
2004
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…Finally, the destinations of packets arriving at the secondary inputs in a given time slot are assumed to be independent of packets arriving at both primary and secondary inputs in the previous time slots. Since packet arrivals at primary inputs are assumed to be independent of each other, the number of packet arrivals at the primary inputs in a given time slot follows the binomial distribution, i.e., (1) Let be the random variable representing the total number of packets arriving at both primary and secondary inputs, i.e., (2) The packet arrivals during a given time slot at the primary inputs, represented by , are assumed to be independent of the packet arrivals during the previous time slot, on which the random variable depends. Therefore, the distribution of is given by (3) Note that…”
Section: Performance Analysismentioning
confidence: 99%
See 4 more Smart Citations
“…Finally, the destinations of packets arriving at the secondary inputs in a given time slot are assumed to be independent of packets arriving at both primary and secondary inputs in the previous time slots. Since packet arrivals at primary inputs are assumed to be independent of each other, the number of packet arrivals at the primary inputs in a given time slot follows the binomial distribution, i.e., (1) Let be the random variable representing the total number of packets arriving at both primary and secondary inputs, i.e., (2) The packet arrivals during a given time slot at the primary inputs, represented by , are assumed to be independent of the packet arrivals during the previous time slot, on which the random variable depends. Therefore, the distribution of is given by (3) Note that…”
Section: Performance Analysismentioning
confidence: 99%
“…A shared-buffer switching architecture similar to that presented in Fig. 1 is analyzed based on a Reduced Markov Chain (RMC) in [1]. This RMC model significantly reduces the number of states compared to that of Full Markov Chain (FMC) based model previously developed to study similar architectures [20].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations