• Title/Summary/Keyword: Internet Bandwidth

Search Result 824, Processing Time 0.033 seconds

Performance Evaluation of the Internet Phone based on Resource Reservation Protocol (자원 예약 프로토콜에 기반한 인터넷 폰의 성능분석)

  • 조재만
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.03a
    • /
    • pp.27-31
    • /
    • 1998
  • The growing usage of multimedia communication applications with specific bandwidth and real-time delivery requirements has created the needs for quality of service(QoS). In response to the growing demand for an integrated services, the Reservation Protocol(RSVP) has been designed to exchange resource reservation among routers in the internet. RSVP protocol provides the quality of service for real-time applications but the network efficiency is reduced because of the limited bandwidth. In order to use network resources efficiently. We compare the resource efficiency of traditional reservation methods with that of the proposed method and evaluate the performance of the internet phone.

  • PDF

A Study on Optical-LSP Establishment and QoS Maintenance Scheme Based on DOQS Classes in OVPN (OVPN에서 차등화된 광 QoS 서비스(DOQS) 클래스를 고려한 Optical-LSP의 설립 및 QoS유지 방안 연구)

  • 조준모;윤미라;김성운;이상조
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.8
    • /
    • pp.318-330
    • /
    • 2003
  • The advantages of "VPN over Internet" are cost-effectiveness and flexibility However, the disadvantages are the lack of sufficient QoS mechanism and transmission capacity for high bandwidth service. Given this increasing demand for high bandwidth Internet and QoS assurances in "PN over Internet", IP/GMPLS based control plane combined with a high bandwidth capacity of DWDM optical network is seen as a very favorable approach for the realization of future "OVPN over IP/GMPLS over DWDM" Within OVPN for providing QoS guaranteed multimedia service over the NGOI(Next Generation Optical Internet) based on the "IP/GMPLS over DWDM" concept, differentiated QoS framework is one of the key issues to implement OVPN over DWDM-based NGOI. Keeping in mind that IETF(Internet Engineering Task Force) and ITU-T(International Telecommunication Union) are standardizing IP/GMPLS over DWDM protocol framework as a solution for the NGOI, in this paper, we suggest Optical-LSP establishment and QoS maintenance scheme based on DOQS(Differentiated Optical QoS Service) classes, which are the key issue of DOQS protocol framework for assuring end-to-end QoS in "OVPN over IP/GMPLS over DWDM".

A TCP-Friendly Control Method using Neural Network Prediction Algorithm (신경회로망 예측 알고리즘을 적용한 TCP-Friednly 제어 방법)

  • Yoo, Sung-Goo;Chong, Kil-To
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.105-107
    • /
    • 2006
  • As internet streaming data increase, transport protocol such as TCP, TGP-Friendly is important to study control transmission rate and share of Internet bandwidth. In this paper, we propose a TCP-Friendly protocol using Neural Network for media delivery over wired Internet which has various traffic size(PTFRC). PTFRC can effectively send streaming data when occur congestion and predict one-step ahead round trip time and packet loss rate. A multi-layer perceptron structure is used as the prediction model, and the Levenberg-Marquardt algorithm is used as a traning algorithm. The performance of the PTFRC was evaluated by the share of Bandwidth and packet loss rate with various protocols.

  • PDF

Experiment of VoIP Transmission with AMR Speech Codec in Wireless LAN (무선랜 환경에서 AMR 음성부호화기를 적용한 VoIP 전송 실험)

  • Shin, Hye-Jung;Bae, Keun-Sung
    • Speech Sciences
    • /
    • v.11 no.4
    • /
    • pp.67-73
    • /
    • 2004
  • Packet loss, jitter, and delay in the Internet are caused mainly by the shortage of network bandwidth. It is due to queuing and routing process in the intermediate nodes of the packet network. In the Internet whose bandwidth is changing very rapidly in time depending on the number of users and data traffic, controlling the peak transmission bit-rate of a VoIP. system depending on the channel condition could be very helpful for making use of the available network bandwidth. Adapting packet size to the channel condition can reduce packet loss to improve the speech quality. It has been shown in [1] that a VoIP system with an AMR speech codec provides better speech quality than VoIP systems with fixed rate speech codecs. With the adaptive codec mode assignment. algorithm proposed in [1], in this paper, we performed the voice transmission experiments using the wireless LAN through the real Internet environment. Experimental results are analyzed and discussed with our findings.

  • PDF

Adaptive Rate Control Scheme for Streaming-based Content Sharing Service

  • Lee, Sunghee;Chung, Kwangsue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.784-799
    • /
    • 2013
  • This paper presents an adaptive rate control scheme for streaming-based content sharing service. This scheme delivers multimedia contents from a user device to another device or seamlessly redirects streaming service across heterogeneous user devices. In the proposed scheme, a streaming server adjusts video quality level according to the network and client status. Our scheme is different from other rate control schemes, because the video quality at the server is decided not only based on the available bandwidth, but also based on the device characteristics and bandwidth requirement at the access network. We also propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows competing for the same narrow link with different Round Trip Times (RTTs). Through the simulation, we prove that our scheme improves the network stability and the quality of streaming service by appropriately adjusting the quality of the video stream. The simulation results also demonstrate the ability of the proposed scheme in ensuring RTT-fairness while remaining throughput efficient.

