• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.527-539
• /
• 2001

The wireless asynchronous transfer mode (ATM) system has the advantage of providing the broadband services with various quality-of-service requirements to the mobile terminal efficiently by utilizing the ATM technology developed for the wired ATM system. The available bit rate (ABR) service among various ATM services utilizes the available bandwidth remaining in the ATM link, which allows the efficient bandwidth usage. During the handoff of the mobile terminal, however, the queue length in the access point (AP) which resides in the boundary of the wired ATM network and the wireless ATM network may increase abruptly. In this paper, we propose a scheme which prevents the buffer-overflow and buffer-underflow in the AP during the handoff of the wireless ABR connection in the wireless ATM system using binary feedback rate-based ABR traffic control. This scheme controls the source's cell generation rate during both handoff period and some time interval after the completion of the handoff procedure. The simulation results show that the proposed scheme prevents the buffer-overflow and buffer-underflow. The proposed scheme can contribute to increasing the throughput of the wireless ABR service during handoff by preventing the buffer overflow and underflow during handoff period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.675-682
• /
• 2000

In this paper, we propose a new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT). The proposed scheme is based on the per-class queueing mechanism in which a number of connections of similar characteristics are multiplexed into one class-queue. Traffic classes of the proposed method are classified into a single non-real-time traffic class and other real-time traffic classes. The proposed scheme determines the weights of classes according to the input traffic and delay characteristics of each class at the beginning of every cycle. Furthermore, this scheme incorporates a cell discarding method to reduce the QoS degradation that may be incurred by congestion of networks. We have evaluated the proposed scheme through discrete-event simulation. Simulation results indicate that the proposed scheme can reduce the average delay of non-real-time class while maintaining the QoS of real-timeclasses. The proposed algorithm can be effectively applied to high-speed networks such as ATM networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.1-9
• /
• 2010

In this paper we propose a scheduling algorithm for supporting Quality of Service(QoS) in IEEE 802.11e HCCA referred to as ASR-DRR and ASD-DRR, which aims at providing improved performance for the support of multimedia traffic. Although We identify the problem of the current IEEE 802.11e HCCA (Hybrid Coordination Function Controlled Channel Access) scheduler and its numerous variations, that the queue information cannot be notified to the Hybrid Coordinator (HC) timely, therefore the uplink delay lengthens unnecessarily. We suggests a simple solution and a couple of implementation practices, namely the Adaptive Scheduler with RTS/CTS (ASR) and Adaptive Scheduler with Data/Ack (ASD). They are both further elaborated to emulate the Deficit Round Robin (DRR) scheduler. They are also compared with existing exemplary schedulers through simulation, and shown to perform well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.344-365
• /
• 2009

The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

• International Journal of Highway Engineering
• /
• v.16 no.5
• /
• pp.109-119
• /
• 2014

PURPOSES : The control delay in seconds per vehicle is the most important traffic operational index to evaluate the level of service of signalized intersections. Thus, it is very critical to calculate accurate control delay because it is used as a basic quantitative evidence for decision makings regarding to investments on traffic facilities. The control delay consists of time-in-queue delay, acceleration delay, and deceleration delay so that it is technically difficult to directly measure it from fields. Thus, diverse analysis tools, including CORSIM, SYNCHRO, T7F, VISTRO, etc. have been utilized so far. However, each analysis tool may use a unique methodology in calculating control delays. Therefore, the estimated values of control delays may be different by the selection of an analysis tool, which has provided difficulties to traffic engineers in making solid judgments. METHODS : This study was initiated to verify the feasibility of diverse analysis tools, including HCM methodology, CORSIM, SYNCHRO, T7F, VISTRO, in calculating control delays by comparing estimated control delays with that measured from a field. RESULTS : As a result, the selected tools produced quite different values of control delay. In addition, the control delay value estimated using a calibrated CORSIM model was closest to that measured from the field. CONCLUSIONS : First, through the in-depth experiment, it was explicitly verified that the estimated values of control delay may depend on the selection of an analysis tool. Second, among the diverse tools, the value of control delay estimated using the calibrated microscopic traffic simulation model was most close to that measured from the field. Conclusively, analysts should take into account the variability of control delay values according to the selection of a tool in the case of signalized intersection analysis.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.400-404
• /
• 2009

Native Command Queueing is a technology to maximize throughput of disk system by reordering requests in its command queue. Recent S-ATA 2 standard specifies a protocol for the purpose of dealing with NCQ feature, making most vendors implementing it in their disk devices. However, the new feature, NCQ, may lead to information gap between OS and disk drive. 05 considers that disk will service I/O requests in the order as OS has dispatched. Unfortunately, it isn't true any more since NCQ would simply ignore the policy of OS and reorder the sequence OS has expected. Let us define the term as expectation-discord. Due to the discord, serious performance anomalies or starvation of requests may occur in I/O subsystem. In this paper, we confirm that the expectation-discord actually brings about starvation of requests. We propose a solution to settle it. Our solution is very simple, effective, cheap(not requiring any hardware modification) and portable across various OS. Experimental results show that our solution can balance throughput and response time very well.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2553-2562
• /
• 2013

It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.3-11
• /
• 2000

This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. TBPJ scheme shows also better performance than that of HOL scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.1-7
• /
• 2013

Big data management is becoming increasingly important in both industry and academia of information science community. One of the important categories of big data generated from software systems is log data. Log data is generally used for better services in various service providers and can also be used as information for qualification. This paper presents a big data management architecture specialized for log data. Specifically, it provides the aggregation of log messages sent from multiple clients and provides intelligent functionalities such as analyzing log data. The proposed architecture supports an asynchronous process in client-server architectures to prevent the potential bottleneck of accessing data. Accordingly, it does not affect the client performance although using remote data store. We implement the proposed architecture and show that it works well for processing big log data. All components are implemented based on open source software and the developed prototypes are now publicly available.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.87-94
• /
• 2003

As the number of the Internet users increases explosively, a solution for this problem is web caching. So, many techniques on improving cache server performance have been suggested. In this paper, we analyze the cause of the bottleneck in cache servers, and propose an arbitral thread and delayed caching mechanism as a solution. We use an arbitral thread in order to provide a quick service to user requests through eliminating the ready multi-thread search problem in case of disk writing operation. We also use delayed caching in order to provide stable system operation through avoiding overloaded disk operation and queue threshold. Proposed cache server is implemented through modification on SQUlD cache server, and we compare its performance with the original SQUID cache server.