Cited by 20Network Traffic and Congestion ControlWireless Communication Networks ResearchNeural Networks and Applications

Neural-network connection-admission control for ATM networks

Cheng, R.-G., Chang, C.-J.·1997·IEE Proceedings - Communications

Abstract

ATM connection-admission control (CAC) using neural networks offers improvement over conventional CAC but creates some difficulties in real operation, such as complicated training processes. This is because ATM traffic characteristics are quite diverse, and quality of service (QoS) and bandwidth requirements vary considerably. A neural-network connection-admission control (NNCAC) method which can overcome these difficulties by preprocessing neural-network input parameters is proposed. The NNCAC method introduces a unified metric for input-traffic parameters by utilising robust analytical results of the equivalent-capacity method. It diminishes the estimation error of the equivalent-capacity method, due to modelling, approximation and unpredictable statistical fluctuations of the system, by employing the learning capability of a neural network. The method further considers the congestion status parameter and the cell loss probability, which provides insight information about the system. Simulation results revealed that the proposed NNCAC method provided a 20% system-utilisation improvement over Hiramatsu's neural-network CAC scheme and a 10% system-utilisation improvement over the fuzzy-logic-based CAC scheme, while maintaining QoS contracts. It was also found that the NNCAC method provided utilisation comparable with that of the NFCAC scheme but possessed a lower cell loss probability. NNCAC is suitable for designers who are not familiar with fuzzy-logic control schemes or have no ideas about the requisite knowledge of CAC.

Integrity signals

Registry

Crossref · 10.1049/ip-com:19971088

Cites

16 of 16 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?

  • Cheng and Chang achieve a 20% improvement over Hiramatsu using a congestion-status parameter, a cell-loss probability, and three traffic parameters.

    “Cheng and Chang [95] use a congestion-status parameter, a cell-loss probability, and three traffic parameters, including peak bitrate, average bitrate, and mean peak-rate duration, to achieve a 20% improvement over Hiramatsu.”
  • Admission control has leveraged ML extensively in a variety of networks, including ATM networks, wireless networks, cellular networks, ad hoc networks, and next generation networks.

    “As shown in Table 14, Admission control has leveraged ML extensively in a variety of networks, including ATM networks [95,189,190], wireless networks [8,36,359], cellular networks [66,67,281,372,458], ad hoc networks [452], and next generation networks [311].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Cheng, R.-G., & Chang, C.-J.
Affiliations
National Yang Ming Chiao Tung University (TW)
Venue
IEE Proceedings - Communications
Published
1997
Volume
144
Issue
2
Pages
93
ISSN
1350-2425 (ISSN-L)
OpenAlex
W1970497634
Cited by
20
References
16
Citations by year
2022: 2 · 2020: 1 · 2019: 1 · 2018: 1 · 2016: 2
FWCI
1.89
Type
journal article
Language
en
Open access
closed
Locations
IEE Proceedings - Communications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
call admission control, ATM networks, artificial neural networks, cell loss probability, quality of service, fuzzy logic control

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