Policy-based Reconfigurable Bandwidth-Controller for Network Bandwidth Saturation Attacks (네트워크 대역폭 고갈 공격에 대한 정책 기반 재구성 가능 대역폭제어기)

  • Park Sang-kil;Oh Jin-tae;Kim Ki-young
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.951-958
    • /
    • 2004
  • Nowadays NGN is developed for supporting the e-Commerce, Internet trading, e-Government, e-mail, virtual-life and multimedia. Internet gives us the benefit of remote access to the information but causes the attacks that can break server and modify information. Since 2000 Nimda, Code Red Virus and DSoS attacks are spreaded in Internet. This attack programs make tremendous traffic packets on the Internet. In this paper, we designed and developed the Bandwidth Controller in the gateway systems against the bandwidth saturation attacks. This Bandwidth con-troller is implemented in hardware chipset(FPGA) Virtex II Pro which is produced by Xilinx and acts as a policing function. We reference the TBF(Token Bucket Filter) in Linux Kernel 2.4 and implemented this function in HDL(Hardware Description Language) Verilog. This HDL code is synthesized in hardware chipset and performs the gigabit traffic in real time. This policing function can throttle the traffic at the rate of band width controlling policy in bps speed.

Admission Control Policy Heuristic Algorithm for fairness of Call Blocking Probability in Differentiated Service Networks (차별화된 서비스를 갖는 인터넷 망에서 호 블로킹 확률의 공평성을 위한 수락 제어 정책 Heuristic 알고리즘 연구)

  • Min, Jun-Ki;Rhea, Woo-Seop;Chung, Jong-Soo
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.121-128
    • /
    • 2005
  • Recently, as the research of effective resource management for supporting of various next generation internet service, the admission control mechanisms using the dynamic provisioning methods in differentiated service networks are studied. However, even though admission control mechanism is applied to the network, there exits the unfairness of call blocking probability among the different bandwidth requested services. In this paper, we propose the new admission control policy heuristic algorithm that provides fairness of call blocking probability between the large bandwidth requested service and the small bandwidth requested service. The simulation results show that the proposed algorithm provides not only blocking probability fairness but also high bandwidth utilization.

  • PDF

A Design for Data Transmission Algorithm of Multimedia Data with Best Effort Environment (Best Effort 환경에 적절한 멀티미디어 데이터 전송 알고리즘 설계)

  • 허덕행
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.155-162
    • /
    • 1999
  • Various applications of video conferencing are required real-time transmission in order to offer service of best effort in internet. Because the bandwidth of internet changes dynamically, appropriated QoS could not be guaranteed To resolve the problem. available bandwidth between sender and receiver is measured. And according to measured bandwidth, the transmission of multimedia data is controlled In this paper, we propose algorithm of efficient transmission for best QoS in internet According to a present status of network, we measure available bandwidth using feedback RTCP information and change a compression rate to reduce a producing CODEC data. And according to the priority that is measured by packet loss for received RTCP information, we abandon frames indicated as lower weight in transmission buffer of sender.

  • PDF

Utility and Pricing for the Best Effort Internet Services (최선형 인터넷 서비스의 유틸리티와 과금)

  • 李焄;魚潤
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.6
    • /
    • pp.19-19
    • /
    • 2002
  • In this paper the authors explore the effect of bandwidth sharing to the utility of the customer for the best-effort Internet services and draw a basis for the pricing principle in Internet Protocol networks. Especially, we investigate the behavior of a customer′s utility in case an arbitrary amount of additional bandwidth is allowed to each customer for the elastic traffic, which is the typical example of the non-real time Internet data traffic. After drawing the utility curve, which will be proved to follow the concave curve, we will apply it to the pricing of Internet traffic. Finally, via numerical experiments, we will illustrate the validity and implication of the proposed method.

Utility and Pricing for the Best Effort Internet Services (최선형 인터넷 서비스의 유틸리티와 과금)

  • Lee, Hoon;Uh, Yoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.6
    • /
    • pp.277-284
    • /
    • 2002
  • In this paper the authors explore the effect of bandwidth sharing to the utility of the customer for the best-effort Internet services and draw a basis for the pricing principle in Internet Protocol networks. Especially, we investigate the behavior of a customer's utility in case an arbitrary amount of additional bandwidth is allowed to each customer for the elastic traffic, which is the typical example of the non-real time Internet data traffic. After drawing the utility curve, which will be proved to follow the concave curve, we will apply it to the pricing of Internet traffic. Finally, via numerical experiments, we will illustrate the validity and implication of the proposed method.