• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.81-91
• /
• 2014

Widely spreading smart devices have become an important information sharing channel in everyday life. In particular, social networking services (SNS) are the hub for content creation and sharing. Users post their contents on SNS servers and receive contents of interest. Contents are delivered in either pull or push. Regarding delivery, cost and wait time are two important factors to be minimized, but they are in a trade-off relationship. The Push-N-scheme (PNS) and timeout-based push scheme (TPS) have been proposed for content delivery. PNS has an advantage in cost over TPS, whereas TPS has an edge in terms of the wait time over PNS. We propose a hybrid push scheme of PNS and TPS, called push-N-scheme with timeout (PNT), to balance the cost and the wait time. We evaluate PNT through simulations, with the results showing that PNT is effective in balancing PNS and TPS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1884-1892
• /
• 1993

In push out scheme, high priority cell which arrives when the buffer is full pushs low priority cell. The PBS scheme provides priority by variable threshold in buffer.In this paper, for Controlling congestion in ATM network we propose buffer processing method in which the PBS scheme has variable threshold. And we analysis The performance of this scheme. As a result of simulation, the proposed push out scheme with variable threshold reduces the loss of low priority cell compared with existing push out scheme. This proposed method not only reduces the loss of high priority cell like existing push out scheme but also reduces the loss of low priority cell by variable threshold.

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

Multimedia communication systems require not only high-performance computer hardwares and high-speed networks, but also a buffer management mechanism to process many data efficiently. Two buffer handling methods, Push and Pull, are commonly used. In the Push method, a server controls the flow of dat to a client, while in the Pull method, a client controls the flow of data from a server. Those buffering schemes can be applied to the data transfer between the packet receiving buffer, which receives media data from a network server, and media playout devices, which play the recived media data. However, the buffer management mechanism in client-sides mainly support either one of the Push or the Pull method. Consequently, they have some limitations to support various media playout devices. Futhermore, even though some of them support both methods, it is difficult to use since they can't provide a unified structure. To resolved these problems, in this paper, we propose an efficient and flexible Push/Pull buffer management mechanism at client-side. The proposed buffer management scheme supports both Push and Pull method to provide various media playout devices and to support buffering function to absorb network jitter. The proposed scheme can support the various media playback devices using a single buffer space which in consequence, saves memory space compared to the case that a client keeps tow types of buffers. Moreover, it facilitates the single buffer as a mechanism for the absorbing network jitter effectively and efficiently. The proposed scheme has been implemented in an existing multimedia communication system, so called ISSA (Integrated Streaming Service Architecture), and it shows a good performance result compared to the conventional buffering methods in multimedia communication environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.445-466
• /
• 2022

As everything linking to the internet, people can subscribe to various services from a service provider to facilitate their lives through the Internet of Things (IoT). An obligatory thing for the service provider is that they should push the service data safely and timely to multiple IoT terminal devices regularly after the IoT devices accomplishing the service subscription. In order to control the service message received by the legal devices as while as keep the confidentiality of the data, the public key encryption algorithm is utilized. While the existing public encryption algorithms for push service are too complicated for IoT devices, and almost of the current subscription schemes based on push mode are relying on centralized organization which may suffer from centralized entity corruption or single point of failure. To address these issues, we design a secure subscription-push service scheme based on blockchain and edge computing in this article, which is decentralized with secure architecture for the subscription and push of service. Furthermore, inspired by broadcast encryption and multicast encryption, a new encryption algorithm is designed to manage the permissions of IoT devices together with smart contract, and to protect the confidentiality of push messages, which is suitable for IoT devices. The edge computing nodes, in the new system architecture, maintain the blockchain to ensure the impartiality and traceability of service subscriptions and push messages, meanwhile undertake some calculations for IoT devices with limited computing power. The legalities of subscription services are guaranteed by verifying subscription tags on the smart contract. Lastly, the analysis indicates that the scheme is reliable, and the proposed encryption algorithm is safe and efficient.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.81-89
• /
• 2010

The research on peer-to-peer streaming schemes has largely focused on tree-push and mesh-pull structures. However, the tree-push structure has a defect that the tree restructuring time is long, and the mesh-pull structure has long startup delay and lag time from source servers. In this paper, we propose a new peer-to-peer live streaming scheme based on a push-mesh structure that takes advantages of tree-push and mesh-pull structure simultaneously. This structure basically provides the mesh-pull mechanism for data transmission and utilizes peers with high network upload capacity. It also supports the push mechanism along with paths from a source server, super peers, and selected general peers. By NS-2 simulation experiments, we finally show that our proposed scheme can achieve shorter startup delay than the mesh-pull structure, similar lag time to tree-push structure and best playback continuity among the three schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1766-1777
• /
• 2000

