• Title/Summary/Keyword: Bandwidth-Efficient

Search Result 875, Processing Time 0.023 seconds

Performance Impact of Large File Transfer on Web Proxy Caching: A Case Study in a High Bandwidth Campus Network Environment

  • Kim, Hyun-Chul;Lee, Dong-Man;Chon, Kil-Nam;Jang, Beak-Cheol;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.52-66
    • /
    • 2010
  • Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

System Architecture Design and Policy Implications on the e-Marketplace for Telecom Bandwidth Trading (Telecom Bandwidth Trading을 위한 시스템 아키텍처 설계와 거래시장 모형)

  • Kim, Do-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.257-267
    • /
    • 2007
  • 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).

  • PDF

Bandwidth-Efficient Multi-Code Modulation Scheme (대역폭 효율적인 다중 부호 변조 방식)

  • Hong, Dae-Ki
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1601-1607
    • /
    • 2009
  • As a general rule, the orthogonal modulation scheme which is widely used for wireless communications is not appropriate for the high speed data transmission applications due to the low bandwidth efficiency. Therefore, to increase the bandwidth efficiency of the conventional orthogonal modulation, we propose the multi-code trans-(bi-)orthogonal modulation in this paper. It is the combined scheme of multi-code modulation and trans-orthogonal modulation. We can know that the bandwidth efficiency of the proposed scheme is better than that of the conventional orthogonal modulation. Additionally, the receiver complexity of the proposed scheme is lower than that of the conventional orthogonal modulation. The proposed scheme can be used for the physical layer of the high speed wireless digital data transmission applications such as multimedia communications system and high speed personal area networks.

A Trends of Adapted Satellite Communication (적응형 위성통신의 전망)

  • Jung, Ji-Won
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.65-66
    • /
    • 2005
  • This paper presents an adaptive satellite communication systems to adapt channel environment. High performance coding and modulation techniques are applied to poor channel condition, otherwise, bandwidth efficient coding and modulation techniques are applied to good channel condition to obtain high transmission rate.

  • PDF

Bandwidth-Efficient Selective Retransmission for MIMO-OFDM Systems

  • Zia, Muhammad;Kiani, Tamoor;Saqib, Nazar A.;Shah, Tariq;Mahmood, Hasan
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.66-76
    • /
    • 2015
  • In this work, we propose an efficient selective retransmission method for multiple-input and multiple-output (MIMO) wireless systems under orthogonal frequency-division multiplexing (OFDM) signaling. A typical received OFDM frame may have some symbols in error, which results in a retransmission of the entire frame. Such a retransmission is often unnecessary, and to avoid this, we propose a method to selectively retransmit symbols that correspond to poor-quality subcarriers. We use the condition numbers of the subcarrier channel matrices of the MIMO-OFDM system as a quality measure. The proposed scheme is embedded in the modulation layer and is independent of conventional hybrid automatic repeat request (HARQ) methods. The receiver integrates the original OFDM and the punctured retransmitted OFDM signals for more reliable detection. The targeted retransmission results in fewer negative acknowledgements from conventional HARQ algorithms, which results in increasing bandwidth and power efficiency. We investigate the efficacy of the proposed method for optimal and suboptimal receivers. The simulation results demonstrate the efficacy of the proposed method on throughput for MIMO-OFDM systems.

Performance Analysis of Deterministic QoS Guarantees on Dynamic Bandwidth Allocation in a Circuit-Switched Satellite Network (결정적 서비스 질을 보장하는 회선 교환 위성 망의 동적 대역폭 할당에 대한 성능 분석)

  • Pae, Tau-Ung;Lee, Jong-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.6
    • /
    • pp.28-38
    • /
    • 2001
  • In this paper, we propose and analyze a more efficient and flexible dynamic data traffic system for a circuit switched satellite network. Our proposed system is more efficient than existing circuit switched satellite networks and allows for dynamic capacity in each connection without rebuilding or resetting the connection software or algorithms. We also discuss an algorithm for bandwidth allocation that provides deterministic quality of service guarantees. The traffic sources are regulated using standard dual leaky buckets; the system performance is analytically evaluated; and the algorithm is verified through simulation. Our analysis scheme and results should prove useful for the design and implementation of protocols in future circuit-switched satellite networks.

  • PDF

