• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1730-1738
• /
• 2008

Quality of Service (QoS) Guarantees grant ways for service providers to establish service differentiation among subscribers. On the other hand, service subscribers are also assured the level of service they paid for. In addition, the efficient level of service quality can be selected according to the subscribers' needs thus ensuring efficient use of available bandwidth. While network utility optimization techniques assure certain QoS metrics, a number of situations exist where some QoS goals are not met. The optimality of the network parameters is not mandatory to guarantee specified QoS levels. This paper proposes a joint data rate and power control scheme that guarantees service contract QoS level to a subscriber using Goal Programming. In using goal programming, this paper focuses on finding the range of feasible solutions as opposed to solving for the optimal. In addition, in case no feasible solution is found, an acceptable compromised solution is solved.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.722-737
• /
• 2002

As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1897-1908
• /
• 1999

Multimedia services(i.e. teleconferencing and Video on demand) have been developed on MBone. The video and audio data of them require Real-Time service using QoS(Quality of Service) guarantees. RSVP(Resource reSerVation Protocol) on the Internet has been suggested to support QoS guarantees. But currently, it has two problems : complexity and scalability. To solve these problems, this paper describes the design and implement of teleconferencing system with QoS guarantees by simplifying the resource reservation processing to solve the RSVP's complexity and scalability.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.692-702
• /
• 2012

Supporting quality of service (QoS) guarantees for diverse multimedia services are the primary concerns for WiMAX (IEEE 802.16) networks. A scheduling scheme that satisfies QoS requirements has become more important for wireless communications. We propose a downlink scheduling scheme called adaptive priority-based downlink scheduling (APDS) for providing QoS guarantees in IEEE 802.16 networks. APDS comprises two major components: Priority assignment and resource allocation. Different service-type connections primarily depend on their QoS requirements to adjust priority assignments and dispatch bandwidth resources dynamically. We consider both starvation avoidance and resource management. Simulation results show that our APDS methodology outperforms the representative scheduling approaches in QoS satisfaction and maintains fairness in starvation prevention.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.7-16
• /
• 2005

Resource Reservation Protocol(RSVP) can provide Quality-of-Service(QoS) guarantees for real-time services in wired networks. However, RSVP suffers from mobility problem in the mobile Internet. Therefore, to provide seamless QoS services, it is needed that a mobile node makes a reservation everywhere it visits. Recently, many protocols have been proposed to provide QoS guarantees through advance resource reservation. But, these proposals have problems with a waste of bandwidth and the signaling overhead due to advance resource reservation. In this paper, we propose new advance resevation protocol, Proportional Aggregate RSVP(PA-RSVP) to minimize the resource reservation bandwidth and the signaling overhead in the mobile Intemet while providing QoS guarantees. Based on the performance evaluation, we show that the proposed protocol provides an improved performance over existing protocols under various system conditions.

• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.704-715
• /
• 2016

In this paper, we explore a low-complex bandwidth allocation (BA) scheme with multi-level service guarantees in VLC-OFDM systems. Effective capacity theory, which evaluates wireless channel capacity from a novel view, is utilized to model the system capacity under delay QoS constraints of the link layer. Since intensity modulation of light is used in the system, problems caused by frequency selectivity can be neglected. Then, the BA problem can be formulated as an integer programming problem and it is further relaxed and transformed into a concave one. Lagrangian formulation is used to reformulate the concave problem. Considering the inefficiency of traditional gradient-based schemes and the demand for distributed implementation in local area networks, we localize the global parameters and propose a quasi-distributed quadratic allocation algorithm to provide two-level service guarantees, the first level is QoS oriented, and the second level is QoE oriented. Simulations have shown the efficient performance of the proposed algorithm. The users with more stringent QoS requirements require more subcarriers to guarantee their statistical delay QoS requirements. We also analyze the effect of subcarrier granularity on the aggregate effective capacity via simulations.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.15-23
• /
• 2008

This paper proposes the new structural MOQ(Multiple Input/Output-Queued) switch which guarantees QoS while maintaining high efficiency and deals with the Anti-Empty algorithm which is new arbitration algorithm to be used for the proposed switch. The new structure of the proposed switch based on MIQ, MOQ is designed to have the same buffer speed as the external line speed. Also, the proposed switch makes it possible to remove the weak point of existing methods and introduces the new method of the MOQ operation to support QoS. Therefore, this switch is equal to the Output Queued switch in efficiency and delay, and guarantees the high-speed switching supporting QoS without cell loss.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.153-156
• /
• 2003

In this paper, we propose QoS guarantee system fur multi-functional VoIP end Terminal. This system guarantees low delay of voice data for Internet telephony in VoIP end terminal that has various kinds of Internet dependant application. QoS system we propose support low delay transmission in VoIP terminal interface.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.257-260
• /
• 2001

As today's network infrastructure continues to grow and DiffServ IP networks ate now available to provide various levels of flexible QoS services. DiffServ guarantees good scalability but shows dynamic QoS dependent on network traffic loads. Therefore, in this paper, we investigate the dynamics of DiffSev QoS and present analytical model to estimate the allowable traffic load under the given network conditions.