• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.562-564
• /
• 2002

본 논문에서는 멀티미디어 데이터와 실시간 특성을 가진 데이터의 end-to-end 전달기능과 QoS 감시기능 등을 지원하기 위해 개발된 RTP를 분석하고 개선방안을 제시한다. 기존의 RTP 구현 모듈은 실시간 전달기능은 지원하나, 상세한 QoS 파라미터 보장측면에서는 해결해야할 사항이 존재한다. 따라서 본 논문에서는 이러한 문제점을 해결하기 위해 송신측에서 보낸 데이터에 대한 전송 정보를 수신측으로부터 제공받아, 이를 토대로 네트워크의 상태를 3단계로 분류하여 네트워크에의 QoS를 보장할 수 있는 방안을 제안하고 성능 검증을 수행한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.1
• /
• pp.1-13
• /
• 2001

In this paper, we propose a new dynamic bandwidth allocation and call admission control for VBR video sources with QoS constraints to support an efficient resource management and at the same Lime to satisfy the user's quality or service requirements. For the dynamic bandwidth allocation, first the next amount of traffic is predicted using a modified adaptive linear prediction method that considers abrupt scene change effects. And then, we dynamically allocate the necessary bandwidth to each connection based on the currently provided quality degree by the network with respect to the user's QoS requirements in terms of average delay and loss ratio. For the admission control, we determine the acceptance or rejection or a new connection based on the quality satisfaction degrees of the existing connections. Simulation results show that our proposed dynamic schemes are able to provide a stable service, which well meets the user's quality requirements.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.283-292
• /
• 2013

In order to ensure high performance, all the servers in an existing server cluster are always On regardless of number of real-time requests. They ensure QoS, but waste server power if some of them are idle. To save energy consumed by servers, the server power mode control was developed by shutdowning a server when a server is not needed. There are two types of server power mode control depending on when a server is actually turned off if the server is selected to be off: static or dynamic. In a static mode, the server power is actually turned off after a fixed time delay from the time of the server selection. In a dynamic mode, server power is actually turned off if all the services served in the server are done. This corresponds to a turn off after a variable time delay. The static mdoe has disadvantages. It takes much time to find an optimal shutdown time manually through repeated experiments. In this paper, we propose a dynamic shutdown method to overcome the disadvantages of static shutdown. The proposed method allows to guarantee user QoS with good power-saving because it automatically approaches an optimal shutdown time. We performed experiments using 30 PCs cluster. Experimental results show that the proposed dynamic shutdown method is almost same as the best static shutdown in terms of power saving, but better than the best static shutdown in terms of QoS.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.57-60
• /
• 2005

In this paper, a dynamic priority-based QoS (DPQoS) provision scheme is proposed for the required QoS from one end of the network to the other in wireless mobile networks. The DPQoS model is used to meet diversity multimedia traffic requirements. This model is come up with a framework for the wireless network of which consists of a core-IP network and also a number of wireless access networks. For the true end-to-end QoS, it is required that the core network is able to support the required QoS for the wireless users. This paper shows a solution to optimize the performance for different traffic classes according to the traffic characteristics. The performance of the proposed scheme is evaluated at delay aspects such as delay and throughput.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1617-1620
• /
• 2000

최근 다양한 멀티미디어 서비스와 스트림 서비스의 급증과 사용자의 서비스 기대 증가로 인해 기존의 컴퓨팅 환경도 인터넷 기반의 분산 멀티미디어 환경으로 변화되고 있다. 이러한 다양한 요구를 만족시키기 위해서는 인터넷 환경과 실시간 특성들이 혼합된 폭넓은 범위의 분산 애플리케이션을 지원해야 하고, 이들 서비스간의 QoS(Quality of Service)를 보장해야 한다. 이를 위해 본 논문에서는 분산환경인 CORBA기반에서 자원들의 효과적인 관리와 서비스들간의 QoS를 보장하는 분산 QoS 관리 구조를 제시한다 즉, 클라이언트 측에 QoS 제어 관리 모들(QoS Control Management Module)을, 서버측에는 QoS 관리 모듈(QoS Management Module)을 각각 분산시켜 QoS 관리 및 제어를 분산 구조화함으로써 서버 시스템의 부하를 줄이고, 분산 서비스 응용에 지원을 확장할 수 있도록 하며 모듈들의 재사용이 가능하도록 하였다. 또한 분산 QoS 제어를 위해 실시간 협약(Negotiation) 및 동적 적응(Dynamic Adaptation)과정이 분산환경에서 수행되도록 기능 설계를 하였다. 이들 기능수행의 전반과정을 UML(Unified Modeling Lang uage)을 이용하여 순차적 다이어그램으로 기술하였다.

• ETRI Journal
• /
• v.26 no.1
• /
• pp.27-37
• /
• 2004

The architecture in a differentiated services (DiffServ) network is based on a simple model that applies a per-class service in the core node of the network. However, because the network behavior is simple, the network structure and provisioning is complicated. If a service provider wants dynamic provisioning or a better bandwidth guarantee, the differentiated services network must use a signaling protocol with QoS parameters or an admission control method. Unfortunately, these methods increase the complexity. To overcome the problems with complexity, we investigated scalable dynamic provisioning for admission control in DiffServ networks. We propose a new scalable $qDPM^2$ mechanism based on a centralized bandwidth broker and distributed measurement-based admission control and movable boundary bandwidth management to support heterogeneous QoS requirements in DiffServ networks.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.156-166
• /
• 2005

Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.21-35
• /
• 2002

Nowadays, in accordance with increasing expectations of multimedia stream service on the internet, a lot of distributed applications are being required and developed. But the models of the existing systems have the problems that cannot support the extensibility and the reusability, when the QoS relating functions are being developed as an integrated modules which are suited on the centralized controlled specific-purpose application services. To cope with these problems, it is suggested in this paper to a distributed QoS management system on CORBA, an object-oriented middleware compliance. This systems we suggested can provides not only for efficient control of resources, various service QoS, and QoS control functions as the existing functions, but also QoS control real-time negotiation and dynamic adaptation in addition. This system consists of QoS Control Management Module(QoS CMM) in client side and QoS Management Module(QoS MM) in server side, respectively. These distributed modules are interfacing with each other via CORBA on different systems for distributed QoS management while serving distributed streaming applications. In phase of design of our system, we use UML(Unified Modeling Language) for designing each component in modules, their method calls and various detailed functions for controlling QoS of stream services. For implementation of our system, we used OrbixWeb 3.1c following CORBA specification on Solaris 2.5/2.7, Java language, Java Media Framework API 2.0 beta2, Mini-SQL 1.0.16 and the multimedia equipments, such as SunVideoPlus/Sun Video capture board and Sun Camera. Finally, we showed a numerical data controlled by real-time negotiation and adaptation procedures based on QoS map information to GUIs on client and server dynamically, while our distributed QoS management system is executing a given streaming service.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.379-385
• /
• 2023

Distributed congestion control (DCC) is a technology that mitigates channel congestion and improves communication performance in high-density vehicular networks. Traditional DCC techniques operate to reduce channel congestion without considering quality of service (QoS) requirements. Such design of DCC algorithms can lead to excessive DCC actions, potentially degrading other aspects of QoS. To address this issue, we propose a deep reinforcement learning-based QoS-adaptive DCC algorithm. The simulation was conducted using a quasi-real environment simulator, generating dynamic vehicular densities for evaluation. The simulation results indicate that our proposed DCC algorithm achieves results closer to the targeted QoS compared to existing DCC algorithms.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.