• 전자공학회논문지A
• /
• 제32A권12호
• /
• pp.9-24
• /
• 1995

In this paper, we proposed and analysed two kinds of priority control mechanism to archive the cell loss rate requirement and the delay requirement of each class. The service classes of our concern are the high time priority class(class 1) and the high loss priority class(class 2). Two kinds of priority control mechanism is divided by the method of storing the arriving class 2 cell in buffer on case of buffer full. The first one is the method which discarding the arriving class 2 cell, the second one is the mothod which storing the arriving class 2 cell on behalf of pushing out the class 1 cell in buffer. In the proposed priority schemes, one cell of the class 1 is transmitted whenever the maximum K cells of the class 2 is transmitted on case of transmitting the class 1 cell and the class 2 cell sequentially. In this paper, we analysed the cell loss rate and the mean cell delay for each class of the proposed priority scheme by using the Markov chain. The analytical results show that the characteristic of the mean cell delay becomes better for the class 1 cell and that of the cell loss rate becomes better for the class 2 cell by selecting properly the cell transfer ratio according to the condition of input traffic.

• 정보처리학회논문지D
• /
• 제15D권6호
• /
• pp.841-856
• /
• 2008

요구사항에 대한 우선순위는 릴리즈 플랜을 위한 핵심적 활동이기 때문에 요구공학에서 특히, 오픈 시장(Open Market)을 고객으로 하는 시장 주도형 제품개발에 있어서 중요하다. 또한, 요구사항 우선순위는 주어진 요구사항 간의 상호의존 관계를 바탕으로 프로세스 모델, 제품 종류 및 우선순위 프로세스에 대한 경험 등을 사전에 고려하여 우선순위화를 위한 방법과 관점 등을 선택하는 활동이 중요하다. 그러나, 기존 연구들은 요구사항간의 상호의존 관계를 정적 관계만 고려하였고, 고려된 관점들이 비용/가치 등으로 한정적이고 체계적인 우선순위 프로세스를 제공치 못하고 있다. 따라서 본 논문에서는 우선순위화를 위한 모델을 설계하고 개발 제품의 목표와 조직에 적합하도록 우선순위 방법과 관점 등을 선택할 수 있는 적응적 요구사항 우선순위 기법 및 프로세스를 제안한다. 특히, 요구사항간의 정적/동적 상호의존 관계 유형을 정의하고, 다양한 관점에 의한 우선순위화를 통해 릴리즈 플랜의 완성도를 높였다. 이로써 상호의존 관계 및 다양한 관점을 고려한 우선순위 모델기반의 체계적인 우선순위 프로세스를 정립하여 유연하고 충족스러운 우선순위화와 릴리즈 플랜을 통하여 합리적으로 의사결정을 도모할 수 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.15-16
• /
• 2007

In order to provide value-added services, next generation routers should perform packet classification for each incoming packet at wire-speed. In this paper, we proposed hierarchical priority trio (Hptrie) for packet classification. The proposed scheme improves the search performance and the memory requirement by replacing empty internal nodes in ordinary hierarchical trio with priority nodes which are the nodes including the highest priority rule among sub-trie nodes.

• 디지털융복합연구
• /
• 제9권5호
• /
• pp.141-156
• /
• 2011

정보시스템 감리에서 발생하는 감리인의 주관적인 판단은 감리 의견에 대한 신뢰성을 저하시키는 요인이 되고 있다. 본 논문은 정보시스템 감리에서 요구사항의 중요성과 감리 평가에 대한 객관성의 향상을 위하여 요구사항 우선순위를 통한 감리 정량화 모델을 제시하였다. 요구사항의 가치는 동일한 레벨에 있지 않다는 전제하에 고객 요구사항 기준으로 평가하였다. 또한 요구사항 우선순위 기준에 대한 세부적인 평가 지표를 발주자 측면 요소인 서비스 중요도와 기능 만족도, 사업자 측면 요소인 비용과 일정으로 세분화하여 객관적인 감리 수행 결과의 정량화를 가능하게 하여 감리의 객관성을 향상시키도록 하였다.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.617-627
• /
• 2000

