• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.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.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.841-856
• /
• 2008

The priority of requirement is important because the priority is a critical activity of release plan especially in software development which has an open market customer. Also, it is important for stakeholders to select a method and aspects to prioritize requirements. The selection is based on the organizational experience of a priority process, the process model of the product, goals and a type of products, and dependencies between requirements. But, the current researches considered only static dependency between requirements and did not suggest a systematic priority process. In addition, the current researches only suggest limited aspects to prioritize requirements, such as cost and value. Therefore, this paper proposes an adjustable priority process based on a priority model to select a method and aspects for the suitable priority for product and organization. Especially, this paper enhances the completeness of a release plan by a definition of static and dynamic dependency types between requirements. This paper suggests a priority model, which considers the dependencies between requirement and various viewpoint of software development. Based on the priority model, the paper suggests a systematic priority process to promote reasonable decisions to the priority and release plan of requirement.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• 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.

• Journal of Digital Convergence
• /
• v.9 no.5
• /
• pp.141-156
• /
• 2011

Auditors' subjective opinions m audit activities weaken reliability in audit judgments. This paper suggests fixed quantity models through requirement priority for improving objective evaluation and priorities of requirements in information system audit. The value of requirements was evaluated based on customers' requirements with a premise that they are not in the same level. Furthermore, the audit objective judgments were enhanced to enable fixed quantity of subjective audit by subdividing detailed evaluation index of requirement priority standards into importance of service and function on orderers' perspective, and sectioning cost and schedule on contractors' perspective.

• Journal of applied mathematics & informatics
• /
• v.7 no.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.

• Journal of Korea Multimedia Society
• /
• v.8 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.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.

• Journal of Korea Multimedia Society
• /
• v.17 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.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.

• Journal of Korea Multimedia Society
• /
• v.10 no.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.