• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.227-232
• /
• 2005

A network of Packet based switch Mode will be required to carry the traffics(CVR,VBR, UBR, ABR) generated by a wide range of services. Packet based Network services the quality-of-Service (QoS) management of traffic sources and bandwidth. Besides efficiency and throughput services are achieved in the multimedia traffic sent in the network. In this paper. the scheduler transmits the safe packet, drop the unsafe packet and evaluate unsafe packet as the requirement of the delay avoiding the network congestion for improving the QoS of the multimedia network In this paper. we Propose the scheduling algorithm which evaluates and drops the packet . The suggested model performance of the switch is estimated and simulated in terms of the delay by computer.

• 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%.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.89-91
• /
• 2000

멀티미디어 응용이 점점 널리 사용되면서 멀티미디어 응용에 적합한 태스크 모델의 연구가 진행되었으나, 기존의 태스크 모델은 멀티미디어 응용의 특성을 충분히 반영하지 못하였다. 본 논문에서는 멀티미디어 응용의 자원 사용량의 패턴에 기반한 확률적 멀티프레임 태스크 모델(PMF)을 제시하고, PMF를 멀티미디어 응용의 스케줄링에 적용하여 CPU 자원을 효율적으로 이용하면서 멀티미디어 응용에게 통계적 QoS를 제공할 수 있는 방안을 제시한다. 또한, 다양한 스케줄링 기법을 채용한 모의실험을 통해 제시한 태스크 모델이 자원을 최대한 활용 하면서 응용에게 QoS를 보장할 수 있음을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.412-414
• /
• 2003

무선 이동망에서 점점 증가하는 멀티미디어 트래픽의 QoS(Quality of Service)를 위해서는 충분한 자원이 제공되어야 한다. 하지만 무선망에서의 자원은 한정적이므로 이를 효율적으로 활용해야 멀티미디어 트래픽에 대한 QoS 보장이 가능하다. 이 논문에서는 무선망에서의 멀티미디어 트래픽에 대한 QoS 보장 알고리즘을 제안하였다. 제안된 알고리즘은 이동단말이 위치한 주위 셀의 자원들을 미리 예약하는 방식을 기반으로 하는 admission control 방법이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.301-303
• /
• 2003

비디오 서버는 제한된 자원을 이용하여 보다 많은 사용자에게 안정적인 005(Quality of Service)를 제공하는 것이 중요하다. 본 논문에서는 안정적인 QoS를 지원하기 위한 서버 진입 제어에 관한 연구를 클러스터 형태의 VOD 서버에서 수행하였다. 리눅스 환경에서 구축된 VOD 서버의 성능을 분산 저장 노드의 수와 일반 재생 및 고속 재생의 비율을 변화시키며 측정하였다. 측정한 결과를 토대로 클러스터 VOD 서버의 성능 제한의 원인을 분석하고, 그에 따른 대책을 제안한다. 분석된 자료는 클러스터 VOD 서버에서 진입 제어의 기준을 결정하는 변수들로 사용되어 진다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3361-3377
• /
• 2014

Synchronous computing models provided by real-time synchrony protocols, such as TTA [1] and PALS [2], greatly simplify the design, implementation, and verification of real-time distributed systems. However, their application to real systems has been limited since their assumptions on underlying systems are hard to satisfy. In particular, most previous real-time synchrony protocols hypothesize the existence of underlying fault tolerant real-time networks. This, however, might not be true in most soft real-time applications. In this paper, we propose a practical approach to a synchrony protocol, called Quality-Aware PALS (qPALS), which provides the benefits of a synchronous computing model in environments where no fault-tolerant real-time network is available. qPALS supports two flexible global synchronization protocols: one tailored for the performance and the other for the correctness of synchronization. Hence, applications can make a negotiation flexibly between performance and correctness. In qPALS, the Quality-of-Service (QoS) on synchronization and consistency is specified in a probabilistic manner, and the specified QoS is supported under dynamic and unpredictable network environments via a control-theoretic approach. Our simulation results show that qPALS supports highly reliable synchronization for critical events while still supporting the efficiency and performance even when the underlying network is not stable.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.360-368
• /
• 2008

In this paper, in order that the various QoS(Qualify of Service)s that are required by different traffic class are guaranteed in the random access channels in multi-service multi-user OFDMA systems, the backoff-based random access algorithm is proposed and corresponding performance is analyzed in terms of the access success probability, the throughput, the average delay and the blocking probability. Through the numerical analysis, it is shown that the proposed backoff-based random access algorithm can provide the differentiated QoSs to random access attempts according to their service class.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.425-436
• /
• 2009

In recent years, the user demands have increased for multimedia service of high quality over the broadband convergence network. These rising demands for high quality multimedia service led the popularization of various user terminals and large scale display equipments, which needs a variety type of QoS (Quality of Service). In order to support demands for QoS, numerous research projects are in progress both from the perspective of network as well as end system; For example, at the network perspective, QoS guaranteeing by improving of internet performance such as Active Queue Management, while at the end system perspective, SVC (Scalable Video Coding) encoding scheme to guarantee media quality. However, existing AQM algorithms have problems which do not guarantee QoS, because they did not consider the essential characteristics of video encoding schemes. In this paper, it is proposed to solve this problem by deploying the TS- AQM (Temporal Scalability Active Queue Management) which employs the differentiated packet dropping for dependency of the temporal level among the frames, based on SVC encoding characteristics by exploiting the TID (Temporal ID) field of the SVC NAL unit header. The proposed TS-AQM guarantees multimedia service quality through video decoding reliability for SVC streaming service, by differentiated packet dropping when congestion exists.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.979-982
• /
• 2000

In this paper we suggest the adaptive QoS-based VOD system design, which can diagnose and reflect the variable network situation. This system is based on the changeable Forward Error Correction(FEC) coding and re-transmission to enhance system quality by using the measured real-time network value such as loss, delay and jitter.