• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.247-254
• /
• 2020

The recent Internet environment is characterized by the explosion of certain types of data, as the data that people want is affected by certain issues. In this paper, we propose a load balancing technique that considers the data generation forms. The concept of this technique is to prioritize some type of data when it suddenly explodes. This is a technique to build an add-on middle box on a switch to monitor packets and give priority to a queue for load balancing. This technique worked when certain types of data exploded. SDN(Software Defined Networking) has the advantage of efficiently managing a number of network equipment. However, load balancing in the SDN environment has not been studied much. Applying the proposed load balancing technique in the SDN environment can save time and budget and easily implement our policies. When the proposed load balancing technique is applied to the SDN environment, it has been found that the techniques we want can be easily applied to the network systems, and that efficient data processing is possible when certain types of data explosion.

• Journal of Digital Contents Society
• /
• v.7 no.3
• /
• pp.207-210
• /
• 2006

A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwith-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of quality of the presentation. We devise efficient algorithms for determining an optimal policy for several criteria. We also consider the problem of gradual rendering of objects after their start times.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.201-202
• /
• 2018

자동차 부품산업은 자동차산업의 후방산업으로 완성차 메이커 제조산업의 조립용인 중간재 산업으로 부품의 품질에 따라 완성차의 성능이 좌우된다. 자동차 산업구조상 완성차에 종속적인 사업구조로 부품사의 독자 성장이 어렵고 수익성이 완성차업체에 종속 된다. 자동차부품사의 대형화 및 생산공정 자동화 변화로 기존의 수직계열화된 부품 공급 관계에도 변화가 예상되며, 완성차업체는 통합적인 시스템 부품을 생산할 수 있는 글로벌 대형 부품업체에 의존하는 상황이 전개될 수도 있다. 이와 같은 위기와 변화를 극복하기 위해 본 연구에서는 산업구조분석을 자동차 부품산업에 적용하여 자동차부품산업의 경쟁력제고 전략을 도출하고자 한다.

• Journal of the Korea Safety Management & Science
• /
• v.4 no.1
• /
• pp.105-114
• /
• 2002

Nowadays, most companies seek after the greatest profit by means of offering the goods which consumers want timely and efficiently and minimizing the cost of inventory and distribution channel which amounts to the great portion of total cost. And according as EC(Electronic Commerce) market has increased rapidly, SCM(Supply Chain Management) for EC become one of the most important facts for companies, therefore this paper suggest SCM scheme which EC, especially B to C, is added to the existing commerce system. This paper uses internet for information integration of distribution channel which is away from one another and applies TOC(Theory of Constraint)'s DBR(Drum-Buffer-Rope) Scheduling for synchronization through the whole supply chain. It is possible to synchronize the whole supply chain by means of making the speed of manufacturing and distribution to be controlled by consumer's order which is received in distribution center, and inventory and loss of sales opportunities are minimized by constant. Buffer Management. If inventories in distribution center is short, then it needs to search CCR(Capacity Constraint Resource) in supply chain and to control the speed of manufacturing and distribution according to the ability of CCR. This paper applies PT(Partial Transshipment) strategy for Delivery from distribution center to store or cyber consumer. the strategy this paper suggests chooses neighbour area from area which each distribution center takes charge, and then makes product ordered by cyber consumer which lives in the chosen area to be delivered according to inventory of distribution center.

• IE interfaces
• /
• v.10 no.3
• /
• pp.75-93
• /
• 1997

Unlike individual applications, it is extremely hard to obtain user requirements for group systems, since there exists very complicated dynamics in group. This may result in spreading a great amount of products with a broad range of contents. Thus, this study presents a comparative analysis of groupware products. As a result, these products have been categorized into three areas which include cooperation/document management systems, collaborative writing systems, and decision-making/meeting systems. While the systems reviewed here focus on the cooperation/document management systems, the other two areas will be dealt in details in part Ⅱ. The first area ends up with two large categories such as proprietary groupware products and intranet groupware products. However, it has been observed that there is a natural convergence between these two categories. Consequently, the comparative analysis has been performed in terms of functions provided on the two categories and a combined category. Each group of the functions has been divided into three parts which consist of basic functions, quasi-basic functions, and others. Such a decision has been made based on the frequency rate of the functions provided in the products. With a more strict rule, the basic functions comprise electronic mail, sanction, bulletin board, document management, scheduling, security, Web browser, and Internet connectivity. This study also provides a framework for integrated functional model of groupware systems. The basic functions are merged into the model. However, the model is so flexible that it can partially include the quasi-functions in addition to the basic functions. In the future, it is expected that a large number of products will stem from the modification of the functional model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1591-1594
• /
• 2002

