• Title/Summary/Keyword: 통신 대역폭

Search Result 2,233, Processing Time 0.026 seconds

A Network Adaptive SVC Streaming Protocol for Improving Video Quality (비디오 품질 향상을 위한 네트워크 적응적인 SVC 스트리밍 프로토콜)

  • Kim, Jong-Hyun;Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.363-373
    • /
    • 2010
  • The existing QoS mechanisms for video streaming are short of the consideration for various user environments and the characteristic of streaming applying programs. In order to overwhelm this problem, studies on the video streaming protocols exploiting scalable video coding (SVC), which provide spatial, temporal, and qualitative scalability in video coding, are progressing actively. However, these protocols also have the problem to deepen network congestion situation, and to lower fairness between other traffics, as they are not equipped with congestion control mechanisms. SVC based streaming protocols also have the problem to overlook the property of videos encoded in SVC, as the protocols transmit the streaming simply by extracting the bitstream which has the maximum bit rate within available bandwidth of a network. To solve these problems, this study suggests TCP-friendly network adaptive SVC streaming(T-NASS) protocol which considers both network status and SVC bitstream property. T-NASS protocol extracts the optimal SVC bitstream by calculating TCP-friendly transmission rate, and by perceiving the network status on the basis of packet loss rate and explicit congestion notification(ECN). Through the performance estimation using an ns-2 network simulator, this study identified T-NASS protocol extracts the optimal bitstream as it uses TCP-friendly transmission property and perceives the network status, and also identified the video image quality transmitted through T-NASS protocol is improved.

Resource Weighted Load Distribution Policy for Effective Transcoding Load Distribution (효과적인 트랜스코딩 부하 분산을 위한 자원 가중치 부하분산 정책)

  • Seo, Dong-Mahn;Lee, Joa-Hyoung;Choi, Myun-Uk;Kim, Yoon;Jung, In-Bum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.5
    • /
    • pp.401-415
    • /
    • 2005
  • Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the resource weighted load distribution policy is proposed for a fair load balance and a more scalable performance in cluster-based transcoding servers. Our proposed policy is based on the resource weighted table and number of maximum supported users, which are pre-computed for each pre-defined grade. We implement the proposed policy on cluster-based transcoding servers and evaluate its fair load distribution and scalable performance with the number of transcoding servers.

A Service Architecture to support IP Multicast Service over UNI 4.0 based ATM Networks (UNI 4.0 기반 ATM 망에서의 IP 멀티캐스트 지원 방안을 위한 서비스 구조)

  • Lee, Mee-Jeong;Jung, Sun;Kim, Ye-kyung
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.3
    • /
    • pp.348-359
    • /
    • 2000
  • Most of the important real time multimedia applications require multipoint transmissions. To support these applications in ATM based Intermet environments, it is important to provide efficient IP multicast transportations over ATM networks. IETF proposed MARS(Multicast Address Resolution Server) as the service architecture to transport connectionless IP multicast flows over connection oriented ATM VCs. MARS assumes UNI3.0/3.1 signalling. Since UNI3.0/3.1 does not provide any means for receivers to request a join for a multicast ATM VC, MARS provides overlay service to relay join request from IP multicast group members to the sources of the multicast group. Later on, ATM Forum standardized UNI4.0 signalling which is provisioned with a new signalling mechanism called LIJ(Leaf Initiated Join). LIJ enables receivers to directly signal the source of an ATM VC to join. In this paper, we propose a new service architecture providing IP multicast flow transportation over ATM networks deploying UNI4.0 signalling. The proposed architecture is named UNI4MARS. It comprises service components same as those of the MARS. The main functionality provided by the UNI4MARS is to provide source information to the receivers so that the receivers may exploit LIJ to join multicast ATM VCs dynamically. The implementation overhead of UNI4MARS and that of MARS are compared by a course of simulations. The simulation results show that the UNI4MARS supports the dynamic IP multicast group changes more efficiently with respect to processing, memory and bandwidth overhead.

  • PDF

A Distributed Method for Constructing a P2P Overlay Multicast Network using Computational Intelligence (지능적 계산법을 이용한 분산적 P2P 오버레이 멀티케스트 네트워크 구성 기법)

  • Park, Jaesung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.95-102
    • /
    • 2012
  • In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

