• Title/Summary/Keyword: Traffic Control Mechanism

Search Result 300, Processing Time 0.028 seconds

A call admission control in ATM networks using approximation technique for QOS estimation (ATM 망에서의 통화품질 평가를 위한 근사화 기법과 이를 이용한 호 수락 제어)

  • 안동명;한덕찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2184-2196
    • /
    • 1998
  • Admission control is one of the most important congestion control mechanism to be executed at the call set up phase by regulating traffic into a network in a preventive way. An efficient QOS evaluation or bandwidth estimation method is required for call admission to be decided in real time. In this paper, we spropose a computtionally simple approximation method of estimating cell loss probability and mean cell delay for admission control of both delay sensitive and loss sensitive calls. Mixed input queueing system, where a new call combines with the existing traffic, is used as a queueing model for QOS estimation. Also traffic parameters are suggested to characterize both a new call and existing traffic. Aggregate traffic is approximated by a renewal process with these traffic parameters and then mean delay and cell loss probability are detemined using appropriate approximation formulas. The accuracy of this approximation approach is examined by comparing their results with exact analysis or simulation results of vrious mixed unput queueing systems. Based on this QOS estimation method, call admission control scheme which is traffic independent and computable in yeal time are proposed.

  • PDF

Q-learning for intersection traffic flow Control based on agents

  • Zhou, Xuan;Chong, Kil-To
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.94-96
    • /
    • 2009
  • In this paper, we present the Q-learning method for adaptive traffic signal control on the basis of multi-agent technology. The structure is composed of sixphase agents and one intersection agent. Wireless communication network provides the possibility of the cooperation of agents. As one kind of reinforcement learning, Q-learning is adopted as the algorithm of the control mechanism, which can acquire optical control strategies from delayed reward; furthermore, we adopt dynamic learning method instead of static method, which is more practical. Simulation result indicates that it is more effective than traditional signal system.

  • PDF

A Slow Portscan Attack Detection and Countermove Mechanism based on Fuzzy Logic (퍼지 로직을 이용한 느린 포트스캔 공격 탐지 및 대응 기법)

  • Kim, Jae-Kwang;Yoon, Kwang-Ho;Lee, Seung-Hoon;Jung, Je-Hee;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.679-684
    • /
    • 2008
  • The slow port scan attack detection is the one of the important topics in the network security. We suggest an abnormal traffic control framework to detect slow port scan attacks using fuzzy rules. The abnormal traffic control framework acts as an intrusion prevention system to suspicious network traffic. It manages traffic with a stepwise policy: first decreasing network bandwidth and then discarding traffic. In this paper, we show that our abnormal traffic control framework effectively detects slow port scan attacks traffic using fuzzy rules and a stepwise policy.

A Study on the Performance Analysis for Partial Buffer Sharing Priority Mechanism with Two Thresholds (두개의 임계치를 갖는 부분 버퍼공유 우선도 방식의 성능 분석에 관한 연구)

  • 박광채;이재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.2
    • /
    • pp.381-389
    • /
    • 1994
  • In the communication network, multimedia service such as high quality voice, high speed data, image etc. will be added to the existing service. This service generates new requirements for the communication networks. The priority control mechanism can be used to control multimedia traffics generated by many communication systems. The priority mechanism which assigns prioirities to generated cells according to service quality is one of the traffic control. The priority assignment can be divided by priority criterion for each traffic characteristics such as loss sensitivity and delay sensitivity. In this paper, we alnalyzed the partial buffur sharing (PBS) mechani느 as a traffic control reducing the cell loss, and proposed analysis method. We analyzed the PBS mechanism using classical approach as a Markov chain. In order to validata proposed analysis method, simulation is performed using simulation package SIMSCRIPT 11.5. From this results, we confirmed that proposed analysis method can be verified. Also, we presented cell loss probability of ATM network when this results are to be applied to ATM networks.

  • PDF

Performance analysis of priority control mechanism with cell transfer ratio and discard threshold in ATM switch (ATM 스위치에서 폐기 임계치를 가진 셀전송비율 제어형 우선순위 제어방식의 성능 분석)

  • 박원기;김영선;최형진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.629-642
    • /
    • 1996
  • ATM switch handles the traffic for a wide range of appliations with different QOS(Quality-of-Service) requirements. In ATM switch, the priority control mechanism is needed to improve effectively the required QOS requirements. In this paper, we propose a priority control mechanism using the cell transfer ratio type and discard threshold in order to archive the cell loss probability requirement and the delay requirement of each service class. The service classes of our concern are the service class with high time priority(class 1) and the service class with high loss priority control mechanism, cells for two kind of service classes are stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the shole range of the buffer and cells for class 1 are allocated up to discard threshold of the buffer. In case cells in the buffer are transmitted, one cell for class 1 is transmitted whenever the maximum K cells for class 2 are transmitted consecutively. We analyze the time delay and the loss probability for each class of traffic using Markov chain. The results show that the characteristics of the mean cell delay about cells for class 1 becomes better and that of the cell loss probability about cells for class 2 becomes better by selecting properly discard threshold of the buffer and the cell transfer ratio according to the condition of input traffic.

  • PDF

