• Title/Summary/Keyword: Residual bandwidth

Search Result 46, Processing Time 0.025 seconds

A Cost-Aware Multi-path DSDV Routing Protocol in Wireless Mesh Networks (무선 메쉬 네트워크에서 비용 인지 다중 경로 DSDV 라우팅 프로토콜)

  • Lee, Seong-Woong;Chung, Yun-Won
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.289-296
    • /
    • 2008
  • In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

A Performance Analysis for Bandwidth Allocation Algorithm Using Available Bandwidth Information in ATM Networks (ATM 네트워크에서 가용 대역폭 정보를 이용한 대역폭 할당 알고리즘에 대한 성능분석)

  • 한상옥;박광채
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.89-96
    • /
    • 2000
  • ABR service is defined by ATM Forum and ITU for the efficient use of link bandwidth, and 2-pass service policing is proposed for this service. 2-pass service policing is effective by the real-time measurement of the used bandwidth, and this scheme obtains multiplexing gam and control efficiently ABR traffic as dynamically allocating rate by residual bandwidth information. In this study, we propose the real-time bandwidth prediction scheme for ABR traffic control, as using dynamic rate allocation by available bandwidth information. This study can obtain the simple hardware structure by means of as predicting available bandwidth by the total link bandwidth and the sum of transmission rate on the backlogged state connections.

  • PDF

On Speech Digitization and Bandwidth Compression Techniques[II]-Vocoding (음성신호의 디지탈화와 대역폭축소의 방법에 관하여 [II]-Vocoding)

  • 은종관
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.15 no.5
    • /
    • pp.1-6
    • /
    • 1978
  • This paper is a sequel of the previous paperl) on speech digitization and bandwidth compression techniques. Several recently developed vocoding techniques, that is, linear predictive coding (LPC), formant vocoding, residual excited linear prediction (RELP) vocoding, and adaptive predictive coding(APC) are discussed. Throughout the leaper emphasis is placed on the LPC approach that is presently the most promising technique in speech compression. In addition, current problems and possible solutions are discussed.

  • PDF

Effective Bandwidth Measurement for Dynamic Adaptive Streaming over HTTP (DASH시스템을 위한 유효 대역폭 측정 기법)

  • Kim, Dong Hyun;Jung, Jong Min;Huh, Jun Hwan;Kim, Jong Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.42-52
    • /
    • 2017
  • DASH (Dynamic Adaptive Streaming over HTTP) is an adaptive streaming technique that enables transmission of multimedia content when clients request the multimedia contents to server. In this system, to ensure the best quality of the content to satisfy users, it is necessary to precisely measure the residual bandwidth. However, the measured residual bandwidth by the DASH, which is not considering the transmission features of TCP, varies by the size of previous media segment, which makes it hard to ensure QoE to users. In this paper, we excluded the TCP Slow start range from measurement of residual bandwidth and suggested the new DASH bandwidth measuring method to decrease the error. Then, we realized the method in DASH system based on open source, and compared the existing measuring method. The new method showed that the accuracy of result has increased by 20%. Also, it could improve the QoE of users in terms of service quality and number of changes of segment quality.

Bandwidth Efficient Digital Communication with Wavelet Approximations

  • Lo, Chet;Moon, Todd K.
    • Journal of Communications and Networks
    • /
    • v.4 no.2
    • /
    • pp.97-101
    • /
    • 2002
  • Based on their shift and scale orthogonality properties, scaling and wavelet functions may be used as signaling functions having good frequency localization as determined by the fractional-out-of-band power (FOOBP). In this paper, application of Daubechies' wavelet and scaling functions as baseband signaling functions is described, with a focus on finding discretely realizable pulse-shaping transfer function circuits whose outputs approximate scaling and wavelet functions when driven by more conventional digital signaling waveforms. It is also shown that the inter-symbol interference (ISI) introduced by the approximation has negligible effect on the performance in terms of signal-to-noise ratio (SNR). Moreover, the approximations are often more bandwidth efficient than the original wavelet functions. These waveforms thus illustrate an example solution of a tradeoff between residual ISI and bandwidth efficiency as a signal design problem.

