Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic

Hyon Young Choi, Sung-Gi Min

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Adaptive REM(AREM) is proposed to support real time traffic from non real time traffic in routers. In AREM, we classify the traffics into real time flows and non real time flows and the marking probability of non real time traffic is increased proportional to the amount of protected real time traffic until the marking probability reaches its maximum limit. Our simulation result shows that AREM provides improved overall performance to real time traffic in a sense of low loss rate and bounded delay.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages385-390
Number of pages6
Volume4308 LNCS
DOIs
Publication statusPublished - 2006 Dec 1
Event8th International Conference on Distributed Computing and Networking, ICDCN 2006 - Guwahati, India
Duration: 2006 Dec 272006 Dec 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4308 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Conference on Distributed Computing and Networking, ICDCN 2006
CountryIndia
CityGuwahati
Period06/12/2706/12/30

Fingerprint

Enhancement
Traffic
Routers
Flow Time
Router
Policy
Directly proportional
Classify
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Choi, H. Y., & Min, S-G. (2006). Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4308 LNCS, pp. 385-390). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4308 LNCS). https://doi.org/10.1007/11947950_43

Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic. / Choi, Hyon Young; Min, Sung-Gi.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4308 LNCS 2006. p. 385-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4308 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, HY & Min, S-G 2006, Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4308 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4308 LNCS, pp. 385-390, 8th International Conference on Distributed Computing and Networking, ICDCN 2006, Guwahati, India, 06/12/27. https://doi.org/10.1007/11947950_43
Choi HY, Min S-G. Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4308 LNCS. 2006. p. 385-390. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11947950_43
Choi, Hyon Young ; Min, Sung-Gi. / Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4308 LNCS 2006. pp. 385-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3137b94e554848039f23ff08083b8834,
title = "Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic",
abstract = "Adaptive REM(AREM) is proposed to support real time traffic from non real time traffic in routers. In AREM, we classify the traffics into real time flows and non real time flows and the marking probability of non real time traffic is increased proportional to the amount of protected real time traffic until the marking probability reaches its maximum limit. Our simulation result shows that AREM provides improved overall performance to real time traffic in a sense of low loss rate and bounded delay.",
author = "Choi, {Hyon Young} and Sung-Gi Min",
year = "2006",
month = "12",
day = "1",
doi = "10.1007/11947950_43",
language = "English",
isbn = "9783540681397",
volume = "4308 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "385--390",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Performance enhancement in REM using adaptive drop policy for protective and best-effort traffic

AU - Choi, Hyon Young

AU - Min, Sung-Gi

PY - 2006/12/1

Y1 - 2006/12/1

N2 - Adaptive REM(AREM) is proposed to support real time traffic from non real time traffic in routers. In AREM, we classify the traffics into real time flows and non real time flows and the marking probability of non real time traffic is increased proportional to the amount of protected real time traffic until the marking probability reaches its maximum limit. Our simulation result shows that AREM provides improved overall performance to real time traffic in a sense of low loss rate and bounded delay.

AB - Adaptive REM(AREM) is proposed to support real time traffic from non real time traffic in routers. In AREM, we classify the traffics into real time flows and non real time flows and the marking probability of non real time traffic is increased proportional to the amount of protected real time traffic until the marking probability reaches its maximum limit. Our simulation result shows that AREM provides improved overall performance to real time traffic in a sense of low loss rate and bounded delay.

UR - http://www.scopus.com/inward/record.url?scp=84885196565&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885196565&partnerID=8YFLogxK

U2 - 10.1007/11947950_43

DO - 10.1007/11947950_43

M3 - Conference contribution

SN - 9783540681397

VL - 4308 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 385

EP - 390

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -