• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.81-88
• /
• 2012

As the performance of the next-generation broadband wireless networks is dramatically enhanced, various services (i.e., education, Live video streaming, Live video conferencing, online games, etc.) have been provided to users through a smart mobile platform. Those services are usually provided by using the centralized communication server. However, since all multimedia traffic is exchanged through a communication server, it often has the scalability problem with regard to traffic management. Our main purpose is for group smart users to provide scalable live multimedia streaming service based on P2P network. To do this, we have designed an architecture of P2P-based service management for mobile group communication management and service management protocol. In order to verify the performance of the proposed scheme, we have mathematically analyzed the performance in terms of the average transmission delay and bandwid th utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.99-106
• /
• 2023

In this paper, we propose subregion-based area of interest management techniques for MMORPG(massively multiplayer online role playing games) integrating P2P(peer-to-peer) networking and cloud computing. For the crowded region, the proposed techniques partition it into several subregions and assign a player to manage each subregion as a coordinator. These techniques include a load balancing mechanism which regulates communication and computation overhead of such player below the specified threshold. We also provide a mechanism for satisfying the criterion, where subregions overlapped with each player's view must be switched quickly and seamlessly as the view moves around in the game world. In the proposed techniques where an efficient provisioning of resources is realized, they relieve a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players effectively. Simulation results show that the MMORPG based on cloud and P2P architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1955-1964
• /
• 2011

With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.333-343
• /
• 2006

MANET and P2P applications have a common nature that they don't have any fixed infrastructures that might maintain network topologies. With such common characteristics, a P2P application can be a killer application over MANET. Due to absence of reliable node which serves indexing services in MANET, fully distributed P2P applications are more suitable for MANET. By using DHT like Chord, we can save network bandwidth and avoid a point of failure of a directory server. However, since MANET allows nodes to depart from network freely, P2P file sharing applications using Chord lookup protocol should address how to recover the keys stored at the departed node. In this paper, we propose BU-Chord in order to detect and recover the departure of nodes by creating and storing backup file information in distributed manner. Our BU-Chord shows off better performance than existing Chord especially in case of high departure rate of nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.314-324
• /
• 2004

Recently, high-speed internet subscribers have grown continuously, and reached up to 10 millions. But existing network management that is responsible only for user access is confronted with many difficulties, since user access network(xDSL, Cable, B-WILL, and so on) has diversified and value added wired/wireless contents service has developed. In this paper propose the Agent based Inter Networking platform as object-oriented hierarchical system that can provide various service such as access QoS(Quality of Service), customized application service and security service according to user on demand. This system has divided into two parts(user agent and agent management system ＆ local and central management systems). Management system periodically receive status information such as bandwidth, download speed, delay, current service, and so on, and process them, then build a policy based on processed information. According to personal user profile that is generated by this policy, the customized service can be provided for users. And This system adopt the object-oriented modeling in case that system migration and integration, and implement a system that is robust and stable for security through hierarchical server system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1618-1626
• /
• 2013

Virtualization service processes all operation including the data creation, storing, and disposal in a server and transmits processed data as the streaming media form. Therefore, client can use the same environment as the traditional desktop environment without considering the type of device. Virtualization service should consider not only the video quality but also the delay bounds and continuity of video playback for improving the user perceived Quality of Service(QoS) of streaming service. In this paper, we propose a network-adaptive transmission architecture that focuses on guaranteeing QoS requirements for virtualization service. In order to provide those, the proposed architecture have the transmission rate adaptation function based on available bandwidth and the content bit-rate control function based on sender buffer state. Through each function, proposed architecture guarantee the delay bounds and continuity of virtualization contents playback. The simulation results show that proposed network-adaptive transmission architecture provides a improve performance of throughput and transmission delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.527-530
• /
• 2014

DASH is a well-known streaming technology, which was proposed in 2010 by MPEG and standardized in 2011. Major multimedia contents service providers, including Apple, Microsoft, and Adobe are all using this technology to support their media streaming services. Whenever a new service is requested to the server, the DASH technology helps servicing the multimedia streaming to client by recognizing the capacity of network and by adapting the quality of the multimedia contents. In DASH, the quality of multimedia contents will be automatically lowered to meet the fluctuating network status, when undesirable breaks interrupt the network. In this paper, we classified and analysed the advantages and disadvantages of DASH researches in three aspects: bit-rate measurement method, bandwidth aggregation method; rate adaptation metrics, algorithms and logics; user's experiences and QoE.

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.53-58
• /
• 2022

Smoothing is a transmission plan that converts video data stored at a variable bit rate into a constant bit rate. In the study of [6-7], when a data rate increase is required, the frame with the smallest increase is set as the start frame of the next transmission rate section, when a data tate decrease is required. the frame with the largest decrease is set as the start frame of the next transmission rate section, And the smoothing algorithm was proposed and performance was evaluated in an environment where network traffic is not considered. In this paper, the smoothing algorithm of [6-7] evaluates the adaptive CBA algorithm and performance with minimum frame rate, average frame rate, and frame rate variation from 512KB to 32MB with E.T 90 video data in an environment that considers network traffic. As a result of comparison, the smoothing algorithm of [6-7] showed superiority in the comparison of the minimum refresh rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1655-1673
• /
• 2018

Mobile computing environment is subject to the constraints of bounded network bandwidth, frequently encountered disconnections, insufficient battery power, and system asymmetry. To meet these constraints and to gain high scalability, data broadcasting has been proposed on data transmission techniques. However, updates made to the database in any broadcast cycle are deferred to the next cycle in order to appear to mobile clients with lower data currency. The main goal of this paper is to enhance the transaction performance processing and database currency. The main approach involves decomposing the main broadcast cycle into a number of sub-cycles, where data items are broadcasted as they were originally sequenced in the main cycle while appearing in the most current versions. A concurrency control method AOCCRBSC is proposed to cope well with the cycle decomposition. The proposed method exploits predeclaration and adapts the AOCCRB method by customizing prefetching, back-off, and partial backward and forward validation techniques. As a result, more than one of the conflicting transactions is allowed to commit at the server in the same broadcast cycle which empowers the processing of both update and read-only transactions and improves data currency.