• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.322-334
• /
• 2014

Multimedia content is very sensitive to packet loss and therefore multimedia streams are typically protected against packet loss, either by supporting retransmission requests or by adding redundant forward error correction (FEC) data. However, the redundant FEC information introduces significant additional bandwidth requirements, as compared to the bitrate of the original video stream. Especially on wireless and mobile networks, bandwidth availability is limited and variable. In this article, an adaptive FEC (A-FEC) system is presented whereby the redundancy rate is dynamically adjusted to the packet loss, based on feedback messages from the client. We present a statistical model of our A-FEC system and validate the proposed system under different packet loss conditions and loss probabilities. The experimental results show that 57-95%bandwidth gain can be achieved compared with a static FEC approach.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.959-962
• /
• 2003

At the processing capabilities and operating frequency of embedded system are growing, so is the needed data bandwidth to fully utilize the processing capability. The ability to transfer huge amount of data between the embedded core and external devices is required for efficient system operation. In this paper, the data communication architecture for the mixed-clock system is proposed. The dynamic priority adaptation algorithm for bus arbitration is proposed for bandwidth guarantee. The communication architecture that incorporates the proposed arbitration algorithm adapts the priority of communication components dynamically based on the information from FIFO. The experiments show that the measured bandwidth of each component traces the required bandwidth well compared to the other arbitration algorithms

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.47-55
• /
• 2008

The Internet is one of the most infrastructure for information technology in school education. Providing the Internet with a proper bandwidth is an important element for efficient school education for information technology, especially because several instructional models based on new Internet technologies are under development. To support these instructional models, it is important for the schools to provide the proper Internet bandwidth wherever necessary. In this paper, the amount and pattern of internet usage in school were analyzed. Based on this analysis, we propose how to figure out a proper bandwidth for a different ladder of schools.

• Speech Sciences
• /
• v.8 no.4
• /
• pp.45-58
• /
• 2001

Modulated components of a speech signal are frequently used for speech coding, speech recognition, and speech synthesis. Time-frequency representation (TFR) reveals some information about instantaneous frequency, instantaneous bandwidth and boundary of each component of the considering speech signal. In many cases, the extraction of AM-FM components corresponding to instantaneous frequencies is difficult since the Fourier spectra of the components with time-varying instantaneous frequency are overlapped each other in Fourier frequency domain. In this paper, an efficient method decomposing speech signal into AM-FM components is proposed. A variable bandwidth filter is developed for the decomposition of speech signals with time-varying instantaneous frequencies. The variable bandwidth filter can extract AM-FM components of a speech signal whose TFRs are not overlapped in timefrequency domain. Also, amplitude and instantaneous frequency of the decomposed components are estimated by using Hilbert transform.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.149-152
• /
• 2003

In this paper, we propose a scheme that applies to the VoIP application based on H.323 protocol to enhance the bandwidth efficiency. We multiplex the audio and video stream. In this scheme, audio frame is carried with video stream. And we applies not only multiplexing but also (in header compressing to the real audio/video stream to increase the bandwidth efficiency. With the multiplexing and RTP header compressing, we gain the bandwidth efficiency. In the finite network environment, We can assign bandwidth to other users who want to use other service. and other VoIP users. If we can apply the real time network situation to the our VoIP application, we can get more efficient performance.

• Journal of Information Technology Services
• /
• v.7 no.1
• /
• pp.131-149
• /
• 2008

Bandwidth Trading(BT) represents a potential market with over 1 trillion USD across the world and high growth potential. BT is also likely to accelerate globalization of the telecommunications industry and massive restructuring driven by unbundling rush. However, systematic researches on BT remain at an infant stage. This study starts with structure analysis of the Internet industry, and discusses significance of Internet interconnection with respect to BT Issues. We also describe the bandwidth commoditization trends and review technical requirements for effective Internet interconnection with BT capability. Taking a step further, this study explores the possibility of improving efficiency of network providers and increasing user convenience by developing an architectural prototype of Hub-&-Spoke interconnection model required to facilitate BT. The BT market provides an Innovative base to ease rigidity of two-party contract and Increase service efficiency. However, as fair, efficient operation by third party is required, this research finally proposes an exchanging hub named NIBX(New Internet Business eXchange).

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.86-93
• /
• 2018

When multiple clients share bandwidth and receive a streaming service, HTTP Adaptive Streaming has a problem in that the bandwidth is measured inaccurately due to the ON-OFF pattern of the segment request. To solve the problem caused by the ON-OFF pattern, the proposed PANDA (Probe AND Adapt) determines the quality of the segment to be requested while increasing the target bandwidth. However, since the target bandwidth is increased by a fixed amount, there is a problem in low bandwidth utilization and a slow response to changes in bandwidth. In this paper, we propose a video quality control scheme that improves the low bandwidth utilization and slow responsiveness of PANDA. The proposed scheme adjusts the amount of increase in the target bandwidth according to the bandwidth utilization after judging the bandwidth utilization by comparing the segment download time and the request interval. Experimental results show that the proposed scheme can fully utilize the bandwidth and can quickly respond to changes in bandwidth.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.30-37
• /
• 2006

In this paper, we propose a QoS-aware efficient bandwidth re-provisioning scheme in a next generation wireless packet transport network. At the transport network layer, it classifies the traffic of the radio network layer into a real time class and a non-real time class. Using an auto-regressive time-series model and a given packet loss probability, our scheme predicts the needed bandwidth of the non-real time class at every re-provisioning interval. Our scheme increases the system capacity by releasing the unutilized bandwidth of the non-real time traffic class for the real-time traffic class while insuring a controllable upper bound on the packet loss probability of a non-real time traffic class. Through empirical evaluations using the real Internet traffic traces, our scheme is validated that it can increase the bandwidth efficiency while guaranteeing the quality of service requirements of the non-real time traffic class.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.