• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1211-1219
• /
• 1999

High quality real-time interactive multimedia services like VOD gained huge momentum by information technology industries during the middle of 1990, but failed successful commercial service deployment despite of the expectations. Among the number of reasons, lack of high bandwidth and QoS support from the network infrastructure have become main cause of the failure. On the other hand, the advance of computer industry-driven storage technologies has been reducing the price of in-home storage dramatically. This fact and the delivery of audio-visual material in a digital form to the home storage make very interesting multimedia service applications possible. It enables anytime content delivery (e.g., during off-peak time) without user interaction and anytime content play and, also, enhances utilization by reducing the loads applied to servers and networks using multicast network infrastructure. In this paper, we propose design and implementation of our anytime multimedia service system based on in-home storage, called IMPRESS-AMS.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.2
• /
• pp.53-60
• /
• 2023

Recently, the demand and traffic volume for various multimedia contents are rapidly increasing through real-time streaming platforms. In this paper, we predict real-time streaming traffic to improve the quality of service (QoS). Statistical models have been used to predict network traffic. However, since real-time streaming traffic changes dynamically, we used recurrent neural network-based deep learning models rather than a statistical model. Therefore, after the collection and preprocessing for real-time streaming data, we exploit vanilla RNN, LSTM, GRU, Bi-LSTM, and Bi-GRU models to predict real-time streaming traffic. In evaluation, the training time and accuracy of each model are measured and compared.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.287-292
• /
• 2001

Multimedia service systems should have efficient capacity to serve the growing clients and new data. In the general streaming services, users can endure the small amount of time delay at the beginning of service. But they want to have good quality of service. A streaming server tries to transfer video files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested from clients. To achieve its purpose, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. It is superior to the other systems in the storing structure, fault-tolerance, and service capacity. Since this system supports the web interlace, users can operate easily through the www. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the single media streaming service because of the parallel architecture.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.253-262
• /
• 2004

In this paper, a session allocation algorithm for a switch with multiple shared links is proposed. The algorithm guarantees the reserved bandwidth to each service class and keeps the delay of sessions belonging to a service class as close as possible even if the sessionsare allocated to different shared links. To support these qualities of services, a new scheduling model for multiple shared links is defined and a session allocation algorithm to decide a shared link to be allocated to a new session on the connection establishmentis developed based on the model. The proposed heuristic algorithm allocates a session to a link including the subclass with the shortest (expected) delay that subclasses of the service class the session belongs to will experience. Simulation results verify that a switch with multiple shared links hiring the proposed algorithm provides service classes with fairer bandwidth allocation and higher throughput, and guarantees reserved bandwidth better than the switch hiring other session algorithms. It also guarantees very similarservice delay to the sessions in the same service class.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2292-2302
• /
• 1997

In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and maximizing channel utilization. In PRMA protocol, data terminals with random data packets cannot reserve slot. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme has to be performed for loss sensitive data packet, and so data packets can get their quality of service. Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. But in service aspects, if a fixed bandwidth is allocated to data terminals, time constraint voice packets may have a low efficiency. So in this study, the terminal which wants to request for ABR tyupe service, acquires a minimum bandwidth from system for thefirst time. If the system has extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot. As a result, APRMA protocol cansupporty the data service with loss sensitivity and maintain their channel utilization high. Also high priority services like voice can be satisfied with their QoS by APRMA.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2000.11a
• /
• pp.463-470
• /
• 2000

In this paper, we describe a wireless MAC protocol named APRMA(Abitrary Period Reservation Multiple Access), which is capable of supporting the ABR type data service and maximizing channel utilization. In original PRMA protocol, data terminals with random data packets cannot reserve slot. That is, slot reservation is applicable to the. time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, so data packets can get their quality of service. The aspects of service, if fixed bandwidth is allocated to data terminals, time constraint voice packets may have a low efficiency So in this study, the terminal which wants to request for ABR type service, acquires a minimum bandwidth from system for the first time. If the system have extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot. As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization highly. Also high Priority services like voice can be satisfied with their QoS by APRMA.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.617-623
• /
• 2023

With the evolution of communication networks, there is a growing demand for stable high-speed data connections to support services relying on large-capacity data. The increasing volume of packet data aggregated from user devices underscores the significance of quality diagnostics for the backhaul network, an intermediate link transmitting data to the core network. This paper conducts empirical research on techniques to diagnose issues within the backhaul network through practical case studies, through diagnosing various factors such as circuit bandwidth, speed disparities within switches, network segment-specific buffer sizes, routing policies, among other factors that could potentially cause RTT (Round Trip Time) delays and performance degradation.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.207-222
• /
• 2012

Recently, many consumer electronics manufacturers have produced 3D devices such as 3DTVs and 3D monitors as interests in a stereoscopic video service are getting increased. However, most of 3D services are focused on local storage or bandwidth guaranteed service since 3D stereoscopic video service require bandwidth more stable and larger. This property causes difficulties in seamless stereoscopic video streaming services under IP based open network environment that cannot guarantee quality of services. In order to achieve a seamless video streaming service the international standard organization MPEG (Moving Pictures Experts Group) has developed the adaptive HTTP streaming technology called as DASH (Dynamic Adaptive Streaming over HTTP). However, the DASH doesn't have obvious scheme which can express the two elementary video streams based service-compatible stereoscopic contents in one segment. Therefore, this paper proposes a scheme of efficient 3D adaptive streaming service based on the DASH, which covers not only frame-packing stereoscopic contents but also service-compatible ones. The 3D adaptive HTTP streaming scheme introduced in this paper is able to provide 3D contents with various qualities to user and also has benefit that single 3D content can be applied to a variety of devices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.143-152
• /
• 2007

In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.