• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.659-669
• /
• 2010

The P2P IPTV will create a new paradigm for the Internet services. However, it cannot guarantee the reliability of their server and QoS because of using common Internet users(peers) for SIP server or relay server, though the infrastructural cost is low. This paper proposes the ISP-based P2P IPTV architecture which can solute the limitations of conventional P2P-based IPTV. In this model, ISP can build P2P overlay network with ISP servers and directly manage each server needed for session connection. So, the servers have higher performance and better reliability than previous one. Besides, robustness is improved because each sever is set by P2P overlay network. To evaluate the characteristics of the ISP-based P2P IPTV architecture, we simulate it for some parameters which are end-to-end streaming delay time, connection delay time and traffic amount. We compared the proposed architecture with the conventional P2P architecture about video service and confirmed that the performance of ISP-based P2P IPTV is better than conventional P2P based IPTV.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.111-119
• /
• 2008

This paper combines fuzzy concepts with an existing dynamic performance isolation technique in order to improve the response time performance of a Web server supporting differentiated services. A load balancing mechanism based on the fuzzy control technique is developed in such a way that ambiguous situations caused by workload estimation of cluster-based Web servers, client request rates, and dynamic request rates can be represented in an effective way. In addition, we verify that the fuzzy-based performance isolation technique improves the performance and robustness of differentiated service systems efficiently through comparing 95-percentile of response time between the fuzzy-based Performance isolation technique and the existing one, which do not use the fuzzy concept.

• Spatial Information Research
• /
• v.21 no.3
• /
• pp.45-53
• /
• 2013

Web GIS, based on the latest web-technology, has evolved to provide efficient and accurate spatial information to users. Furthermore, Web GIS Server has improved the performance constantly to respond user web requests and to offer spatial information service. This research aims to create a designed and implemented Web GIS Server that is named as Nodemap which uses the emergent technology, Node.js, which has been issued for an event-oriented, non-blocking I/O model framework for coding JavaScript on the server development. Basically, NodeMap is Web GIS Server that supports OGC implementation specification. It is designed to process GIS data by using DBMS, which supports spatial index and standard spatial query function. And NodeMap uses Node-Canvas module supported HTML5 canvas to render spatial information on tile map. Lastly, NodeMap uses Express module based connect module framework. NodaMap performance demonstration confirmed a possibility of applying Node.js as a (next/future) Web GIS Server development technology through the benchmarking. Having completed its quality test of NodeMap, this study has shown the compatibility and potential for Node.js as a Web GIS server development technology, and has shown the bright future of internet GIS service.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.199-203
• /
• 2009

Recently, Massively Multiplayer Online Role-Playing Games (MMORPGs) has become increasingly popular, which continue to increase the number of game player. The volume of the game world also has been extended on a large scale. Existing Map-based distributed server architecture divides the game world into the rectangular regions and allocates the registered player in each region to the server responsible for that region. Players tend to concentrate in certain regions of the game world, which makes some special server overloaded. This paper proposes to change the boundary between servers to solve such a unbalanced load problem. Our proposed method first finds the overloaded server and then searches for its neighboring lightest loaded server to share with the overload evenly. Finally we implemented performance evaluation to demonstrate the efficiency of this approach.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.101-111
• /
• 2004

As different from wired internet, wireless internet has limitations due to the following characteristics; low bandwidth, frequent disconnection, low computing power, small screen in user terminal, and user mobility. Also, wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. Wireless proxy servers are used for the wireless internet because their caching and transcoding functions are helpful to overcome the above limitation. TranSend was proposed as a clustering based wireless proxy server but its scalability is difficult to achieve because there is no systematic way to do it. In this Paper. we proposed a clustering based wireless internet proxy server which can be scalable in a systematic way. We performed experiments using 16 PCs and experimental results show 32.17% performance improvement of the proposed system compared to TranSend system.

• The Journal of Society for e-Business Studies
• /
• v.9 no.3
• /
• pp.277-288
• /
• 2004

The purpose of multimedia contents transmission is to resolve the large size and nonformal issues. Various multicasting technologies have been researched to support these issues. This paper suggests a technique to build multicast routing for safe and reliable transmission of multimedia contents. Network server nodes have their own weight with respect to communication loads. The weight is computed by a server's communication load with others. This suggests low delay routing with two or more edge server of content delivery network. We will show the weighted inter-server routing technique and analyze the network performance improvement caused by lower network traffic and delay.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.577-593
• /
• 2000

A distributed video-on-demand (VoD) system is one where collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in the setting of a distributed VoD system, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present three types of presentation plans that a local server must construct in order to satisfy the customer request. Informally speaking, a presentation plan is a temporally synchronized detailed sequence of steps that the local server must perform for presenting the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, for evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth is used. We develop algorithms to compute optimal presentation plans for all three types, and carry out extensive experiments to compare their performance. We have also mathematically proved certain results for the presentation plans that had previously been verified experimentally in the literature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3371-3396
• /
• 2016

Authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in computing technologies and associated constraints. Lu et al. recently proposed a biometrics and smartcards-based authentication scheme for multi-server environment. The careful analysis of this paper demonstrates Lu et al.'s protocol is susceptible to user impersonation attacks and comprises insufficient data. In addition, this paper proposes an improved authentication with key-agreement protocol for multi-server architecture based on biometrics and smartcards. The formal security of the proposed protocol is verified using the widely accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to ensure that our protocol can withstand active and passive attacks. The formal and informal security analysis, and performance analysis sections determines that our protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1052-1059
• /
• 2016

A key role in cloud computing systems that is becoming an issue is implementing a database on untrusted cloud servers requiring the complexity of key management. This study proposes a key management system using Self Proxy Servers to minimize key executions and improve the performance of cloud services by generating Self-Creating Algorithms where the data owner is not directly concerned with related keys when a user sends an encrypted database a query. The Self Proxy Server supports active and autonomous key managements as a distributed server if any trouble should arise from a cloud key server and for an efficient cloud key management. Therefore, the key management system provides secure cloud services by supporting confidentiality of a cloud server database.