• Journal of Communications and Networks
• /
• 제12권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)
• /
• 제2권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.

• 대한전자공학회논문지TC
• /
• 제43권3호
• /
• pp.126-134
• /
• 2006

현재 인터넷에서 널리 사용되고 있는 TCP는 대역폭과 지연의 곱이 큰 네트워크에서 특히 초기 시동단계를 포함하여 전반적으로 효율이 낮은 문제가 있다. 본 논문은 이 문제를 해결하기 위해 지연기반 혼잡제어(DCC: Delay-based Congestion Control) 방법을 제안한다. DCC는 선형과 지수 증가구간으로 나누어진다. 선형증가 구간은 기존의 TCP 혼잡회피 기법과 유사하며, 지수증가 구간은 혼잡에 의한 지연이 없는 경우 신속한 대역 확보를 위해 사용된다. 일반 TCP에서는 slow-start와 같은 지수증가 구간에서 대역과 지연의 곱으로 결정되는 크기의 버퍼가 제공되지 않는 경우 대역이 충분함에도 불구하고 손실이 발생하여 성능을 제한할 수 있다. 따라서 DCC에서는 RTT(Round Trip Time) 상태와 예측된 버퍼크기를 이용하여 지수증가 구간의 공급초과로 인한 손실을 방지하는 메카니즘을 제안한다. 시뮬레이션 결과를 통하여 대역과 지연의 곱이 큰 네트워크에서 DCC가 TCP에서 초기 시동시간과 throughput성능을 향상시킴을 보였다.

• Current Optics and Photonics
• /
• 제3권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
• /
• 제3권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.

• 한국통신학회논문지
• /
• 제30권6A호
• /
• pp.455-464
• /
• 2005

본 논문에서는 OFDMA, TDD 전송방식을 채택한 WiBro 시스템 표준의 resource 할당 알고리듬을 시뮬레이션을 통해 구현하였고, bandwidth efficiency를 보다 더 높이기 위한 알고리듬을 제안하였다. 제안하는 알고리듬은, 변조지수를 최대로 하여 채널 이득이 큰 subchannel부터 작은 subchannel 순서로 비트를 할당한다. 이 때 subchannel의 수를 증가시킴으로 인해 전송되어야 할 power가 증가하는데, 이 power가 available power를 넘는 순간에 할당되는 subchannel의 변조지수를 조정하여 available power를 넘지 않게 하는 방법이다. 기존의 greedy algorithm이나 WiBro 시스템과 비교하였을 때, 제안하는 알고리듬을 적용할 경우 power가 제한되어 있는 것으로 인해 사용되는 subchannel의 수가 현저히 작아져서 bandwidth efficiency 측면에서는 좋은 성능을 나타내게 한다. 하지만 channel attenuation이 큰 환경에서는 최대 throughput이 떨어지는 문제점이 발생하는데, 타 시스템에서 지원하는 만큼의 throughput을 보장하는 문제 역시 중요하기 때문에, 이를 극복하기 위해 이 경우에는 available power를 추가 할당하여 사용되는 subchannel수를 증가시켰다. 이 경우, 기존 시스템과 비슷한 throughput을 보장하면서 bandwidth 이득은 더 높게 얻을 수 있음을 확인하였다.

• 한국통신학회논문지
• /
• 제25권5A호
• /
• pp.593-601
• /
• 2000

다중 대역 확산 CDMA 시스템에서 확산 대역폭과 레일리 페이딩 채널의 지연 확산에 대한 다중 선택 결합 RAKE 수신기의 성능을 분석하여, 지연 확산이 다른 여러 채널 환경에서 RAKE 수신기 차수에 따른 전체 수신 에너지와 다중 경로 다이버시티 이득간의 상호 관계를 규명하였다. 분석 결과, 지역 확산이 작은 환경에서의 광대역 확산을 이용하여 확산 대역폭을 증가시키는 것이 더 좋은 성능을 나타냈다. 높은 차수와 낮은 차수의 선택 결합기간의 성능 비교 결과, 확산 대역폭이 증가할수록 그 성능 차가 더 크게 나타났다. 또한, 확산 대역폭을 일정수준 이상으로 증가시킬 경우 수신 성능이 저하되었으며, 각 채널 환경에서의 최적 확산 대역폭은 채널의 지연 확산이 증가할수록 감소하였다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2010년도 추계학술발표대회
• /
• 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
• /
• 제2권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.