• Title/Summary/Keyword: Network traffic control

검색결과 1,094건 처리시간 0.03초

Scalable Network Architecture for Flow-Based Traffic Control

  • Song, Jong-Tae;Lee, Soon-Seok;Kang, Kug-Chang;Park, No-Ik;Park, Heuk;Yoon, Sung-Hyun;Chun, Kyung-Gyu;Chang, Mi-Young;Joung, Jin-Oo;Kim, Young-Sun
    • ETRI Journal
    • /
    • 제30권2호
    • /
    • pp.205-215
    • /
    • 2008
  • Many control schemes have been proposed for flow-level traffic control. However, flow-level traffic control is implemented only in limited areas such as traffic monitoring and traffic control at edge nodes. No clear solution for end-to-end architecture has been proposed. Scalability and the lack of a business model are major problems for deploying end-to-end flow-level control architecture. This paper introduces an end-to-end transport architecture and a scalable control mechanism to support the various flow-level QoS requests from applications.

  • PDF

계층분석법을 이용한 교차로망의 신호 제어 (A Study on Control of Traffic Network Signal Control using Analytic Hierachy Process)

  • 진현수
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2007년도 춘계학술대회 학술발표 논문집 제17권 제1호
    • /
    • pp.421-428
    • /
    • 2007
  • 본 논문은 퍼지 계층분석법을 이용하여 교통신호의 교차로망에서의 적합성에 대해서 논의한다. 교차로망에서의 교통신호는 현시, 주기등이 단일 교차로망의 교통신호 대안이라고 한다면 교차로 망에서의 교통신호 대안은 앞에 있는 교차로의 통행차량수와 지체차량수등 2개 이상의 교차로망의 상대적인 대안을 제시하여야 하므로 단일교차로의 교통신호 대안과는 다른 모습을 띠고 있다. 교통신호체계는 고정신호체계, 최적신호체계, 퍼지응용신호체계를 구별하여 응용단계가 높은 신호체계가 적합성이 톨음을 퍼지계층분석법을 이용하여 밝히고 이를 이용 새로운 체계의 교통신호 체계도 재시한다.

  • PDF

Performance Analysis of ABR Congestion Control Algorithm using Self-Similar Traffic

  • Kim, Dong-Il;Jin, Sung-Ho
    • Journal of information and communication convergence engineering
    • /
    • 제2권1호
    • /
    • pp.15-21
    • /
    • 2004
  • One of the most important issues in designing a network and realizing a service is dealing with traffic characteristics. Recent experimental research on LAN, WAN, and VBR traffic properties has highlighted that real traffic specificities can not be displayed because the current models based on the Poisson assumption under estimate the long range dependency of network traffic and self-similar peculiarities. Therefore, a new approach using self-similarity characteristics as a real traffic model was recently developed. In This paper we discusses the definition of self-similarity traffic. Moreover, real traffic was collected and we generated self-similar data traffic like real traffic to background load. On the existing ABR congestion control algorithm transmission throughput with the representative ERICA, EPRCA and NIST switch algorithm show the efficient reaction about the burst traffic.

MPLS Traffic Engineering의 표준 기술 (MPLS Traffic Engineering of standard skill)

  • 김강;전종식;김하식
    • 한국컴퓨터정보학회논문지
    • /
    • 제6권4호
    • /
    • pp.68-73
    • /
    • 2001
  • MPLS(Multi protocol Label Switching)는 Network Traffic 흐름의 속도를 높이고 관리하기 쉽게 하기 위한 표준 기술이다. MPLS는 정해진 Pack 열에 특정 경로를 설정하는 것에 관여하고, 각 Pack 내에는 라벨이 있어 Router 입장에서는 그 Pack을 전달할 노드의 주소를 확인하여 소요시간을 절약한다. MPLS는 IP, ATM및 프레임 릴레이 Network protocol 등과 같이 작동한다. MPLS는 Network OSI 참조모델과 함께 3Layer가 아닌 Switching을 하는 2Layer에서 대부분의 Pack이 전달되게 한다. MPLS는 Traffic을 빠르게 움직이게 하며, QoS를 위한 Network관리를 쉽게 한다. 이런 이유에 MPLS 기술은 더 많고 특정한 Traffic을 전송하기 시작한 Network로 채택될 유망한 기술로 기대되고 있다.

  • PDF

An Efficient Priority Based Adaptive QoS Traffic Control Scheme for Wireless Access Networks

  • Kang Moon-sik
    • 한국통신학회논문지
    • /
    • 제30권9A호
    • /
    • pp.762-771
    • /
    • 2005
  • In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

