• Title/Summary/Keyword: Server network bandwidth

Search Result 186, Processing Time 0.02 seconds

Partial video downloading scheme using metadata (메타 정보를 이용한 부분 분할동영상 다운로딩 구현)

  • 최형석;최만석;설상훈;김혁만
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2001.11b
    • /
    • pp.233-236
    • /
    • 2001
  • Due to the current limitation on network bandwidth, it is difficult to get the video files of interests from the server by downloading/streaming. To solve this problem, we propose a scheme for generating a virtual single video in the client side by downloading the selected video segments and the corresponding metadata from the server. Our system is based MPEG-7 standard on the multimedia metadata. The experimental system demonstrates the feasibility of our approach.

  • PDF

A Super-Peer Coordination Scheme for Decentralized Peer-to-Peer Networking Using Mobile Agents

  • Chung, Won-Ho;Kang, Namhi
    • International journal of advanced smart convergence
    • /
    • v.4 no.2
    • /
    • pp.38-45
    • /
    • 2015
  • Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.

The IPSec Systems on TOE for Gigabit Network (기가비트 네트워크 지원을 위한 TOE 기반 IPSec 시스템)

  • Shin, Chi-Hoon;Kim, Sun-Wook;Park, Kyoung;Kim, Sung-Woon
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1035-1038
    • /
    • 2005
  • This paper describes the designs and the implementations of two H/W IPSec Systems, look-aside and inline, on TOE (Transport Offloading Engine). These systems aim for guaranteeing the security of datagram networks while preserving the bandwidth of gigabit networks. The TOE offloads a host CPU from network burdens, so that it makes the gigabit wire speed possible, and then deeper level security architecture of the IPSec guarantees the security of gigabit service network dominated by datagram packets. The focus of this paper is to minimize the TOE's performance degradation caused by the computation-oriented IPSec. The look-aside IPSec system provides a significant improvement in the CPU offload of the IPSec cryptography loads. However, the inline system completely offloads the host CPU from whole IPSec loads, providing significant additional cost saving compared to the look-aside system. In this paper, the implementations of TOE cards including commercial IPSec processors are presented. As the result of performance evaluation with the protocol analyzer, we can get the fact that the inline IPSec system is 8 times faster than the S/W system and 2 times faster than the look-aside system.

  • PDF

Implementation of a Video Distribution Server to Enhance QoS of Network Cameras for the Video Surveillance System (영상 감시용 네트워크카메라의 서비스 품질 향상을 위한 영상분배서버 구현)

  • Jeong, Tae-Young;Yim, Kang-Bin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.9
    • /
    • pp.67-74
    • /
    • 2008
  • This paper proposes, designs and implements an architecture of a server involved with the network camera based video surveillance systems to solve common problems including lack of inter-network operability at the video information sharing, drawback of bandwidth and processing-overhead caused by increase of the number of users, and difficulty of continuous monitoring over changes of network configurations. The proposed saver was designed to manage and service numerous network cameras and users as well as solving the existing problems by providing video distribution facility. Through the empirical study after applying the implemented server to a real video surveillance system we proved that the server can provide reasonable service quality while it processes several hundreds of simultaneous user connections under persisting more than one hundred connections to network cameras. We expect the developed video distribution server to enhance service quality of the large scale video surveillance systems for citizen-wide services such as traffic reporting informatics or natural calamities supporting.

Design and Implementation of Network Adaptive Streaming through Needed Bandwidth Estimation (요구대역 측정을 통한 네트워크 적응형 스트리밍 설계 및 구현)

  • Son, Seung-Chul;Lee, Hyung-Ok;Kwag, Yong-Wan;Yang, Hyun-Jong;Nam, Ji-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.380-389
    • /
    • 2010
  • Since the internet is intend to be the best effort service, the system that stream a large amount of high quality medias need a techniques to overcome the network status for implementation. In this paper, we design and implement a method that estimate quickly whether network permits the needed bandwidth of media and a method that control QoS through that. Presented system uses Relative One-Way Delay(ROWD) trend in the case of the former, and leverages temporal encoding among Scalable Video Coding(SVC) that is apt to apply real time comparatively in the case of the latter. The streaming server classifies the medias by real time to several rates and begins transmission from top-level and is reported ROWD trend periodically from the client. In case of the server reported only 'Increase Trend', the sever decides that the current media exceeds the available bandwidth and downgrades the next media level. The system uses probe packet of difference quantity of the target level and the present level for upgrading the media level. In case of the server reported only 'No Increase Trend' by the ROWD trend response of the probe packet from client, the media level is upgraded. The experiment result in a fiber to the home(FTTH) environment shows progress that proposed system adapts faster in change of available bandwidth and shows that quality of service also improves.

