• Title/Summary/Keyword: IP Packet Scheduler

Search Result 9, Processing Time 0.026 seconds

A study on uplink QoS packet scheduler for VoIP service in IEEE 802.16 systems (IEEE 802.16 시스템에서 VoIP 서비스를 위한 역방향 링크 QoS 패킷 스케줄러에 대한 연구)

  • Jang, Jae-Shin;Lee, Jong-Hyup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.1
    • /
    • pp.145-152
    • /
    • 2009
  • IEEE 802.16e standard, a kind of WMAN standard, was established to support data services with cheaper cost to mobile users than traditional mobile communications system and wireless LAN system can do. In this paper, we propose an uplink QoS packet-scheduler for VoIP service which can be installed in IEEE 802.16 system and evaluate its performance with NS-2 network simulator. The proposed QoS packet-scheduler consists of three procedures: determining scheduler interval, determining the amount of resource assignment, and deciding which mobile station the base station should serve first among multiple mobile stations. According to numerical results, the proposed QoS packet-scheduler can provide more increased system capacity by 220% than UGS service scheme does and by 25 % than ertPS service scheme does.

End-to-End QoS Enhancement in Mobile WiMAX Systems (모바일 와이맥스 시스템에서의 종단간 서비스 품질 향상)

  • Choo, Sang-Min;Oh, Sung-Min;Cho, Sung-Hyun;Kim, Jae-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.415-424
    • /
    • 2008
  • In this paper, we compare the QoS performance enhancement schemes according to the network architecture of mobile WiMAX system in order to improve the end-to-end QoS performance and propose QoS parameter mapping method and IP packet scheduling algorithm. To evaluate the end-to-end QoS performance, we implemented an end-to-end simulator of mobile WiMAX system using OPNET. Simulation results show that the proposed QoS parameter mapping scheme reduces the average delay of VoIP packet and improves uplink resource efficiency. And also, when the proposed IP packet scheduling algorithm is applied to the system, the end-to-end packet transmission delay of VoIP service can be reduced by 44-67 percent compared to FIFO and WRR scheduler.

Capacity Evaluation of VoIP Service over HSDPA with Frame-Bundling (HSDPA 시스템에서 Frame-Bundling을 채용한 VoIP 서비스 용량 평가)

  • Hwang, Jong-Yoon;Kim, Yong-Seok;Whang, Keum-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3B
    • /
    • pp.161-167
    • /
    • 2007
  • In this paper, we evaluate the capacity of voice over internet protocol (VoIP) services over high-speed downlink packet access (HSDPA), in which frame-bundling (FB) is incorporated to reduce the effect of relatively large headers in the IP/UDP/RTP layers. Also, a modified proportional pair (PF) packet scheduler design supporting for VoIP service is provided. The main focus of this work is the effect of FB on system outage based on delay budget in radio access networks. Simulation results show that VoIP system performance with FB scheme is highly sensitive to delay budget. We also conclude that HSDPA is attractive for transmission of VoIP if compared to the circuit switched (CS) voice that is used in WCDMA (Release'99).

Downlink Wireless Adaptive Modulation and Coding Scheme (AMC)-based Priority Queuing Scheduling Algorithm for Multimedia Services

  • Park, Seung-Young;Kim, Dong-Hoi
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1622-1631
    • /
    • 2007
  • To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

  • PDF

A Weighted Fair Queuing Scheduler Guaranteeing Differentiated Packet Loss Rates (차별화된 패킷 손실률을 보장하는 가중치 기반 공정 큐잉 스케줄러)

  • Kim, Tae Joon
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.12
    • /
    • pp.1453-1460
    • /
    • 2014
  • WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.

A architecture and control method of Streaming Packet Scheduler at 100bps for Guaranteed QoS of Internet and Broadcasting Services (인터넷 및 방송서비스의 QoS 보장을 위한 10Gbps급 스트리밍 패킷 스케줄러 구조 및 제어방법)

  • Kim Kwang-Ok;Park Wan-Ki;Choi Byeoun-Chul;Kwak Dong-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.23-34
    • /
    • 2004
  • This paper presents architecture and control method of packet scheduler to guarantee QoS of high quality streaming services in high-speed packet-switched networks. Since streaming services need far more stringent QoS requirements than the typical sort of burst data applications, they should be guaranteed minimum bandwidth and end-to-end delay bound to each flow, regardless of the behavior of other flows. To meet these requirements, a packet scheduler isolate a flow from the undesirable effects of other flows and provides end-to-end delay guarantees for individual flow and divides stringently the available link bandwidth among flows sharing the link. Until now, many vendors are developing traffic management chips running at 10Gbps, but most of chips have drawbacks to support high quality streaming services. In this paper, we investigate the drawbacks of commercial TM chips and traffic characteristic of streaming services and present implementation frameworks of the proposed packet scheduler. Finally, we analyze the simulation results of the proposed scheduler.

A Scheduling of Switch Ports for IP Forwarding (IP 포워딩을 위한 스위치 포트 스케쥴링)

  • Lee, Chae-Y.;Lee, Wang-Hwan;Cho, Hee-K.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.2
    • /
    • pp.233-239
    • /
    • 1999
  • With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

  • PDF

Study of Dynamic Scheduler that use Policy Daemon of COS base in Hight Speed Ethernet Switch (Hight Speed Ethernet Switch 에서 COS기반의 Policy Daemon을 이용한 Dynamic Scheduler 에 대한 연구)

  • 최정일;황진옥;민성기
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.316-318
    • /
    • 2004
  • 유선, 무선을 합하여 초고속 네트워크의 사용이 급격하게 증가됨에 따라 고속의 네트워크 통신 서비스에 대한 요구가 증가 하였으며 차별화된 인터넷 서비스에 대한 요구가 증가함에 따라 IP 기반의 스위치가 등장하게 되었다. 이러한 스위치의 이슈는 IT 포워딩, 고속 스위치 패브릭 등의 문제를 포함하게 된다. 현재까지의 모든 패킷 스위치는 그 내부적으로 HOL블로킹에 의한 성능 저하의 영향을 최소화하기 위하여 여러 가지 스케줄링 알고리즘을 사용한다. 본 논문에서는 Gigabit 으로 동작하는 패킷 스위치 중에서 Strict Priority 알고리즘, Round Robin 알고리즘을 분석하고 각각의 스케줄러가 COS 기반과 어떤 관계가 있으며 더불어 COS 기반에 따라, 스케줄러를 동적으로 변경하여 기존의 Static 하게 정책적으로 사용되던Algorithm 과의 차별성을 두어 동적 스케줄러의 선택에 의한 Packet 처리 성능향상을 보이도록 한다.

  • PDF

A traffic control system to manage bandwidth usage in IP networks supporting Differentiated Service (차별화서비스를 제공하는 IP네트워크에서 대역폭관리를 위한 트래픽 제어시스템)

  • 이명섭;박창현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.325-338
    • /
    • 2004
  • As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.