ATM networks support diverse traffic types with different service requirement such as data, voice, video and image. This paper analyzes a dynamic priority queue to satisfy Quality of Service (QoS) requirements of traffic. to consider the burstiness of traffic, we assume the arrival to be a Markovian arrival process(MAP) . Performance measures such as loss and delay are derived, Finally, some numerical results show the performance of the system.

• 한국멀티미디어학회논문지
• /
• 제8권6호
• /
• pp.744-752
• /
• 2005

When the multiple video sources are transmitted together through the channel of fixed bandwidth, an efficient picture quality control is necessary. This paper presents a joint picture quality control method to satisfy the user requirement by priority among the video sources. The better picture quality is assigned to the source of higher priority compared to lower priority. We obtain the bitrate for each source to have a required distortion level among the sources by using an approximate distortion-bitrate model for simple implementation. It is shown by simulation that the proposed bandwidth allocation method can keep almost the user-required picture quality among the sources in comparison to an independent bandwidth allocation method.

• 한국통신학회논문지
• /
• 제30권2B호
• /
• pp.11-20
• /
• 2005

Strict priority scheduling scheme is a good candidate for the implementation of service differentiation in an Internet because of simplicity in implementation and the capability to guarantee the delay requirement of the highest class of traffic. However, it is also blown that strict priority starves the lower-class traffic at the cost of prioritizing the higher-class traffic. The purpose of this work is to propose an analytic method which can estimate the average delay performance of Diffserv service architecture and shows that strict priority scheme does not sacrifice the lower class traffic over a diverse condition of the load. From the numerical experiments for three-class Diffserv network we validate our argument that strict priority scheme may be applied to a service differentiation scheme for the future Internet.

• 한국멀티미디어학회논문지
• /
• 제17권4호
• /
• pp.526-534
• /
• 2014

Most of the multiplayer games available online are based on a client-server architecture because this architecture gives better administration control to the game providers than peer-to-peer architecture. In this architecture, the server is responsible for all the communication between the connected clients. The weakness of this architecture is its bandwidth requirement and scalability. Peer-to-peer architectures have then been proposed to solve these issues. In this paper, we propose a hybrid client-server architecture in which the game state is partially shared by the mobile terminal to achieve consistency among different players. Like a peer-to-peer architecture, this architecture uses client-side capacities to reduce bandwidth requirements for the server and improves consistency in wireless networks. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In the proposed architecture, either the server or the client applies consistency mechanism according to the priority level. Simulation experiments show that the bandwidth of the server in this architecture is smaller than that of the client-server architecture. As a result, the server in the proposed architecture can accommodate more clients with enhancing the scalability.

• 한국통신학회논문지
• /
• 제21권3호
• /
• pp.629-642
• /
• 1996

ATM switch handles the traffic for a wide range of appliations with different QOS(Quality-of-Service) requirements. In ATM switch, the priority control mechanism is needed to improve effectively the required QOS requirements. In this paper, we propose a priority control mechanism using the cell transfer ratio type and discard threshold in order to archive the cell loss probability requirement and the delay requirement of each service class. The service classes of our concern are the service class with high time priority(class 1) and the service class with high loss priority control mechanism, cells for two kind of service classes are stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the shole range of the buffer and cells for class 1 are allocated up to discard threshold of the buffer. In case cells in the buffer are transmitted, one cell for class 1 is transmitted whenever the maximum K cells for class 2 are transmitted consecutively. We analyze the time delay and the loss probability for each class of traffic using Markov chain. The results show that the characteristics of the mean cell delay about cells for class 1 becomes better and that of the cell loss probability about cells for class 2 becomes better by selecting properly discard threshold of the buffer and the cell transfer ratio according to the condition of input traffic.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1622-1631
• /
• 2007

To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.