A Study to Guarantee Minimum Bandwidth to TCP Traffic over ATM-GFR Service (ATM-GFR 서비스에서 TCP 트래픽의 최소 대역폭 보장에 관한 연구)

  • 박인용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.308-315
    • /
    • 2002
  • Guaranteed frame rate (GFR) service has been defied to provide minimum cell rate (MCR) guarantees for virtual connections (VCs) carrying Internet traffic in ATM networks and allow them to fairly share residual bandwidth. The simplest switch implementation mechanism to support the GFR service in ATM networks consists of the frame-based generic cell rate algorithm (F-GCRA) frame classifier and the early packet discard (EPD)-like buffer acceptance algorithm in a single FIFO buffer. This mechanism is simple, but has foiled to guarantee the same bandwidth as an MCR to a VC that has reserved a relatively large MCR. This paper applies the packet spacing scheme to TCP traffic to alleviate its burstness, so as to guarantee a larger MCR to a VC. In addition, the random early detection (RED) scheme is added to the buffer acceptance algorithm in order to improve fairness in use of residual bandwidth. Simulation results show that the applied two schemes improve a quality of service (QoS) in the GFR service for the TCP traffic.

Design of Wideband Speech Coder Using the MLT Residual Signal (MLT 여기신호를 이용한 광대역 음성 부호화기 설계)

  • Oh Yeon-Seon;Shin Jae-Hyun;Lee In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.5
    • /
    • pp.248-254
    • /
    • 2005
  • In this Paper, the structure of a split bandwidth wideband speech coder and its highband coder for tone qualify elevation are Proposed. The lowband and highband by the split bandwidth method are encoded independently applying the G.729E and MLT (Modulated Lapped Transform) residual model. In the highband structure which is encoded by low bit rate of 4kbps, the MLT residual signals are distinguished to voice and unvoice signal . The voice signals are applied to MLT peak picking method by lowband pitch period. Because transformed MLT residual signals are represented by periodic signal that have periodic peak. The unvoice signals are applied to MLT which linear prediction spectral response is added and do vector quantization. Performance for proposed 15.8kbps wideband speech coder was verified through subjective listening test.

Real-Time Bandwidth Management Service for Effective Multiple Isochronous Streaming Transmission in IEEE1394 based Home Network (IEEE1394 기반 홈네트워크에서 효율적인 다중 등시성 스트리밍 전송을 위한 실시간 대역폭 관리 서비스)

  • Chae Hwa-Young;Jung Gi-Hoon;Kang Soon-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9B
    • /
    • pp.838-847
    • /
    • 2006
  • In order to support multiple multimedia streaming services in home networks, many critical issues must be considered. In addition, handling the shortage of network bandwidth is one of the most significant and complicated issues. In this paper, real-time bandwidth management service is suggested as a solution to the problem regarding the IEEE1394-based home network. In order to handle the shortage of network bandwidth and to enhance the bus utilization rate, the proposed service combines two methods. First, the bus bandwidth management function determines the state of the network bandwidth and restores the residual bandwidth, which is excessively occupied by a streaming service, to the available free bandwidth. Second, the Isochronous Streaming (IS) Scheduler manages all streaming services according to priority. In order to test the proposed service, we implemented a prototype steaming management middleware and evaluated it by using the IEEE1394 network test-bed.

Network Selection Algorithm Based on Spectral Bandwidth Mapping and an Economic Model in WLAN

  • Pan, Su;Zhou, Weiwei;Gu, Qingqing;Ye, Qiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.68-86
    • /
    • 2015
  • Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

MAX-MIN Flow Control Supporting Dynamic Bandwidth Request of Sessions (세션의 동적 대역폭 요구를 지원하는 최대-최소 흐름제어)

  • Cho, Hyug-Rae;Chong, Song;Jang, Ju-Wook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.8
    • /
    • pp.638-651
    • /
    • 2000
  • When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

  • PDF