• 한국멀티미디어학회논문지
• /
• 제11권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 Communications and Networks
• /
• 제14권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.

• 한국통신학회논문지
• /
• 제30권1B호
• /
• pp.7-16
• /
• 2005

Resource Reservation Protocol(RSVP)는 유선 네트웍에서 실시(real-time) 서비스에 대한 Quality-of-Service(QoS) 보장을 제공하나, 무선 인터넷에서는 이동성 문제로 인해 어려움을 겪는다. 그래서, 연속적인 QoS 서비스를 제공하기 위하여 이동 노드의 방문이 예상되는 셀들에 사전에 자원 예약을 수행하는 것이 필요하다. 근래 무선 인터넷에서 RSVP 하에서의 사전 자원 예약을 통한 QoS 보장을 제공하는 맡은 제안이 수행되고 있으나, 이러한 제안은 사전 자원 예약으로 인해 대역폭 낭비와 시그널링 오버헤드의 문제점을 가지고 있다. 본 논문에서는 무선 인터넷에서 QoS를 보장하면서 대역폭 낭비와 시그널링 오버헤드를 최소화하기 위한 새로운 사전 예약프로토콜인 Proportional Aggregate RSVP(PA-RSYP)를 제안한다. 또한 성능 분석을 통해 제안된 프로토콜이 다양한 환경에서 기존의 프로토콜에 비해 향상된 성능을 나타냄을 보인다.

• 한국정보처리학회논문지
• /
• 제6권7호
• /
• pp.1897-1908
• /
• 1999

인터넷상에서 화상회의, VOD 등과 같은 멀티미디어 서비스가 개발되어왔다. 이런 티미디어 서비스의 비디오나 오디오 멀티미디어 데이터는 QoS 보장을 통한 실시간성을 요구한다. QoS 지원을 위해서 인터넷상에서는 자원 예약을 하기 위해서 RSVP(Resource reSerVation Protocol)가 제안되었다. 그러나 RSVP는 복잡성과 확장성의 문제를 야기하고 있다. 본 논문은 이런 RSVP의 복잡성과 확장성의 문제를 해결하기 위하여 단순화된 자원예약 vfhxmzhf을 개발하고 단순화된 자원예약 프로토콜 상에서 QoS 보장을 지원하는 화상회의 시스템의 설계 및 구현에 대해서 언급한다.

• 인터넷정보학회논문지
• /
• 제5권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.

• 한국통신학회논문지
• /
• 제30권9A호
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.86-94
• /
• 2010

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network.

• 한국통신학회논문지
• /
• 제28권9B호
• /
• pp.760-773
• /
• 2003

최선형 서비스에 기반을 둔 현재의 인터넷은 점차 새로운 멀티미디어 서비스 응용을 제공하기 위해 QoS를 보장하는 통합서비스 또는 차등화된 서비스 제공 형태로 잔화되어 가고 있다. 다가오는 시대의 멀티미디어 서비스별 QoS 요구 및 서비스별 높은 bandwidth 보장에 대한 요구는 IP/MPLS 기반의 제어 plane과 DWDM 광 네트워크 기술이 결합되어 미래의 re-configurable 전송망 실현에 대한 가장 설득력 있는 대안으로 떠오르고 있다. 본 논문에서는 이러한 차세대 DWDM 광 인터넷 백본망에서 멀티미디어 서비스 제공에 대한 QoS 보장을 위해 차등화된 MPLS 서비스(DMS)에 기반을 둔 차등화된 파장할당 과정을 제시한다. 또한 광 링크상의 파장 별 QoS 특성과 DWDM 차세대 인터넷 백본망 상에서 사용되는 OXC 노드의 종류에 따른 QoS recovery를 고려한 차등화된 파장할당 방안을 제시한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.63-67
• /
• 2009

In this paper we propose a QoS policy, which is based on both DSCP and SPQ, appropriate to TPS users on optical subscriber network. Then we experiment and evaluate QoS policy through the test bed which emulates real optical subscriber network. In order to perform effective and real experiment on test bed we make test traffic equivalent to 400 TPS users and give it to test bed. The experimental result shows that no packet loss in real time service traffic such as voice, IPTV occurs during more than 4 hours. We think that our proposed QoS policy is a proper method which guarantees the service quality of real time services on optical subscriber network.

• ETRI Journal
• /
• 제29권2호
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.