무선 홈 IoT 서비스를 위한 적응형 트래픽 간섭제어 시스템 (An Adaptive Traffic Interference Control System for Wireless Home IoT services)

  • 이종득
    • 디지털융복합연구
    • /
    • 제15권4호
    • /
    • pp.259-266
    • /
    • 2017
  • 무선 홈 IoT (Internet of Things)상에서 대용량 트래픽 간섭은 패킷 손실의 원인이 되며, 패킷 손실은 무선 홈 네트워크의 QoS와 처리율을 떨어뜨린다. 본 논문에서는 실시간 트래픽과 비실시간 트래픽을 탐지하여 무선 홈 IoT 서비스의 QoS 및 처리율을 향상시키기 위한 새로운 적응형 트래픽 간섭 제어 시스템, ATICS(Adaptive Traffic Interference Control System)을 제안한다. 제안된 시스템은 트래픽 특성에 따라 단기(short term) 트래픽 혼잡 프로세스와 장기(long-term) 트래픽 혼잡 프로세스로 구분하여 트래픽 간섭을 제어한다. 시뮬레이션 결과 제안된 기법은 다른 비교 기법들에 비해서 트래픽 간섭 제어 성능 척도가 더 효율적임을 보인다.

인터넷 액세스점에서의 이상 트래픽 제어기 성능분석 (Analysis of abnormal traffic controller deployed in Internet access point)

  • 김광식
    • 한국통신학회논문지
    • /
    • 제30권1C호
    • /
    • pp.107-115
    • /
    • 2005
  • 본 논문에서는 네트워크의 생존성을 보장하고 신뢰성 높은 인터넷 서비스를 제공하기 위한 차세대 보안기술로서 인터넷의 액세스점에 위치하는 이상 트래픽 제어기(ATC, Abnormal Traffic Controller)를 제안한다. ATC의 주요 개념은 이상 트래픽 감지와 트래픽 제어기술에 있는데, 네트워크에서 에러의 요인이 계속 존재하거나 반복되는 경우 이상 트래픽 제어를 통해 서비스 완료성을 가능한 보장하는 것을 그 목적으로 한다. 분석결과, 이상 트래픽 중 유효 트래픽의 비율이 $30{\%}$를 초과하는 경우에는 이상 트래픽에 대한 제어정책을 사용하는 ATC는 기존의 네트워크 노드 뿐만 아니라 차단정책을 사용하는 ATC보다 우수한 성능을 나타내었다. 과다 트래픽의 알려지지 않은 공격이 발생하는 경우, 높은 오탐지율로 인해 기존의 네트워크 IDS로는 한계가 있는데, 이러한 환경에서 ATC는 네트워크 노드를 도와서 이상 트래픽을 제어하는데 주요한 역할을 수행하게 된다.

A New Architecture to Offload Network Traffic using OpenFlow in LTE

  • Venmani, Daniel Philip;Gourhant, Yvon;Zeghlache, Djamal
    • 한국산업정보학회논문지
    • /
    • 제17권1호
    • /
    • pp.31-38
    • /
    • 2012
  • Next generation cellular applications and smart phone usage generate very heavy wireless data traffic. It becomes ineluctable for mobile network operators to have multiple core network entities such as Serving Gateway and Packet Data Network Gateway in 4G-LTE to share this high traffic generated. A typical configuration consists of multiple serving gateways behind a load-balancer which would determine which serving gateway would service a end-users'request. Such hardware is expensive, has a rigid policy set, and is a single point of failure. Another perspective of today's increasingly high data traffic is that besides it is being widely accepted that the high bandwidth L TE provides is creating bottlenecks for service providers by the increasing user bandwidth demands without creating any corresponding revenue improvements, a hidden problem that is also passively advancing on the newly emerging 4G-LTE that may need more immediate attention is the network signaling traffic, also known as the control-plane traffic that is generated by the applications developed for smartphones and tablets. With this as starting point, in this paper, we propose a solution, by a new approach considering OpenFlow switch connected to a controller, which gains flexibility in policy, costs less, and has the potential to be more robust to failure with future generations of switches. This also solves the problem of scaling the control-plane traffic that is imperative to preserve revenue and ensure customer satisfaction. Thus, with the proposed architecture with OpenFlow, mobile network operators could manipulate the traffic generated by the control-plane signaling separated from the data-plane, besides also reducing the cost in installing multiple core-network entities.

Priority-based Scheduling Policy for OpenFlow Control Plane

  • Kasabai, Piyawad;Djemame, Karim;Puangpronpitag, Somnuk
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.733-750
    • /
    • 2019
  • Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.

Combined Traffic Signal Control and Traffic Assignment : Algorithms, Implementation and Numerical Results

  • Lee, Chung-Won
    • 대한교통학회:학술대회논문집
    • /
    • 대한교통학회 2000년도 제37회 학술발표회논문집
    • /
    • pp.89-115
    • /
    • 2000
  • Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

  • PDF