2007
DOI: 10.1109/icon.2007.4444107
|View full text |Cite
|
Sign up to set email alerts
|

A Markov Model for Preference List Sizes in Combined Input Output Queued Switches with Stable Matching Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2011
2011

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…Apart from the algorithmic approaches described above, mathematical models have also been used widely to solve and analyze related QoS problems [1,10,4,12,15,9,13,22,21]. For instance, a Markov chain modeling process is popularly used, to solve network congestion in [1], delay in [10,4,12] and packet loss in [15,9].…”
Section: Introductionmentioning
confidence: 99%
“…Apart from the algorithmic approaches described above, mathematical models have also been used widely to solve and analyze related QoS problems [1,10,4,12,15,9,13,22,21]. For instance, a Markov chain modeling process is popularly used, to solve network congestion in [1], delay in [10,4,12] and packet loss in [15,9].…”
Section: Introductionmentioning
confidence: 99%