In multimedia new service on the internet, there are problems such as server overload, network congestion and initial latency. To overcome these problems, we propose a proxy push-caching scheme that stores a portion of continuous media stream or entire stream, and a transmission scheme of NOD continuous media, RTP-RR and RTP-nR to exploit push-caching scheme. With the proposed push-caching scheme, NOD server pushes fixed portion of stream to a proxy when new data is generated, and the cached size of each stream changes dynamically according to the caching utility value of each stream. As a result, the initial latency of client side could be reduced and the amount of data transmitted fro ma proxy server to client could be increased. Moreover, we estimate a caching utility value of each stream using correlation between disk space occupied by the stream and the amount of data stream requested by client. And we applied the caching utility value ot replacement policies. The performance of the proxy push-caching and continuous media transmission schemes proposed were compared with other schemes using simulations. In the simulation, these schemes show better results than other schemes in terms of BHR (Byte Hit Rate), initial latency, the number of replacement and packet loss rate.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.175-186
• /
• 2018

Recently, HAS (HTTP Adaptive Streaming) has been the subject of much attention to improve the QoE (Quality of Experience). In a high latency network, HAS degrades the QoE due to the lost RTT cycle since it replies with a response of one segment to the request of one segment. The server-push based HAS schemes of downloading multiple segments in one request cause QoE degradation due to the buffer underflow. In this paper, we propose a VSSDS (Video Streaming Scheme based on Dynamic Server-push) scheme to improve the QoE in a high latency network. The proposed scheme adjust video quality by estimating available bandwidth and determine the number of segments to be downloaded for each segment request cycle. Through the simulation, the proposed scheme not only improves the average video bitrate but also alleviates the buffer underflow.

• Smart Media Journal
• /
• v.4 no.3
• /
• pp.38-43
• /
• 2015

The increased number of smart devices leads users to share multimedia contents with others. Smart device users transmit multimedia files using apps. For multimedia file transfer under NAT (Network Address Translator), a lot of apps exploit a server with public IP or short range communication technologies such as WiFi Direct or Bluetooth because smart devices with private IP address cannot communicate each other directly. We first proposed the push service based file transmission scheme without an additional server and distance limitation. Second, for the push service based transmission, we proposed congestion control scheme to adapt transmission rate to the receiver's link bandwidth. Third, we considered bandwidth aware transmission for senders with different bandwidth. We implemented apps to evaluate the proposed scheme, and conducted experiments with smart devices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.743-754
• /
• 2014

Recently, Information-Centric Networking(ICN), different from traditional IP-based networking, has been highlighted. Content-Centric Networking(CCN), proposed by Van Jacobson, is a representative scheme of the ICN architectures. It can deliver messages slightly faster than the IP-based networking by focusing on the access and delivery to the content itself. However, CCN is restricted to distribute the information without transmitting the request packet in advance because it is pull-based architecture by content requester. In addition, it has a problem that the Pending Interest Table(PIT) could be overloaded easily when DDoS attack happens. In this paper, we suggest an algorithm using a push-based scheme without request packets and overcoming PIT overload situation by Interest Group Push Table(IGPT). The proposed scheme enables to transmit a large amount of content than an existing scheme during the same amount of time in terms of timely-delivery and security.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.257-271
• /
• 2009

In this paper, we propose a protocol compression scheme for enhancing the performance of call processing of PTT(Push-to-Talk) which is one of the important services in IMS(IP Multimedia Subsystem), a next generation integrated wired/wireless packet communication network. To service the PTT on an IMS network, it should use the same call setup procedure as legacy Mobile and TRS(Trunked Radio System) networks and have a fast call setup time and enough communication bandwidth because a number of terminals should be able to exchange same data in real time. The proposed A+SigComp scheme reduces the initial call setup delay of SIP by about 10%, which is used by PTT service for call setup. In addition, the A+ROHC scheme is proposed to compress the header of RTP packets transferred during PTT voice transmission and, as a result, about 5% of increase in communication efficiency is observed.