Cited by 40Network Traffic and Congestion ControlAdvanced Optical Network TechnologiesSoftware-Defined Networks and 5G

Loss classification in optical burst switching networks using machine learning techniques: improving the performance of TCP

Jayaraj, A., Venkatesh, T., Murthy, C.S.R.·2008·IEEE Journal on Selected Areas in Communications

Abstract

Optical burst switching (OBS) is considered as a contending technology for the core of the Internet in future. However, due to lack of the buffers, losses occur due to contention among simultaneously arriving bursts at the core nodes. Contention losses do not necessarily indicate a situation of congestion in the network. Thus differentiation (classification) of losses is essential in many applications to avoid false identification of congestion. In this paper, we propose a loss classification technique for the OBS networks based on machine learning techniques. We devise a new measure to differentiate between congestion and contention losses, which is derived from the observed losses, called the number of bursts between failures (NBBF). We observe that the NBBF follows a Gaussian distribution with different parameters for contention and congestion losses. This feature is used in differentiation. We use both a supervised learning technique (hidden Markov model (HMM)) and an unsupervised learning technique (expectation maximization (EM) clustering) on the observed losses and classify them into a set of states (clusters) after which an algorithm differentiates between the congestion and contention losses. We also demonstrate the use of loss differentiation in improving the performance of transport control protocol (TCP) over OBS networks. We modify congestion control mechanism of TCP suitably to arrive at two variants of TCP, HMM-TCP and EM-TCP. Their performance is compared with TCP NewReno, TCP SACK, and Burst TCP (X. Yu et al., Mar. 2004). Simulation results demonstrate the effectiveness and accuracy of the loss classification technique in different network scenarios.

Integrity signals

Registry

Crossref · 10.1109/jsacocn.2008.033508

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Jayaraj, A., Venkatesh, T., & Murthy, C. S. R.
Affiliations
Indian Institute of Technology Madras (IN)
Venue
IEEE Journal on Selected Areas in Communications
Published
2008-08
Volume
26
Issue
6
Pages
45-54
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2137166796
Cited by
40
References
20
Citations by year
2024: 1 · 2023: 3 · 2022: 3 · 2021: 6 · 2020: 5 · 2019: 3 · 2018: 8 · 2017: 1 · 2016: 4 · 2014: 1 · 2013: 1 · 2012: 2
FWCI
1.09
Type
journal article
Language
en
Open access
closed
Locations
IEEE Journal on Selected Areas in Communications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Optical Network Technologies
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
Keywords
optical burst switching, loss classification, congestion loss, hidden Markov models, expectation-maximization clustering, TCP congestion control, bursty traffic, optical core networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review