• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.174-178
• /
• 1991

ATM, the core technology of BISDN, provides a high degree of flexibility with regard to varying bandwidth requirements for different services. In ATM networks, since users may exceed the traffic volume negotiated at the call setup, traffic from users may need to be monitored and enforced to comply with traffic parameters. The leakybucket mechanism is one of the typical traffic enforcement methods based on the use of transmission tokens for each cell. In this mechanism the major system parameters are size of input buffer, size of token pool, and token generation ratio. In order to represent ATM cell arrivals we assume a Poisson process. In this paper, a state transition analysis technique is used to study the cell loss rates for various values of system parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2828-2835
• /
• 1996

In this paper we propose a new shaping algorithm which can control the shaping delay and the output buffer size based on the leaky bucket counter with a threshold value. This paper assumes that input traffic of the proposed shaping algorithm is the worst case traffic tolerated by the continuous leaky bucket algorithm and claracterizes traffic patterns that can depart from our shaping algorithm. We also compare shaping delay and output buffer size of the proposed algorithm with the existing shaping algorithm without a threshold value. Our results show that the proposed shaping algorithm can easily manage the shaping delay and output buffer size than any other mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.615-623
• /
• 2003

This paper presents effective quality-of-service renegotiating schemes for streaming video. The conventional network supporting quality-of-service generally allows a negotiation at call setup. However, it is not efficient for the video application since the compressed video traffic is statistically non-stationary. Thus, we consider the network supporting quality-of-service renegotiations during the data transmission, and study effective quality-of-service renegotiating schemes for streaming video. Simple token bucket model, whose parameters are token filling rate and token bucket size, is adopted for the video traffic model. The renegotiating time instants and the parameters are determined by analyzing the statistical information of compressed video traffic. In this paper, two renegotiating approaches, i.e. fixed renegotiating interval case and variable renegotiating interval case, are examined. Finally, the experimental results are provided to show the performance of the proposed schemes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.95-106
• /
• 2011

Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks. Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries. However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time. In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation(BPA). BPA divides a query region into several cells according to the distribution of sensor nodes and builds a Quad-tree, and then processes aggregate queries in parallel for each cell region according to routing. And it sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results. Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket. In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data. Finally, in this paper, we prove its superiority through various experiments using sensor data.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1183-1194
• /
• 2004

Network partitioning problem is to partition a network into multiple blocks such that the size of cutset is minimized while keeping the block sizes balanced. Among these, iterative algorithms are regarded as simple and efficient which are based on cell move of Fiduccia and Mattheyses algorithm, Sanchis algorithm, or Kernighan and Lin algorithm. All these algorithms stipulate balanced block size as a constraint that should be satisfied, which makes a cell movement be inefficient. Park and Park introduced a balancing coefficient R by which the block size balance is considered as a part of partitioning cost, not as a constraint. However, Park and Park's algorithm has a square time complexity with respect to the number of cells. In this paper, we proposed Bucket algorithm that has a linear time complexity with respect to the number of cells, while taking advantage of the balancing coefficient. Reducing time complexity is made possible by a simple observation that balancing cost does not vary so much when a cell moves. Bucket data structure is used to maintain partitioning cost efficiently. Experimental results for MCNC test sets show that cutset size of proposed algorithm is 63.33% 92.38% of that of Sanchis algorithm while our algorithm satisfies predefined balancing constraints and acceptable execution time.

• Journal of Navigation and Port Research
• /
• v.41 no.6
• /
• pp.373-380
• /
• 2017

Operational errors caused by human factors, which is the major cause of marine accidents, include lack of knowledge, misunderstanding knowledge, and inadequate procedures. Recently, the type of propulsion mounted on KCG cutters has been diversified. In particular, the water jet propulsion unit, which was mainly installed in small boats, have been gradually expanded to medium and large size Coast Guard cutters, reaching 50% of the total. Axes types are divided into 2 to 4, and the bucket types are divided into Double Reverse Bucket(DRB) and Single Reverse Bucket(SRB); in these, the backward and steering control methods are completely different. Diversification of these operating systems can increase factors causing human error by the ships' operators. However, there is a lack of research on the maneuvering methods, considering the inherent active characteristics of each type of water jet. In this paper, we analyze the sideway method suitable for the condition of Coast Guard Exclusive wharf without assistance, based on the astern performance of each type. Then, a ship handling simulator was used for the experiment; they compared and verified through interviews of captains.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.583-592
• /
• 1998

In this paper, the cell loss rate is analyzed in terms of the input traffic stream of different speed in ATM network. The cell loss rate is calculated by birth-death process of Leaky-Bucket mechanism as the representative algorithm of usage parameter control. The cell loss rate assumed 2-state MMPP input process to be birth-death process by considering the character of token pool about finite capacity queue. The results from numerical analysis show that the cell loss rate decreases abruptly according to the buffer size increase. The computer simulation by SIMSCRIPT II.5 has been done and compared with on/off input source case to verify the analysis results.

• 한국태양에너지학회:학술대회논문집
• /
• 2008.11a
• /
• pp.280-287
• /
• 2008

In case of low pressure steam turbine used in power plant, it was operated in wet steam and high stress condition. Therefore, it is possible that the corrosion damage of low pressure was induced by this condition. According to previous study, about 30% of total blade failure correspond to corrosion fatigue or SCC(stress corrosion cracking) in low pressure turbine. Especially, LSB(last stage bucket) of low pressure turbine has a higher hardness to prevent erosion damage due to water droplet however, generally this is more dangerous for SCC damage. Therefore, to improve reliability of turbine blade. various methods for SCC evaluation has been developed. In this study, the crack found in LSB during in-service inspection was evaluated using microstructure analysis and stress analysis. From the stress analysis, the optimum size of fillet to remove the crack was proposed. And also, the reliability was evaluated for modified LSB using GOODMAN diagram.

• Coupled systems mechanics
• /
• v.2 no.1
• /
• pp.23-51
• /
• 2013

An analytical algorithm for the estimation of the resistance forces exerted on the dipper of a cable shovel and the specific energy consumed in the cutting-loading process is presented. Forces due to payload and to cutting of geomaterials under given initial conditions, cutting trajectory of the bucket, bucket's design, and geomaterial properties are analytically computed. The excavation process has been modeled by means of a kinematical shovel model, as well as of dynamic payload and cutting resistance models. For the calculation of the cutting forces, a logsandwich passive failure mechanism of the geomaterial is considered, as has been found by considering that a slip surface propagates like a mixed mode crack. Subsequently, the Upper-Bound theorem of Limit Analysis Theory is applied for the approximate calculation of the maximum reacting forces exerted on the dipper of the cable shovel. This algorithm has been implemented into an Excel$^{TM}$ spreadsheet to facilitate user-friendly, "transparent" calculations and built-in data analysis techniques. Its use is demonstrated with a realistic application of a medium-sized shovel. It was found, among others, that the specific energy of cutting exhibits a size effect, such that it decreases as the (-1)-power of the cutting depth for the considered example application.