Characteristics of active optical ring network and performance evaluation in Bandwidth on Demand (능동형 광 링 네트워크의 특징 및 요구 대역폭에 따른 성능 분석)

  • Lee Sang-Wha;Song Hae-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.209-218
    • /
    • 2005
  • In this paper, we present an Active Optical Network(AON) . The AON uses the Dense Wavelength Division Multiplexing(DWDM) from optical communication access network of ring type, and will be able to provide the smoothly service in the Bandwidth on Demand by using DWDM. It supports the connection of the multiple wavelength and the Sub-Carrier from the optical gigabit ethernet switch. The Wavelength Add Drop Multiplexer(WADM) extracts a specific wavelength, and composes a node of the ring network. The specific wavelength becomes demultiplexing in the Sub-Carrier and it is distributed in the user The active connection of optical gigabit ethernet switch where the distribution of access network is started and access terminal connection equipment is possible. By the BoD from the AON it compares the buffer size which changes, and it analyzes. Also the Time delay of bit compares with the throughput of server The limit of amount of time is decided. Consequently it will be able to realize the dynamic use protocol and an efficient algorithm of the network.

  • PDF

Optimal Channel Modeling for Multicasting in VOD (VOD에서 멀티캐스팅을 위한 최적 채널 모델링)

  • Kim, Hyoung-Joong;Yeo, In-Kwon;Jitendra K. Manandhar
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.8
    • /
    • pp.623-628
    • /
    • 2000
  • Video-on-demand system in which users can request any video through the network at any time is made possible by rapid increase in network bandwidth and capacity of the media server. However true video-on-demand system cannot support all requests since bandwidth requirement is still too demanding. Therefore efficient bandwidth reduction algorithm is necessary. both the piggybacking method and the batching method are novel solutions that can provide more logical number of streams than the physical system can support. Of course each of them has its pros and cons. hence piggybacking with batching-by-size can take advantage of both the schemes. Some parameters such as the size of batch and the size of the catch-up window should be adjusted and order to maximize the bandwidth reduction for piggybacking with batching-by-size method. One of the most important parameters is decided optimally in this paper. Simulation shows that the optimized parameter can achieve considerable reductionand consequently remarkable enhancement in performance.

  • PDF

A Linear Time Algorithm for Constructing a Sharable-Bandwidth Tree in Public-shared Network (공유 네트워크에서 공유대역폭 트리 구성을 위한 선형 시간 알고리즘)

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.93-100
    • /
    • 2012
  • In this paper we have proposed a linear time algorithm for solving the minimum sharable-bandwidth tree construction problem. The public-shared network is a user generated infrastructure on which a user can access the Internet and transfer data from any place via access points with sharable bandwidth. Recently, the idea of constructing the SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients on public-shared network, a tree structure is constructed. The problem of constructing a tree structure to serve the video streaming requests by using minimum amount of sharable bandwidth has been shown to be NP-hard. The previously published algorithms for solving this problem are either unable to find solutions frequently or less efficient. The experimental results showed that our algorithm is excellent both in the success rate of finding solutions and in the quality of solutions.

Multicast Algorithm of Multimedia data over Heterogeneous User Environment (상이한 사용자 환경을 고려한 멀티미디어 데이터의 멀티캐스트 알고리즘)

  • Lee, Seung-Ha;Na, Yun-Ju;Kim, Sung;Nam, Ji-Seung;Jun, Hyung-Kook;Jo, Chang-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.125-128
    • /
    • 2001
  • Nowadays, Internet users are widespread internationally. Fallowing the users requirements, server has to transfer real-time multimedia data to many clients. Multicast can significantly reduce the system overhead and the network resource waste, so it supports efficient mechanism when server has to transfer same data to many clients. We can deliver multimedia data transfer in real-time using Patching Algorithm which has no delay for service request. And multicast algorithm can support different network bandwidth using Receiver driven Layered Multicast under heterogeneous environment network. The purpose of this paper is to suggest an algorithm that can create new multicast group adequately and transfer real-time multimedia data efficiently under heterogeneous environment.

  • PDF

A Level Group Streaming Technique for Interactive VOD based on P2P (P2P 기반 Interactive VOD를 위한 레벨 그룹 스트리밍 기법)

  • Kim, Jong-Gyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.955-962
    • /
    • 2008
  • Multicast Strategy is one of the cost-saving methods in the large scale VOD environment. However, it does involve complicated problems to implement VCR-like interactions for user's convenience in the multicast streaming system under considering the limited-server and the network's bandwidth in the multicast-transmission system. Therefore, the proper solution of settling such a problem is necessary. Thus, this paper which revised P2Patching[l] proposes LGST(Level Group Streaming Technique) which supports the VCR's function through cooperation among peers with heterogeneous bandwidth under the environment of P2P. This strategy can reduce latency by improving the acceptance of server and using the bandwidth of network efficiently. And for evaluate the proposed scheme's performance, I simulated the performance of streaming delivery topology and streaming quality in comparison with P2Patching. In evaluation to service request refusal ratio and service quality according to bandwidth decrement, the result of simulation shows that proposed LGST improves about $11{\sim}18%$ of performance than P2Patching. In the test of latency recovery according to fault probability and influence of VCR function operation duration, it shows similar performance.