A Study on the Security Framework for IoT Services based on Cloud and Fog Computing (클라우드와 포그 컴퓨팅 기반 IoT 서비스를 위한 보안 프레임워크 연구)

  • Shin, Minjeong;Kim, Sungun
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.12
    • /
    • pp.1928-1939
    • /
    • 2017
  • Fog computing is another paradigm of the cloud computing, which extends the ubiquitous services to applications on many connected devices in the IoT (Internet of Things). In general, if we access a lot of IoT devices with existing cloud, we waste a huge amount of bandwidth and work efficiency becomes low. So we apply the paradigm called fog between IoT devices and cloud. The network architecture based on cloud and fog computing discloses the security and privacy issues according to mixed paradigm. There are so many security issues in many aspects. Moreover many IoT devices are connected at fog and they generate much data, therefore light and efficient security mechanism is needed. For example, with inappropriate encryption or authentication algorithm, it causes a huge bandwidth loss. In this paper, we consider issues related with data encryption and authentication mechanism in the network architecture for cloud and fog-based M2M (Machine to Machine) IoT services. This includes trusted encryption and authentication algorithm, and key generation method. The contribution of this paper is to provide efficient security mechanisms for the proposed service architecture. We implemented the envisaged conceptual security check mechanisms and verified their performance.

Power-and-Bandwidth Efficient Cooperative Transmission Protocol in Wireless Sensor Networks (전력 및 대역폭 효율성있는 무선센서네트워크협력 전송에 관한 연구)

  • Khuong Ho Van;Kong Hyung-Yun;Choi Jeong-Ho;Jeong Hwi-Jae
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.185-194
    • /
    • 2006
  • In this paper, we first propose a power-and-bandwidth efficient cooperative transmission protocol where a sensor node assists two others for their data transmission to a clusterhead in WSNs (Wireless Sensor Networks) using LEACH (Low-Energy Adaptive Clustering Hierarchy). Then we derive its closed-form BER expression which Is also a general BER one for the decode-and-forward protocol (DF) and Prove that the proposed protocol performs as same as the conventional DF but obtains higher spectral efficiency. A variety of numerical results reveal the cooperation can save the network power up to 11dB over direct transmission at BER of $10^{-3}$.

Efficient Spectrum Allocation Method for Cognitive Radio in IEEE 802.22 WRAN (IEEE 802.22 WRAN에서 Cognitive Radio를 위한 효율적인 Spectrum 할당 기법)

  • Kim, Joo-Seok;Kim, Kyung-Seok;Park, Woo-Goo;Kim, Jin-Up
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1068-1075
    • /
    • 2006
  • Frequency resource value is growing bigger more with the development of the wireless communication. But Frequency shortage phenomenon is risen seriously because the need of Frequency resource is very many compared with the supply in an information society of the future. So we need Cognitive technique Radio which is taking the attention recently to use Frequency resource not to be not using efficiently. We propose efficient Dynamic Spectrum Allocation method in IEEE a 802.22 WRAN environment of CR foundation in this paper. To share spectrum more efficiently, we presented some Dynamic Spectrum Allocation technique to apply the Variable bandwidth, Mobility and verified this through the result of the simulations.

Efficient Virtual Network Mapping Method (효율적인 가상 네트워크 대응 방안)

  • Woo, Miae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1793-1800
    • /
    • 2016
  • Network virtualization is considered as an enabling technology to accomodate recently introduced new services such as cloud services and data center networks on top of the existing network environment. In this paper, an efficient virtual network mapping method is proposed which takes account of the location and resource requirements of virtual nodes and the bandwidth requirements of virtual links. The proposed method sets bandwidth as the priority metric for network mapping, and searches for a set of substrate nodes and paths that houses the virtual nodes and virtual links. Through the simulation experiments, it is verified that the proposed method provides better cost to revenue ratio and fast experiment time without degrading success rate of virtual network mapping.