• Title/Summary/Keyword: 트래픽 제어 알고리즘

Search Result 284, Processing Time 0.023 seconds

Platform Development for Home Network Device Security based on Zigbee (Zigbee 기반의 홈네트워크 기기 보안을 위한 플랫폼 개발)

  • Ko Hyung-Jun;Park Chae-Min;Ryu Dae-Hyun;Lee Sang-Jin
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2006.06a
    • /
    • pp.265-268
    • /
    • 2006
  • 본 논문에서는 댁내망에서 무선 홈네트워크 기기 제어에 있어서의 트래픽 암호화 및 기기인증 등의 보안 문제 연구를 위한 플랫폼을 개발하였다. 우선 근거리 무선 통신 표준으로 자리잡고 있는 Zigbee를 적용한 도어락과 저가의 홈게이트웨이를 개발하고 다양한 암호 알고리즘을 탑재할 수 있도록 하였다. 또한 AES와 HGHT를 탑재하여 기기인증과 트래픽에 대한 암호화가 가능하도록 하였다.

  • PDF

Real-Time Rate Control with Token Bucket for Low Bit Rate Video (토큰 버킷을 이용한 낮은 비트율 비디오의 실시간 비트율 제어)

  • Park, Sang-Hyun;Oh, Won-Geun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2315-2320
    • /
    • 2006
  • A real-time frame-layer rate control algorithm with a token bucket traffic shaper is proposed for low bit rate video coding. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better visual and PSNR performances than the existing rate control method.

