• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1134-1143
• /
• 2000

We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.3
• /
• pp.328-334
• /
• 2012

This paper proposes a design technique of wide-band antenna for handy phone with 700 MHz LTE(Long Term Evolution) low frequency bandwidth. The proposed antenna based on the PIFA(Planar Inverted-F type Antenna) structure was designed and considered. In order to realize the wide bandwidth, a round structure which is able to control the electric path length of current and a branch line element which can be obtain the dual resonance characteristics were introduced in this design. As a result, It was realized about 95 MHz bandwidth in spite of very small space of $30{\times}34mm$ used for FR-4 substrate with relative permitivity of 4.4 at 700 MHz band. Measurement results of return loss, bandwidth and gain radiation pattern were agreed well with their calculation results.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.4
• /
• pp.387-392
• /
• 2014

In this paper, the broadband antenna design, which can be applied to USB Dongle, supporting Wibro(2.3~2.4 GHz), Wi-Fi(2.4~2.5 GHz) and LTE7(2.5~2.7 GHz) is proposed technique. The proposed antenna was designed similar to PIFA type antennas. Reactive elements were used to control the input impedance and wideband characteristics were achieved by controlling coupling between the feed structure and the radiator. As a result, the antenna printed on FR-4 PCB(${\epsilon}_r$ =4.4, tan ${\delta}$=0.02) occupying an area of $15{\times}5mm^2$ was able to achieve bandwidth of 1 GHz from 2.1 to 3.1 GHz under VSWR=2. Measured return loss characteristics, bandwidth and radiation patterns were in good agreement with the simulated results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.486-495
• /
• 2002

In this paper, we propose a delay reduction method for frame-based packet transmit scheduling algorithm. A high-speed network such as ATM network has to provide some performance guarantees such as bandwidth and delay bound. Framing strategy naturally guarantees bandwidth and enables simple rate-control while having the inherently bad delay characteristics. The proposed delay reduction method uses the same hierarchical frame structure as HRR (Hierarchical Round-Robin) but does not use the static priority scheme such as round-robin. Instead, we use a dynamic priority change scheme so that the delay unfairness between wide bandwidth connection and narrow bandwidth connection can be eliminated. That is, we use FIFO (First-In First-Out) concept to effectively reduce the occurrence of worst-case delay and to enhance delay distribution. We compare the performance for the proposed algorithm with that of HRR. The analytic and simulation results show that HFIFO inherits almost all merits of HRR with fairly better delay characteristics.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.5
• /
• pp.562-571
• /
• 2008

In this paper, we propose a novel structure of a spiral antenna with a CP characteristic for RFID reader in UHF band. Since the proposed antenna can be built by printing on a FR-4 substrate, it is appropriate for low-cost mass-production. The antenna is designed to operate in UHF band of $860{\sim}960$ MHz. The CP bandwidth is Increased enough to cover an overall UHF RFID band by using a spiral structure for the antenna arm. The matching bandwidth is broadened by using a quarter-wave transformer between the fred and the antenna body. The proposed antenna has advantages of its easy gain and pattern control with a small antenna size. The measured antenna performance shows the matching bandwidth of 13%, the CP bandwidth of 23%, and the gain of 6.5 dBi. This verifies that the proposed antenna is appropriate for RFID antennas in UHF band.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.886-895
• /
• 2004

In this paper, we propose the dynamic allocation scheme of the CPU bandwidth to efficiently integrate and schedule these tasks in the same system, where multimedia tasks and hard real-time tasks can coexist simultaneously. Hard real-time tasks are guaranteed based on worst case execution times, whereas multimedia tasks modeled as soft real-time tasks are served based on mean parameters. This paper describes a server-based allocation scheme for assigning the CPU resource to two types of tasks. Especially for MPEG video streams, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task. The primary purpose of the proposed method is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks present in the system. We showed through simulations that the tardiness experienced by multimedia tasks under the proposed allocation scheme is much smaller than that experienced by using other scheme.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• Journal of the Korean Society of Radiology
• /
• v.10 no.8
• /
• pp.629-635
• /
• 2016

ACR phantom for quality control of magnetic resonance imaging equipment can evaluate magnetic resonance imaging picture quality through various structures within the phantom. In this study, percent Signal Ghosting and Slice position accuracy of imaging could be analyzed by attaching implant and the wire for correction of tooth using ACR phantom in Head coil of 3.0T equipment. In the T1 weighted imaging of the first slice and the eleventh slice of implant, the slice position accuracy appeared to be good in ingress bandwidth 300, and it was good in ingress bandwidth 130 when wire for correction was attached. Percent Signal Ghosting in the seventh slice of SE T1 weighted imaging, implant and wire for correction added all appeared to be good when ingress bandwidth was 230. It is thought that in case of implant dental prosthesis patients in brain exam using magnetic resonance imaging, optimum image can be obtained by changing ingress bandwidth.