2001
DOI: 10.1016/s1388-3437(01)80118-9
|View full text |Cite
|
Sign up to set email alerts
|

On burst assembly in optical burst switching networks—A performance evaluation of just-enough-time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
58
0
2

Year Published

2003
2003
2016
2016

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 87 publications
(64 citation statements)
references
References 10 publications
0
58
0
2
Order By: Relevance
“…Furthermore, the presented OBS architecture brings additional profit like dismissing the offset variations with the related unfairness problem in access to transmission resources [10]. Indeed, in conventional OBS networks, whilst the control packet travels through the network its OT decreases successively at each hop by the PT.…”
Section: Discussionmentioning
confidence: 99%
“…Furthermore, the presented OBS architecture brings additional profit like dismissing the offset variations with the related unfairness problem in access to transmission resources [10]. Indeed, in conventional OBS networks, whilst the control packet travels through the network its OT decreases successively at each hop by the PT.…”
Section: Discussionmentioning
confidence: 99%
“…Consequently, in BLD method, HP class is assigned shorter burst lengths than the LP class for enhancing the performance of the HP class relative to the LP class in terms of loss probabilities. In particular, HP packets are burstified using lower timer [10] and lower burst length thresholds [8,10] compared with the corresponding values for LP packets (see Fig. 5).…”
Section: Service Differentiationmentioning
confidence: 96%
“…Moreover, the end-to-end delay for HP traffic increases as a result of increased offset times which, in turn, decreases the throughput. [10]. The Burst length-based differentiation (BLD is another edge based mechanism that has been explored quite extensively.…”
Section: Service Differentiationmentioning
confidence: 99%
See 1 more Smart Citation
“…Erlang's well-known B formula was used to obtain the burst blocking probability, with the assumption that the DBs arrive in Poisson stream [4]. Similarly, this queuing model can be extended to model SRS to have a simple projection of the scheme's performance improvement over the traditional OBS.…”
Section: Performance Evaluationmentioning
confidence: 99%