• Title/Summary/Keyword: Diff-Serv

Search Result 196, Processing Time 0.023 seconds

Wireless Packet Scheduling Algorithm for Delay Proportional Internet Differentiated Services (무선 망에서의 지연 비례 인터넷 차별화 서비스 제공을 위한 스케줄링 알고리즘)

  • 유상조;이훈철
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.6
    • /
    • pp.225-236
    • /
    • 2003
  • In this paper, we propose a wireless scheduling algorithm to provide the Internet delay proportional differentiated services in wireless networks. For considering network environments that have burst and location-dependent channel errors, our proposed WDPS(Wireless Delay Proportional Service) scheduling algorithm adaptively serves packets in class queues based on the delivered delay performance for each class. The remarkable characteristics of WDPS scheduler are supporting a fair relative delay service, providing graceful throughput and delay compensation, and avoiding class queue blocking problem. Through simulations, we show that the algorithm achieves the desirable properties to provide delay proportional services in wireless networks.

An Adaptive Drop Marker for Edge Routers in DiffServ Networks

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.411-419
    • /
    • 2011
  • In this paper, we propose an Adaptive Regulating Drop (ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services (ASs) without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate (TPR) for aggregate TCP flows. The TPR is set larger than the current input IN packet rate of aggregate TCP flows while inversely proportional to the measured input OUT packet rate. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, the ARD marker performs random early fair remarking of their excessive IN packets to OUT packets at the aggregate flow level according to the TPR. In addition, an aggregate dropper is combined to drop some excessive IN packets fairly and constantly according to the TPR. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

Process for Identifying QoS Requirements in the Multi-Domain Operations Environment (Multi-Domain Operation Environment QoS 소요식별 절차)

  • Park, Dongsuk;Cho, Bongik;Park, Taehyung;Lim, Jaesung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.25 no.2
    • /
    • pp.177-186
    • /
    • 2022
  • A network QoS model for the joint integrated C4I structure was proposed for the integration of network infrastructure and network operations(NetOps) for NCOE. Detailed QoS requirements process of the joint integrated C4I systems are needs in the Multi-Domain Operation Environment(MDOE). A process is proposed for identifying QoS requirements and establishing in the MDOE using JMT(Joint Mission Thread) reference architecture and solution architecture. Mission analysis identify JCOAs(Joint Critical Operational Activities) and related activities based on JMT & System architecture's OVs, and Information analysis identify QoS attributes using System architecture's SVs. Identifying QoS attributes will be registered at PPS Registry by pre-regulated process, and will be set-up by NetOps. MDOE QoS requirement Process will support efficiently MUM-T and smart defense platform users under the future uncertain battlefield circumstances.

Implementation of Absolute Delay Differentiation Scheme in Next-Generation Networks (차세대 네트워크에서의 절대적 지연 차별화 기능 구현)

  • Paik, Jung-Hoon;Kim, Dae-Ub;Joo, Bheom-Soon
    • 전자공학회논문지 IE
    • /
    • v.45 no.1
    • /
    • pp.15-23
    • /
    • 2008
  • In this paper, an algorithm, that provisions absolute differentiation of packet delays is proposed, simulated, and implemented with VHDL on XPC 860 CPU based test board with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through both simulation and the real traffic test on the board that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

A Modified REDP Aggregate Marker for improving TCP Fairness of Assured Services

  • Hur Kyeong;Eom Doo-Seop;Tchah Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1B
    • /
    • pp.86-100
    • /
    • 2004
  • To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

Flow-Based WTP Scheduler for Proportional Differentiated Services in Wireless Communication Systems (무선통신 시스템에서의 비례지연서비스를 위한 플로우 기반 WTP 스케쥴러)

  • Park Hyosoon;Kwon Eunhyun;Kim Taehyoun;Lee Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7B
    • /
    • pp.433-439
    • /
    • 2005
  • In this paper, we propose a Flow Based Waiting Time Priority (FB-WTP) scheduler that supports the proportional delay differentiated services between classes. Existing scheduling algorithms utilize the configuration of scheduler, which is operated as class unit, applied to wired network. However, FB-WTP scheduler is operated as flow unit and can take advantage of multi-flow diversity effect in time-varying channel state environment. As a result, FB-WTP improves the average queueing delay on each class as well as supporting the average queueing delay ratio between classes. It also solves the HOL packet blocking problem implicitly. Simulation results show that FB-WTP scheduler has better system queueing delay performance than Look-ahead Waiting Time Priority (LWTP) scheduler and supports the larger queueing delay ratio between classes that network operator set.

A Study on QoS Performance Based on CBQ Using Real-time Transport Protocol (RTP를 이용한 CBQ기반의 QoS 성능에 관한 연구)

  • 하미숙;박승섭
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2004.04a
    • /
    • pp.43-48
    • /
    • 2004
  • RTP that is proposed supplement of real-time services on internet environment, as Real-time Transport Protocol, is the protocol that for the purpose of sending data of stream type. RTP and RTCP(Real-time Transport Control Protocol) basically work at the same time, RTCP serves with state information of network at present. RTP has important properties of a transport protocol that runs on end-to-end systems and provides demultiplexing. It also offer reliability and protocol-defined flow/congestion control that transport protocol like TCP can not provides. In this paper, we look around concept and construction of Differentiated sen1ice tint run on RTP and by setting parameters of packet transfer method be used CBQ(Class-Based Queuing) for packet transfer on Differentiated service, each service queue controls properly through packet scheduling method, such as WRR(Weighted Round Robin) and PRR(Packet-by-packet Round Robin) all service classes do not experience the starvation and confirm the performance through computer simulation to achieve fairly scheduling.

  • PDF

Performance Analysis of REDP Marker with a combined Dropper for improving TCP Fairness of Assured Services

  • Kyeong Hur;Lee, Yeonwoo;Cho, Choon-Gen;Park, Hyung-Kun;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.711-721
    • /
    • 2004
  • To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as fur UDP sources. In this paper, to improve TCP fairness of the REDP marker, we combine a dropper with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays In demotion region without incoming demoted in-profile packets. It performs a dropping in the demotion at a domain boundary only if there is no prior demotion. The concatenate dropping at multiple domains is avoided to manifest the effect of a dropping at a domain boundary on TCP fairness. We experiment with the REDP marker with the combined dropper using ns2 simulator for TCP sources. The simulation results show that the REDP marker with the combined dropper improves TCP fairness in demoting and promoting packets by generating fair demoted in-profile traffic compared to the REDP marker. The effectiveness of the selected drop probability is also investigated with showing its impact on the performance of the REDP marker with the combined dropper.

Bandwidth Dimensioning for High-Speed Internet Access Networks (초고속인터넷 가입자망의 대역설계)

  • Lee, Tae-Joon;Lee, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1017-1027
    • /
    • 2006
  • Recently, Internet service providers are offering triple play service which combines voice and video services with the existing high speed Internet service under the common network infrastructure of IP protocol, so that they can create more benefit from operating a single network architecture. In line with this movement in the convergence of network and services, in this work we propose a bandwidth dimensioning method for the subscriber network of the IP network at flow level. To that purpose, let us propose a series of bandwidth dimensioning methods: bandwidth for best effort service only, bandwidth dimensioning for premium services, and bandwidth dimensioning schemes for the premium Internet services as well as the best effort service which comprise the TPS. Our link dimensioning method is based on the flow level that incorporates the flow blocking probability as a measure of grade of services(GoS), and investigates the characteristics of the proposed methods via extensive numerical experiments. After that, let us carry out a simulation experiment concerning the delay and loss performance of the packet scheduling for the premium services (QoS) using the bandwidth designed by our proposed method, via which the packet level quality of service (QoS) for the proposed link dimensioning method can be observed.

ADesign and Implementation of Policy-based Network Management System for Internet QoS Support Mobile IP Networks (인터넷 QoS 지원 이동 IP 망에서의 정책기반 망 관리 시스템 설계 및 구현)

  • 김태경;강승완;유상조
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.192-202
    • /
    • 2004
  • In this paper we have proposed policy-based network management system architecture for Internet QoS support Mobile IP networks that is divided into four layers(application layer, information management layer, policy control layer, device layer), then we propose an implementation strategy of policy-based network management system to enforce various control and network management operations and a model of policy server using SCOPS(Simple Common Open Policy Service) protocol that is developed in this research. For policy-based mobile IP network management system implementation, we have derived four policy classes(access control, mobile IP operation, QoS control, and network monitoring) and we showed operation procedures for each policy scenarios. Finally we have implemented Internet QoS support policy-based mobile IP network testbed and management system and verified out DiffServ policy enforcement behaviors for a target class service that is arranged a specific bandwidth on network congestion conditions.