A Modified Random Early Detection Algorithm: Fuzzy Logic Based Approach

  • Yaghmaee Mohammad Hossein
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.337-352
    • /
    • 2005
  • In this paper, a fuzzy logic implementation of the random early detection (RED) mechanism [1] is presented. The main objective of the proposed fuzzy controller is to reduce the loss probability of the RED mechanism without any change in channel utilization. Based on previous studies, it is clear that the performance of RED algorithm is extremely related to the traffic load as well as to its parameters setting. Using fuzzy logic capabilities, we try to dynamically tune the loss probability of the RED gateway. To achieve this goal, a two-input-single-output fuzzy controller is used. To achieve a low packet loss probability, the proposed fuzzy controller is responsible to control the $max_{p}$ parameter of the RED gateway. The inputs of the proposed fuzzy controller are 1) the difference between average queue size and a target point, and 2) the difference between the estimated value of incoming data rate and the target link capacity. To evaluate the performance of the proposed fuzzy mechanism, several trials with file transfer protocol (FTP) and burst traffic were performed. In this study, the ns-2 simulator [2] has been used to generate the experimental data. All simulation results indicate that the proposed fuzzy mechanism out performs remarkably both the traditional RED and Adaptive RED (ARED) mechanisms [3]-[5].

A Fair Multicast Congestion Control Mechanism based on the Designated Server (지정된 서버를 이용한 공정한 멀티캐스트 혼잡제어 메커니즘)

  • Oh, Jae-Hwan;Kum, Jung-Hyun;Chung, Kwang-Sue;Kim, Hwa-Sung
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.233-241
    • /
    • 2002
  • In this paper, we proposed a new mechanism that solves the fairness problem between unicast traffic using the TCP and multicast traffic using the UDP, and satisfies the requirement of various receivers fairly in the Internet. The proposed mechanism decentralizes the load of blanket transmission rate control from sender to designated server, and uses the method that talc designated server intercepts the sender's data and controls the transmission rate suitable for it's local network. Therefore, the proposed mechanism not only provides multicast service by accurate estimation of the network status of each receiver, but also realizes both the inter-session fairness and the intra-session fairness problem.

Design and Analysis of Ethernet Aggregation to XGMII Framing Procedure

  • Kim, You-Jin;Huh, Jae-Doo
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.331-334
    • /
    • 2005
  • This paper suggests the Ethernet aggregation to XGMII framing procedure (EAXFP) mechanism to economically combine the traffic adaptation technology with the link aggregation method in designing 10 Gigabit Ethernet (10 GbE) interfaces. This design sidesteps the data-loss issues that can result from designing an interface with only one link. The most critical issue in relation to the link aggregation interface is the algorithm used to control frame distribution between the ten ports. The proposed EAXFP mechanism offers an efficient link aggregation method as well as an efficient frame distribution algorithm, which maximize the throughout of the 10 GbE interface. In the experiment and analysis of the proposed mechanism, it was also discovered that the 10 GbE interface that uses the proposed EAXFP mechanism significantly reduced the packet loss rate. When there will be heavy traffic loads come about in the future, the proposed EAXFP mechanism assures an efficient and economical transmission performance on the router system.

  • PDF

Differentiated Channel Access Scheme for Assuring QoS of Medical Traffic in WLAN-based e-Healthcare Systems (무선랜 기반 e-Healthcare 시스템에서의 의료용 트래픽의 서비스 품질 보장을 위한 채널 접속 차별화 방안)

  • Kim, Young Boo;Park, Eun-Chan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.6
    • /
    • pp.676-688
    • /
    • 2014
  • The IEEE 802.11e EDCA (Enhanced Distributed Channel Access) mechanism has been proposed to improve the QoS (Quality of Service) of various services in WLANs (Wireless Local Area Networks). By differentiating the channel access delay depending on ACs (Access Categories), this mechanism can provide the relative service differentiation among ACs. In this paper, we consider that WLAN is deployed in medical environments to transfer medical traffic and we reveal that the quality of the medical traffic (in particular, ECG signals) is significantly deteriorated even with the service differentiation by IEEE 802.11e EDCA. Also, we analyze the reason for performance degradation and show that IEEE 802.11e EDCA has difficulty in protecting the transmission opportunity of high-priority traffic against low-priority traffic. In order to assure medical-grade QoS, we firstly define the service priority of medical traffic based on their characteristics and requirements, and then we propose the enhanced channel access scheme, referred to as DIFF-CW. The proposed scheme differentiates CW (Contention Window) depending on the service priority and modifies the channel access procedure for low-priority traffic. The simulation results confirm that the DIFF-CW scheme not only assures the QoS of medical traffic but also improves the overall channel utilization.

Interworking Architecture of ERICA Switch Mechanism for ABR Traffic Service in Public ATm Switch (ATM 공중망 스위치에서 ABR 트래픽을위한 ERICA 스위치 메커니즘과의 연동 구조)

  • Jeong, Il-Yeong;Gang, Seong-Yeol;Jeong, Taek-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.148-158
    • /
    • 1999
  • ABR traffic form ATM LAN is controlled through RM cell, and the interface function to public ATM network is necessary to provide ABR service efficiently. This paper presnets new interface architecture, which is based on "Projected Node" [6]. using AIPU(ABR Interface Proxy Unit) to support ABR traffic streams incoming from ATM LAN in the public ATM network. For the efficient interworking, the AIPU has designed for interworking functions with ERICA switch mechanism. Conventional ERICA switch mechanism specified in TM 4.0 is basically used for short distance comparative to public network, however AIPU adopts the novel control mechanism to cover logng roud trip time (RTT). To improve the problems and to provide a dynamic range of UCI(Update Count Interval), this paper proposes, a novel control scheme, DUCI ( Dynamic Update Count Interval. And the paper shows inefficiencies of ERICA mechanism with fixed UCI through the simulation results, and represents the performance enhancement of DUCI mechanism developed to adjust the update count interval dynamically.

  • PDF