BE(Best-Effort)방식의 인터넷에서 제공되던 Text위주의 서비스 제공 방식이 Multimedia 위주의 서비스로 점차 바뀌어 감에 따라, 기존의 BE(Best-Effort)방식으로는 Multimedia QoS(Quality of Service)를 보장하기가 어려워졌다. 이에 IETF(Internet Engineering Task Force)에서는 변화하는 인터넷 환경에서 QoS 보장을 위해 Diffserv(Differentiated Service)방식을 제안하게 되었다. 본 논문에서는 Content를 제공하는 Linux Web Server에서 패킷을 클래스 분류기준(Classification Method)에 의해 분류하고 Scheduling Algorithm을 적용하여 DSCP(Differentiated Service CodePoint) 값을 Web Server 자체에서 결정하여 경계라우터(Edge Router)로 전송하는 방식을 취하였으며, 이를 토대로 하여 경계라우터의 Traffic 부하를 줄이고, 경계라우터의 코어라우터(Core Router)화를 통해 더욱더 향상된 Differentiated Service를 제공하는 것이 목적이다. 이를 본 논문에서는 ns2 를 통해 IETF에서 제안된 Diffserv방식과 본 논문에서 제안한 방식의 Diffserv 방식과 현재의 BE방식을 비교하여 어느 정도의 성능 향상이 있었는지 비교 분석하였다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.2
• /
• pp.53-62
• /
• 2008

Intensive studies have been made in the area of IPTV VOD server. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer utilization, disk performance and network bandwidth. The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a efficient overlay multi_casting network policy for multimedia services with multi media partition storage. Simulation results show that the rate of service number and service time of proposed scheme are about 23% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• International journal of advanced smart convergence
• /
• v.8 no.1
• /
• pp.9-17
• /
• 2019

In this article, we present a performance enhancement scheme for mobile applications by adopting persistent memory. The proposed scheme supports the deadline guarantee of real-time applications like a video player, and also provides reasonable performances for non-real-time applications. To do so, we analyze the program execution path of mobile software platforms and find two sources of unpredictable time delays that make the deadline-guarantee of real-time applications difficult. The first is the irregular activation of garbage collection in flash storage and the second is the blocking and time-slice based scheduling used in mobile platforms. We resolve these two issues by adopting high performance persistent memory as the storage of real-time applications. By maintaining real-time applications and their data in persistent memory, I/O latency can become predictable because persistent memory does not need garbage collection. Also, we present a new scheduler that exclusively allocates a processor core to a real-time application. Although processor cycles can be wasted while a real-time application performs I/O, we depict that the processor utilization is not degraded significantly due to the acceleration of I/O by adopting persistent memory. Simulation experiments show that the proposed scheme improves the deadline misses of real-time applications by 90% in comparison with the legacy I/O scheme used in mobile systems.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.233-240
• /
• 2021

The majority of the Web's success can be related to its productivity and flexibility. Web Services (WSs) have the means to create new patterns for the delivery of software capabilities. The WS easily provides the use of existing components available via the Internet. WSs are a new trend that shares ubiquitous systems with others, so the popularity of the Web is increased day by day with their associated systems. This paper will explore and adopt the possibility of developing a technique that will automate instructors' scheduling of timetables within a Web services environment. This technique has an advantage that facilitates users to reduce the time cost and effort by reducing errors and costs for institutes. Providing dependable tables to avoid mistakes related to instituting schedules is ensured by an automated repetitive manual procedure. Automated systems are increasingly developed based on organizations and their customers. Still, the setting's difficulty of automation systems increases to rise as the system architecture and applications must accomplish various requirements and specifications of ever-demanding project scenarios. The automation system is composed of an operating system, platforms, devices, machines, control system, and information technology. This architecture provides more productivity and optimized services. The main purpose of this paper is to apply an automation system to enhance both quality and productivity. This paper also covers an agile method of proving an automation system by Finite State Machine (FSM) and Attributed Graph Grammar (AGG) tool.