• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.88-95
• /
• 2004

The previous disk scheduling schemes for best-effort applications do not guarantee the real-time requirement of multimedia objects and the real-time disk scheduling schemes do not satisfy throughput of multimedia server. So, this paper propose a two-step disk scheduling scheme to satisfy the requirement of best-effort as well as soft real-time applications. This scheme is based on the round robin algorithm that imposes different weights on the best-effort task and the real-time one. The experiment results on the Linux kernel have shown that both best-effort tasks and real-time tasks could get fair service.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.107-134
• /
• 2004

Today's Internet is providing a single service which is so-called "best-effort service". Now, multimedia and real-time applications are not only demanding large bandwidth but also requiring high QoS. For this, MPLS and DiffServ technology can be adopted to support more scalability and QoS for data traffic engineering. The DISN(Defense Information Systems Network) supports CBR service for voice traffic and VBR service for data traffic which is best-effort service. We propose how to adopt MPLS and DiffServ technology to support traffic engineering and guarantee QoS in the DISN. A traffic analysis according to prioritized traffic classes is done using OPNET simulation tool for assuring QoS. The result shows that low priority packets are delayed a little bit, but high priority packets are transferred more efficiently than without traffic engineering.gineering.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.10-23
• /
• 2001

It is difficult to satisfy the QoS(Quality of Service) guarantee which is required by real-time application services only with the Best-Effort(BE) service adopted in the current Internet. Therefore, worldwide research is being made on the method of QoS provisioning. Among them, the QoS guarantee mechanism using the Diffserv(Differentiated Service) was discussed in this paper. First we analyzed how the DiffServ performance was affected by traffic models. For this, we performed the research for the random, bursts, and self-similar traffic modeling method. We then designed and implemented an OPNET simulator, and performed the simulation 7d performance evaluation for diverse input parameters. Based on the results of performance evaluation, it was confirmed that QoS guarantee is possible for the EF(Expedited Forwarding) class with the DiffServ function under every environments considered and the service separation between EF and BE(Best Effort) classes is also possible. We also analyzed the performance variation and dynamic behavior of DiffServ mechanism based on the resource allocation between E? and BE classes in WFQ(Weighted Fair Queueing).

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.128-128
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.106-106
• /
• 2004

• ETRI Journal
• /
• v.32 no.2
• /
• pp.241-247
• /
• 2010

We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.412-414
• /
• 2005

무선 랜 표준인 IEEE 802.11은 원래 best effort service를 위해 탄생된 기술이기 때문에 QoS(Quality of Service)에 대한 연구가 부족했다. 무선 랜에서는 기존 유선 랜보다 한정된 자원과 희박한 bandwidth, 다양한 노드들의 채널 공유로 인해 QoS를 보장하기가 어렵다. 이를 보완하기 위한 연구가 IEEE 802.11e 워킹그룹에서 진행되고 있다. 본 논문에서는 충돌방지를 위한 CSMA/CA 알고리즘의 back-off값 설정을 매개변수를 두어 idle 시간을 조정함으로써 QoS를 보장하는 알고리즘을 제안한다. 특히, QoS가 요구하는 패킷전달 간격 임계값(threshold)에 따른 매개변수를 조절하여 contention window 크기를 달리 조정함으로써 QoS를 요구하는 노드들의 수에 상관없이 균일한 서비스 성능을 유지하도록 한다. 이 때, 매개변수 값의 선택은 QoS를 제공하는 노드들의 서비스 성능 뿐 아니라 best effort service만을 제공해도 되는 일반 노드들의 서비스 성능도 함께 고려할 수 있도록 하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.520-528
• /
• 2002

The ATM Forum recently introduced the Guaranteed Frame Rate(GFR) service category GFR service has been designed to support classical best effort traffic such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput, but also supports fair distribution of available bandwidth to completing VCs. In this paper, we proposed a new buffer management algorithm based on leaky bucket to provide minimum cell rate guarantee and improve fairness. The proposed algorithm reduces complexity and processing overhead of leaky-bucket algorithm to implement easily.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.217-232
• /
• 2003

QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.