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.

Jolyon White

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

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

Computer networks · 3

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
Network performance modeling · 68% Optical networks · 32%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › loss systems
blocking probability
0.122003
Performance analyses of optical burst-switching networks · IEEE J. Sel. Areas Commun. 2003
Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations · INFOCOM 2003
Optical networks › optical switching
optical burst switching
0.122003
Performance analyses of optical burst-switching networks · IEEE J. Sel. Areas Commun. 2003
Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations · INFOCOM 2003
Network performance modeling › approximate analysis
reduced load approximation
0.122003
Performance analyses of optical burst-switching networks · IEEE J. Sel. Areas Commun. 2003
Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations · INFOCOM 2003
Network performance modeling
fixed point analysis
0.012003
Performance analyses of optical burst-switching networks · IEEE J. Sel. Areas Commun. 2003

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

simulation · 0.1fixed-point approximation · 0.1
YearPublicationVenuePosition
2003 Performance enhancement of optical burst switching using burst segmentation
abstract
In this paper we provide an analytical framework for studying the performance of optical burst switching (OBS) networks using burst segmentation. We first consider a single link model to evaluate the blocking probability of OBS using burst segmentation and confirm it by simulation. We use this analysis to demonstrate the benefit of burst segmentation over the well-known just-enough-time (JET) policy for the single link case. We then extend these models to a network scenario using a reduced load fixed point approximation to evaluate blocking probabilities and to show the advantages provided by burst segmentation for OBS networks.
Marcel F. Neuts, Zvi Rosberg, Hai Le Vu 0001, Jolyon White, Moshe Zukerman
ICC4
2003 Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations
abstract
This paper provides a framework for analysis and performance evaluation of Optical Burst Switching (OBS) networks. In particular, a new reduced load fixed point approximation model to evaluate blocking probabilities in OBS networks is introduced. The model is versatile enough to cover known OBS reservation policies such as Just-Enough-Time (JET), Just-In-Time (JIT), Burst Segmentation and Route-dependent Priorities. The accuracy of the model is confirmed by simulation and the various policies are compared.
Zvi Rosberg, Hai Le Vu 0001, Moshe Zukerman, Jolyon White
INFOCOM4
2003 Performance analyses of optical burst-switching networks
abstract
This paper provides a scalable framework for analysis and performance evaluation of optical burst-switching (OBS) networks. In particular, a new reduced load fixed point approximation model to evaluate blocking probabilities in OBS networks is introduced. The model is versatile enough to cover known OBS reservation policies such as just-enough-time, just-in-time, burst segmentation, and route-dependent priorities. The accuracy of the model is confirmed by simulation and the various policies are compared.
Zvi Rosberg, Hai Le Vu 0001, Moshe Zukerman, Jolyon White
IEEE J. Sel. Areas Commun.4