• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.543-550
• /
• 2002

This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.158-164
• /
• 2012

Heterogeneous Network and CSG cell are hot issues in the 3GPP LTE/LTE-Advanced system. In this paper, we analyze the system information measurement methods which are essential for handover to CSG cell. Since there have been no sufficient discussion about this problem, we present and analyze five possible solutions. Moreover, we propose a novel solution to reduce system information measurement delay. In the proposed Autonomous Measurement with Parallel Small Gap(AMPSG) method, the UE measures system information of neighbor cells in a parallel manner. As a result, the proposed method shows better delay performance. Therefore, the proposed AMPSG method can reduce handover delay since the UE have to measure the system information of neighbor cells before CSG handover decision.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.111-120
• /
• 2001

VC merging involves distinguishing cells from an identical merged VC label. Various approaches have been proposed to help this identification process. However, most of them incur additional buffering, protocol overhead and/or variable delay. They make the provision of QoS difficult to achieve. So it was proposed a merge capable scheduler to support VC-merging (VCMS). However, in situations where all VCs are to be merged or the incoming traffic load is very low, it could happen that there are not enough non-merging cells to snoop. In this situation the scheduler uses special control cells to fill the empty time slots out. Too many control cells can cause high cell loss ratio and an additional packet transfer delay. To overcome the drawbacks, we propose a Sequence Skipping(SS) method where the sequencers skip the empty queues and insert SS cells. We show SS method is suitable for VC-merging and can reduce the cell loss ratio and the mean packet transfer delay through simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.624-633
• /
• 2018

While the multimedia lecture system has been getting smart using immerging technology, the microphone still relies on the classical approach such as holding in hand or attaching on the body. In this paper, we propose a ceiling mounted array microphone system that allows a wide reception coverage and instructors to move freely without attaching microphone. The proposed system adopts cell and handover of mobile communication instead of a complicated beamforming method and implements a wide range microphone over several cells with low cost. Since the characteristics of unvoiced speech is similar to Pseudo Noise it is shown that soft handover are possible with 3 microphones connected to delay-sum multipath receiver. The proposed system is tested in $6.3{\times}1.5m$ area. For real-time processing the correlation range can be reduced by 82% or more, and the output latency delay can be improved by using the delay adaptive filter.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.139-151
• /
• 1997

An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications (IPC) network. In such a system, there should be interfaces to convent IPC traffic from message format to cell format and vice versa, that is, mechanisms to perform the SAR (Segmentation And Reassembly) sublayer functions. In this paper, we concern the cell reassembly mechanism among them, mainly focussed on buffer management schemes. We consider a few alternatives to implement cell reassembly function block, namely, separated buffering, reserved buffering and shared buffering in this paper. In case of separated and reserved buffering, we employ a continuous time Markov chain for the performance evaluation of cell reassembly mechanism, judicially defining the states of the mechanism. Performance measures such as measage loss probability, mean number of message queued in buffer and average reassembly delay are obtianed in closed forms. In case of shared buffering, we compare the alternatives for implementing cell reassembly function block using simulation because it is almost impossible to analyze the mechanism of shared buffering by analytical modeling. Some illustrations are given for the performance analysis of the alternatives to implement cell reassembly function block.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.2
• /
• pp.153-159
• /
• 2010

Recently, it has been reported that mechanical stimulation takes a role in improving cell growth. Also, became generally known that skeletal system as bone or cartilage tissues take influence of compression loading. In this study, we fabricated a custom-made bioreactor and analyzed that conditions of compressive loading would influence cell growth. To compare the effect of intermittent compressive loading on cell-encapsulated agarose scaffold, we cultured preosteoblast cell (MC3T3-E1 cells) statically and dynamically. And dynamic culture conditions were produced by changing parameters such as the iteration time and interval delay time. Also, cellencapsulated agarose scaffold were subjected to 10 % dynamic compressive strain at 1㎐ frequency for 7 days. After cell culture, cell proliferation was assessed with PI stain assay for fluorescence images and flow cytometry (FACS).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.12-22
• /
• 2000

This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1190-1200
• /
• 1993

In this work, the performance of both delay sensitive traffics and loss sensitive traffics of the output buffered ATM switch with priority control mechanisms has been evaluated. We choose the partial buffer sharing mechanism as the loss priority control mechanism and the HOL(Head Of Line) priority control mechanism as the time priority control mechanism. We model loss sensitive traffics with Poisson process and delay sensitive traffics with MMPP. With loss priority control, it is confirmed that loss probability of loss sensitive traffice decreases when the loss priority control mechanism is chosen. With time priority control, it has also been confirmed that mean cell delay of delay sensitive traffics decreases when the HOL priority control mechanism is used. From this analysis, It has been confirmed that the requirements of QOS for both loss sensitive and delay sensitive traffics can be satisfied in the ATM switch by combining both the loss priority control mechanism and the HOL priority control mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.139-150
• /
• 1997

For high-speed networks, a new ring protocal is proposed in this paper. A ring network combined with destination removal can achieve much higher network throughput than the channel transmission rate. However, such a network exhibits fairness problems. Over a past few years, global fairness algorithms such as ATMR and Metaring have been proposed to solve such problems. But the ring access time delay and fairness in such networks are sensitive to the network parameters such as network size and traffic distribution. In addition to guaranteeing fair ring access to all nodes, there are several other important performance aspects in such networks. The one is that fairness is enforced while node throughputs are kept as high as possible. And another performance measure is access delay and more specifically Head-Of-Line(HOL) delay, i.e., the amount of time the first cell in the transmission buffer of a node has to wait before it accesses the ring. HOL delay is a mijor component in the transmission jitter of the synchronous traffic transmission. A key idea of the proposed ring protocol is to find the nodes that have much more chances to access the ring than any other nodes in the independently distributed node architecture. Since destined by many cells need to share a part of the bandwidths with the next node for the fairness in as much as performance degradation does not become critical. To investigate the performance behavior of the proposed ring protocol for various network condition,s several performance parameters wuch as ring access time delay, and throughput are compared with those of the ATMR and Metaring protocols using simulation package, SIMAN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.179-187
• /
• 2002

This paper proposes and analyzes the iterative groupwise equal-delay interference cancellation(IGEIC) algorithm for coherent detection of an asynchronous wideband DS-CDMA system in a single cell over multipath fading channels. The IGEIC algorithm divide users in a system into several groups, and subtract out interference signal from the received signal as many as the number of users within a user group, iteratively. The IGEIC algorithm is also classified into the iterative groupwise equal-delay serial interference cancellation(IGESIC) algorithm and the iterative groupwise equal-delay parallel interference cancellation(IGEPIC) algorithm. In the case of perfect correlation for spreading codes, it shows that the performance of IGESIC and IGEPIC algorithm is the same after interference cancellation of as many as the number of users within a user group, but the performance of IGEPIC algorithm is superior to the IGESIC algorithm just before fecal cancellation within a user group. The results show that (he performance of the two proposed algorithms are also superior to the SIC algorithm by 3dB.