Hierarchical Message Forwarding Scheme for Efficient Data Distribution in P2P Messaging System (P2P 출판-구독 메시징 시스템에서 효율적인 정보 전파를 위한 계층적 메시지 전송 기법)

  • Jung, Jin Sun;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.9
    • /
    • pp.209-216
    • /
    • 2019
  • Publish-subscribe communication model is popular for various type of distributed applications because of its loosely coupled style connections. Among the various architecture style for publish-subscribe system, peer-to-peer architecture has been used for the mission critical application domain since it provides high scalability and real-timeness. On the other hand, to utilize the bandwidth of given networks, message filtering is frequently used to reduce the number of messages on the system. Even if P2P provides superior scalability, it is hard to apply filtering to the its messaging system because the filtering process should be done on the peer-side in P2P architecture that are usually done on the broker server in conventional pub/sub architecture. In this paper, we propose a hierarchical subscription management structure as well as message forwarding scheme for efficient data dissemination. Our proposed scheme reduces the number of received messages by filter-out un-wanted messages and offloading the message dissemination work to other subscribers to enhance the messaging throughput.

Fabrication and optical characteristics of 50 ㎓ narrow band pass filter for fiber optical communication using dual ion beam sputtering technique (이중 이온빔 스퍼터링 방식을 사용한 채널 간격 50 ㎓ 광통신용 협대역 투과 필터의 제작 및 특성)

  • 김회경;김명진
    • Korean Journal of Optics and Photonics
    • /
    • v.14 no.3
    • /
    • pp.331-337
    • /
    • 2003
  • This paper represents 50 ㎓ narrow band pass filters for fiber optical communication fabricated by dual ion beam sputtering method. We have analyzed the characteristics of the TA$_2$ $O_{5}$ and $SiO_2$ single layers in order to optimize the process conditions for the 50 ㎓ narrow band pass filters, and controlled the film thickness uniformity to less than 0.1 nm deviation by dual peak spike filter pre-deposition. We designed and fabricated 50 ㎓ narrow band pass filters that consist of 216 layers including 4 cavities based on quarter wave optical thickness. Class substrates with high thermal expansion coefficients were used to reduce the film stress. Anti-reflection coating at the rear side of the substrate was also needed to reduce the optical thickness errors of the Optical Monitoring System caused by multiple beam interference between the front side and the rear side of substrate. The optical characteristics of this 50 ㎓ narrow band pass filters are insertion loss of 0.40 ㏈, pass band ripple of 0.20 ㏈, and pass bandwidth at -0.5 ㏈ of 0.20 nm. and isolation bandwidth at -25 ㏈ of 0.6 nm, which satisfy specifications of dense WDM system in fiber optical communications.tions.

Efficient AIOT Information Link Processing in Cloud Edge Environment Using Blockchain-Based Time Series Information (블록체인 기반의 시계열 정보를 이용한 클라우드 엣지 환경의 효율적인 AIoT 정보 연계 처리 기법)

  • Jeong, Yoon-Su
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.3
    • /
    • pp.9-15
    • /
    • 2021
  • With the recent development of 5G and artificial intelligence technologies, it is interested in AIOT technology to collect, process, and analyze information in cloud edge environments. AIIoT technology is being applied to various smart environments, but research is needed to perform fast response processing through accurate analysis of collected information. In this paper, we propose a technique to minimize bandwidth and processing time by blocking the connection processing between AIOT information through fast processing and accurate analysis/forecasting of information collected in the smart environment. The proposed technique generates seeds for data indexes on AIOT devices by multipointing information collected by blockchain, and blocks them along with collection information to deliver them to the data center. At this time, we deploy Deep Neural Network (DNN) models between cloud and AIOT devices to reduce network overhead. Furthermore, server/data centers have improved the accuracy of inaccurate AIIoT information through the analysis and predicted results delivered to minimize latency. Furthermore, the proposed technique minimizes data latency by allowing it to be partitioned into a layered multilayer network because it groups it into blockchain by applying weights to AIOT information.

