• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.126-134
• /
• 2006

Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

• Current Optics and Photonics
• /
• v.3 no.5
• /
• pp.438-444
• /
• 2019

In this theoretical study, a line-defect photonic-crystal waveguide hosted in an annular photonic crystal was demonstrated to provide high-performance slow light with a wide band, low group-velocity dispersion, and a large normalized delay-bandwidth product. Combined with structural-parameter optimization and selective optofluid injection, the normalized delay-bandwidth product could be enhanced to a large value of 0.502 with a wide bandwidth of 58.4 nm in the optical-communication window, for a silicon-on-insulator structure. In addition, the group-velocity dispersion is on the order of $10^5$ ($ps^2/km$) in the slow-light region, which could be neglected while keeping the signal transmission unchanged.

• Journal of information and communication convergence engineering
• /
• v.3 no.1
• /
• pp.18-22
• /
• 2005

This paper presents the analog adaptive phase-locked loop (PLL) architecture with a new adaptive bandwidth controller to reduce locking time and minimize jitter in PLL output for wireless communication. It adaptively controls the loop bandwidth according to the locking status. When the phase error is large, the PLL increases the loop bandwidth and reduces locking time. When the phase error is small, the PLL decreases the loop bandwidth and minimizes output jitters. The adaptive bandwidth control is implemented by controlling charge pump current depending on the locking status. A 1.28-GHz CMOS phase-locked loop with adaptive bandwidth control is designed with 0.35 $mu$m CMOS technology. It is simulated by HSPICE and achieves the primary reference sidebands at the output of the VCO are approximately -80dBc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.455-464
• /
• 2005

In this paper, we implement resource allocation algorithm based on the WiBro system which including OFDMA, TDD, and we propose the algorithm in order to increase bandwidth efficiency. In this algorithm, data is allocated from the subchannel which has large channel gain to the subchannel which has small channel gain with maximum modulation order. The moment total power is more than available power, the modulation order of the latest subchannel is adjusted. The problem of decreasing of throughput in large channel attenuation environment is solved by allocating additional power. Still, this algorithm has large bandwidth efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.593-601
• /
• 2000

In a multi-bandwidth CDMA system, the performance of multiple order selection combining rake receivers are analyzed according to the spreading bandwidth of the system and the delay spread of the Rayleigh fading channel. The results for various channel environments indicate a tradeoff between total received signal energy and multipath fading immunity. Increasing the occupied bandwidth of the system(wide-bandwidth spreading) gives better performance for small delay spread environments, while gathering more energy(narrow-bandwidth spreading)gives better performance for large delay spread environments. It is shown that the performance difference between low and high order selection combining grows larger as the spreading bandwidth increases. It is also noted that performance degrades by increasing the bandwidth above a certain point and the optimum spreading bandwidth for each channel environment decreases as the delay spread of the channel increases.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.90-94
• /
• 2020

Artificial intelligence (AI) is software that learns large amounts of data and provides the desired results for certain patterns. In other words, learning a large amount of data is very important, and the role of memory in terms of computing systems is important. Massive data means wider bandwidth, and the design of the memory system that can provide it becomes even more important. Providing wide bandwidth in AI systems is also related to power consumption. AlphaGo, for example, consumes 170 kW of power using 1202 CPUs and 176 GPUs. Since more than 50% of the consumption of memory is usually used by system chips, a lot of investment is being made in memory technology for AI chips. MRAM, PRAM, ReRAM and Hybrid RAM are mainly studied. This study presents various memory technologies that are being studied in artificial intelligence chip design. Especially, MRAM and PRAM are commerciallized for the next generation memory. They have two significant advantages that are ultra low power consumption and nearly zero leakage power. This paper describes a comparative analysis of the four representative new memory technologies.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• Journal of electromagnetic engineering and science
• /
• v.2 no.1
• /
• pp.50-55
• /
• 2002

In this paper, Ive propose a bow-tie-shaped meander slot antenna find by a microstrip line to achieve compact size as well as wideband characteristic. While conventional bow-tie slot antennas exhibit wide band characteristic, they have relatively large size. On the other hand, the meander slot antennas are very small, but they reveal quite narrow bandwidth (typically less than 1 %). To realize miniaturized antennas balling large bandwidth, combination of the bow-tie slot and the meander slot geometries is proposed in this paper. Theoretical results show that the proposed antenna with uniform slot width is 65.5 % smaller than that of the conventional bow-tie antenna in size, while the bandwidth is 3 times larger than that of the meander slot antenna. Moreover, the non-uniform slot width antenna shows 60 % smaller in size and about 3.5 times wider in bandwidth than the previous antennas. Measured antenna performance reveals excellent agreement with the predicted values.