A New Active RED Algorithm for Congestion Control in IP Networks (IP 네트워크에서 혼잡제어를 위한 새로운 Active RED 알고리즘)

  • Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.437-446
    • /
    • 2002
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF (Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED (Random Early Detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use static parameter setting. So, in case where these parameters do not match the requirement of the network load, the performance of these algorithms can approach that of a traditional Drop-tail. In this paper, in order to solve this problem, a new active queue management algorithm called ARED (Active RED) is proposed. ARED computes the parameter based on our heuristic method. This algorithm can effectively reduce packet loss while maintaining high link utilizations.

A Fast Multipoint-to-Point LSP Traffic Engineering for Differentiated Service in MPLS Networks (MPLS 망에서 차별화 된 서비스를 제공하기 위한 빠른 Multipoint-to-Point LSP 결정 방식)

  • Kim, Seong-Gwan;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.5
    • /
    • pp.232-242
    • /
    • 2002
  • In a MPLS(Multiprotocol Label Switching) network, it is important to reduce the number of labels and LSP(Lable Switched Path)s for network resource management. MTP(Multipoint-to-Point) LSP can be used to solve this problem. In consideration of traffic engineering, MTP LSP must be chosen to enhance the availability of network and link utilization. Also, a fast mechanism to setup MTP LSPs is required for rerouting capability against link failure. In this paper, we propose a fast MTP LSP traffic engineering of multipath MTP LSP by using a mapping of a MTP LSP upon Diffserv PHBs(Per Hop Behavior) in a Diffserv-capable MPLS network. In the proposed traffic engineering, we determine multiple MTP LSPs in a hierarchical manner according to the characteristics of different services. By using Monte-Carlo method for traffic load balancing process, it provides fast rerouting capability in case of frequent link failure across large network. Out method produces to be nearly optimal within reasonable run-times. It's time complexity is in O( Cn$^2$logn) as conventional multipath routing and it is much faster than Linear Programming approach. Simulation results show that the proposed traffic engineering can be controlled effectively in an administrative manner and enhance the availability of network in comparison with conventional multipath routing.

A Buffer Management Scheme for Throughput and Fairness Improvement in ATM Networks (ATM 망에서 수율 및 공평성 향상을 위한 효율적 버퍼관리 기법)

  • 김남희
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.5
    • /
    • pp.842-848
    • /
    • 2003
  • The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. In this paper, we propose a buffer management scheme which can improve the fairness and the throughput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

  • PDF

A Study on Efficient Cell Queueing and Scheduling Algorithms for Multimedia Support in ATM Switches (ATM 교환기에서 멀티미디어 트래픽 지원을 위한 효율적인 셀 큐잉 및 스케줄링 알고리즘에 관한 연구)

  • Park, Jin-Su;Lee, Sung-Won;Kim, Young-Beom
    • Journal of IKEEE
    • /
    • v.5 no.1 s.8
    • /
    • pp.100-110
    • /
    • 2001
  • In this paper, we investigated several buffer management schemes for the design of shared-memory type ATM switches, which can enhance the utilization of switch resources and can support quality-of-service (QoS) functionalities. Our results show that dynamic threshold (DT) scheme demonstrate a moderate degree of robustness close to pushout(PO) scheme, which is known to be impractical in the perspective of hardware implementation, under various traffic conditions such as traffic loads, burstyness of incoming traffic, and load non-uniformity across output ports. Next, we considered buffer management strategies to support QoS functions, which utilize parameter values obtained via connection admission control (CAC) procedures to set tile threshold values. Through simulations, we showed that the buffer management schemes adopted behave well in the sense that they can protect regulated traffic from unregulated cell traffic in allocating buffer space. In particular, it was observed that dynamic partitioning is superior in terms of QoS support than virtual partitioning.

  • PDF

Adaptive Macroblock Quantization Method for H.264 Codec (H.264 코덱을 위한 적응적 매크로블록 양자화 방법)

  • Park, Sang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1193-1200
    • /
    • 2010
  • This paper presents a new adaptive macroblock quantization algorithm which generates the output bits corresponding to the target bit budget. The H.264 standard uses various coding modes and optimization methods to improve the compression performance, which makes it difficult to control the amount of the generated traffic accurately. In the proposed scheme, linear regression analysis is used to analyze the relationship between the bit rate of each macroblock and the quantization parameter and to predict the MAD values. Using the predicted values, the quantization parameter of each macroblock is determined by the Lagrange multiplier method and then modified according to the difference between the bit budget and the generated bits. It is shown by experimental results that the new algorithm can generate output bits accurately corresponding to the target bit rates.

An Effective Threshold based Call Admission Control in ATM Networks (ATM망에서 효율적인 문턱 값 기반 호 수락 제어)

  • Kim Sang Chul;Ko Sung-Taek
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.2
    • /
    • pp.97-104
    • /
    • 2000
  • Effective call admission control is desirable to control an ATM traffics. It should provide high fairness and utilization for different kinds of services during call admission. Complete bandwidth sharing method is efficient for utilization of bandwidth but not efficient for fairness of call admission. Complete bandwidth partitioning method is efficient for fairness but not efficient for utilization. We propose a new CST(Complete Sharing with Threshold) algorithm using threshold on a total link to improve fairness and utilization.

  • PDF

A Cooperative Spectrum Sensing and Dynamic Spectrum Decision Methods for Heterogeneous Cognitive Radio Network (이종 인지 라디오 네트워크에서 협력 스펙트럼 센싱 및 동적 스펙트럼 결정 방법)

  • Kim, Nam-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7A
    • /
    • pp.560-568
    • /
    • 2012
  • Spectrum sensing and spectrum decision are the main functions that cognitive radios (CRs) have to perform in order to get the best available spectrum band for the establishment of a wireless communication. These problems are worsened in the presence of users with different demands and spectrum channels with different properties in a heterogeneous network. The primary objective in this work is to design and simulate a new spectrum decision algorithm for heterogeneous cognitive radio system. To this end, first, we consider all cognitive users are separated into different traffic classes according to their Quality of Service (QoS). The cognitive users within one traffic class perform spectrum sensing in centralized group-based cooperative spectrum sensing system and the users of different traffic classes share the sensing results. Second, we propose a novel use of the Analytic Hierarchy Process (AHP) to optimally select available bands according to user requirements and detected spectrum channel characteristics (SCC). In this paper, utility function is used as spectrum decision algorithm. Simulation results demonstrate that the proposed method shows can effectively select the best available spectrum channels with a low complexity.