Data Augmentation using a Kernel Density Estimation for Motion Recognition Applications (움직임 인식응용을 위한 커널 밀도 추정 기반 학습용 데이터 증폭 기법)

  • Jung, Woosoon;Lee, Hyung Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.4
    • /
    • pp.19-27
    • /
    • 2022
  • In general, the performance of ML(Machine Learning) application is determined by various factors such as the type of ML model, the size of model (number of parameters), hyperparameters setting during the training, and training data. In particular, the recognition accuracy of ML may be deteriorated or experienced overfitting problem if the amount of dada used for training is insufficient. Existing studies focusing on image recognition have widely used open datasets for training and evaluating the proposed ML models. However, for specific applications where the sensor used, the target of recognition, and the recognition situation are different, it is necessary to build the dataset manually. In this case, the performance of ML largely depends on the quantity and quality of the data. In this paper, training data used for motion recognition application is augmented using the kernel density estimation algorithm which is a type of non-parametric estimation method. We then compare and analyze the recognition accuracy of a ML application by varying the number of original data, kernel types and augmentation rate used for data augmentation. Finally experimental results show that the recognition accuracy is improved by up to 14.31% when using the narrow bandwidth Tophat kernel.

Performance Evaluation of a Dynamic Bandwidth Allocation Algorithm with providing the Fairness among Terminals for Ethernet PON Systems (단말에 대한 공정성을 고려한 이더넷 PON 시스템의 동적대역할당방법의 성능분석)

  • Park Ji-won;Yoon Chong-ho;Song Jae-yeon;Lim Se-youn;Kim Jin-hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.980-990
    • /
    • 2004
  • In this paper, we propose the dynamic bandwidth allocation algorithm for the IEEE802.3ah Ethernet Passive Optical Network(EPON) system to provide the fairness among terminals, and evaluate the delay-throughput performance by simulation. For the conventional EPON systems, an Optical Line Termination (OLT) schedules the upstream bandwidth for each Optical Network Unit (ONU), based on its buffer state. This scheme can provide a fair bandwidth allocation for each ONU. However, it has a critical problem that it does not guarantee the fair bandwidth among terminals which are connected to ONUs. For an example, we assume that the traffic from a greedy terminal increases at a time. Then, the buffer state of its ONU is instantly reported to the OLT, and finally the OW can get more bandwidth. As a result, the less bandwidth is allocated to the other ONUs, and thus the transfer delay of terminals connected to the ONUs gets inevitably increased. Noting that this unfairness problem exists in the conventional EPON systems, we propose a fair bandwidth allocation scheme by OLT with considering the buffer state of ONU as welt as the number of terminals connected it. For the performance evaluation, we develop the EPON simulation model with SIMULA simulation language. From the result of the throughput-delay performance and the dynamics of buffer state along time for each terminal and ONU, respectively, one can see that the proposed scheme can provide the fairness among not ONUs but terminals. Finally, it is worthwhile to note that the proposed scheme for the public EPON systems might be an attractive solution for providing the fairness among subscriber terminals.

Improved AR-FGS Coding Scheme for Scalable Video Coding (확장형 비디오 부호화(SVC)의 AR-FGS 기법에 대한 부호화 성능 개선 기법)

  • Seo, Kwang-Deok;Jung, Soon-Heung;Kim, Jin-Soo;Kim, Jae-Gon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1173-1183
    • /
    • 2006
  • In this paper, we propose an efficient method for improving visual quality of AR-FGS (Adaptive Reference FGS) which is adopted as a key scheme for SVC (Scalable Video Coding) or H.264 scalable extension. The standard FGS (Fine Granularity Scalability) adopts AR-FGS that introduces temporal prediction into FGS layer by using a high quality reference signal which is constructed by the weighted average between the base layer reconstructed imageand enhancement reference to improve the coding efficiency in the FGS layer. However, when the enhancement stream is truncated at certain bitstream position in transmission, the rest of the data of the FGS layer will not be available at the FGS decoder. Thus the most noticeable problem of using the enhancement layer in prediction is the degraded visual quality caused by drifting because of the mismatch between the reference frame used by the FGS encoder and that by the decoder. To solve this problem, we exploit the principle of cyclical block coding that is used to encode quantized transform coefficients in a cyclical manner in the FGS layer. Encoding block coefficients in a cyclical manner places 'higher-value' bits earlier in the bitstream. The quantized transform coefficients included in the ealry coding cycle of cyclical block coding have higher probability to be correctly received and decoded than the others included in the later cycle of the cyclical block coding. Therefore, we can minimize visual quality degradation caused by bitstream truncation by adjusting weighting factor to control the contribution of the bitstream produced in each coding cycle of cyclical block coding when constructing the enhancement layer reference frame. It is shown by simulations that the improved AR-FGS scheme outperforms the standard AR-FGS by about 1 dB in maximum in the reconstructed visual quality.