• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.591-595
• /
• 2005

In this paper, we propose the fairness improvement leaky bucket (PILB) algorithm as a traffic policing mechanism. In the proposed algorithm, there is a cell buffer for every ATM connection in order to store date cells. Network decides whether an ATM connection obeys the contracted traffic parameter, and stores data cells in the cell buffer if the connection obeys but is considered as violated the contract due to temporary lack of network resource. By using the proposed algorithm, we can obtain the statistical multiplexing gain that is the superiority of packet switching network. Moreover, when a connection tries to transmit more data cells by violating the contracted traffic parameters, the connection is prevented from using excess network resource, which incurs all connections sharing network resource fairly. The performance of the proposed FILB algorithm is investigated by using the simulation. The result shows that the proposed algorithm provides superior performance and all connections within a group share network resource fairly. The proposed algorithm can be applied not only the ATM network but also IP network.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1049-1056
• /
• 2015

Runtime Intrusion Prevention Evaluator (RIPE), published in 2011, is a benchmark suite for evaluating mitigation techniques against 850 attack patterns using only buffer overflow. Since RIPE is built as a single process, defense and attack routines cannot help sharing process states and address space layouts when RIPE is tested. As a result, attack routines can access the memory space for defense routines without restriction. We separate RIPE into two independent processes of defense and attacks so that mitigations based on confidentiality such as address space layout randomization are properly evaluated. In addition, we add an execution mode to test robustness against brute force attacks. Finally, we extend RIPE by adding 38 attack forms to perform format string attacks and virtual table (vtable) hijacking attacks. The revised RIPE contributes to the diversification of attack patterns and precise evaluation of the effectiveness of mitigations.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1067-1076
• /
• 2003

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• Journal of Biomedical Engineering Research
• /
• v.28 no.6
• /
• pp.803-810
• /
• 2007

Although synthetic aperture focusing techniques can improve the spatial resolution of ultrasound imaging, they have not been employed in a commercial product because they require a real-time N-channel beamformer with a tremendously increased hardware complexity for simultaneous beamforming along M multiple lines. In this paper, a hardware-efficient beamformer architecture for synthetic aperture focusing is presented. In contrast to the straightforward design using NM delay calculators, the proposed method utilizes only M delay calculators by sharing the same values among the focusing delays which should be calculated at the same time between the N channels for all imaging points along the M scan lines. In general, synthetic aperture beamforming requires M 2-port memories. In the proposed beamformer, the input data for each channel is first upsampled with a 4-fold interpolator and each polyphase component of the interpolator output is stored into a 2-port memory separately, requiring 4M 2-port memories for each channel. By properly limiting the area formed with the synthetic aperture focusing, the input memory buffer can be implemented with only 4 2-port memories and one short multi-port memory.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.2
• /
• pp.167-178
• /
• 2000

Software RAID(Redundant Arrays of Inexpensive Disks) is defined as a storage system that provides capabilities of hardware RAID, and guarantees high reliability as well as high performance. In this paper, we propose an enhanced disk scheduling algorithm and a scheme to guarantee reliability of data. We also design and implement software RAID by utilizing these mechanism to develop a storage system for multimedia applications. Because the proposed algorithm improves a defect of traditional GSS algorithm that disk I/O requests arc served in a fixed order, it minimizes buffer consumption and reduces the number of deadline miss through service group exchange. Software RAID also alleviates data copy overhead during disk services by sharing kernel memory. Even though the implemented software RAID uses the parity approach to guarantee reliability of data, it adopts different data allocation scheme. Therefore, we reduce disk accesses in logical XOR operations to compute the new parity data on all write operations. In the performance evaluation experiments, we found that if we apply the proposed schemes to implement the Software RAID, it can be used as a storage system for small-sized video-on-demand servers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.374-395
• /
• 2017

Users quite often experience volatile channel conditions which negatively influence multimedia transmission. HTTP adaptive streaming has emerged as a new promising technology where the video quality can be adjusted to variable network conditions. Nevertheless, the new technology does not remain without drawbacks. As it has been observed, multiple video players sharing the same network link have often problems with achieving good efficiency and stability of play-out due to a mutual interference and competition among video players. Our investigation indicates that there may be another cause for under-performance of the streamed video. In an emulated environment, we implemented three algorithms of adaptive video play-out based on bandwidth or buffer assessment. As we show, traffic generated by players employing the same or similar play-out strategies is positively correlated and synchronised (clustered), whereas traffic originated from different play-out strategies shows negative or no correlations. However, when some of the parameters of the play-out strategies are randomised, the correlation and synchronisation diminish what has a positive impact on the smoothness of the traffic and on the video quality perceived by end users. Our research shows that non-correlated traffic flows generated by play-out strategies improve efficiency and stability of streamed adaptive video.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.779-792
• /
• 1993

In a switching node or an ATM multiplexer of the ATM network, a good bandwidth utilization can be achieved by the priority control using the 1-bit(Cell Loss priority) in ATM cell header. In this paper, the mixed mechanism is proposed to make up for shortcomings of existing space priority control mechanisms and to decrease the loss probability of high priority cell and its performance is analyzed about the cell loss probability. To estimate the performance of proposed mixed mechanism, its cell loss probability is compared with those of non-priority mechanism, push-out mechanism and partial buffer sharing mechanism. The cell loss probability is analyzed using a M/D/1/N modeling and a 2-state MMPP/D/1/N modeling and also comparison between two modelings is made. To verify this result of numerical analysis, the computer simulation is performed for each mechanism using the simulation language, SIMSRIPT II.5.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2797-2808
• /
• 1998

Multimedia scenario database system is a read-only multimedia-on-demand system which transfers scenarios representing the display ordering of multimedia objects. A scenario is a graph of multimedia objects and it contains spatial, temporal and contextual information of multimedia data. By structuring multimedia objects as a scenario, it is possible to enforce their display order based on their context. Furthermore, it can provide multiple display paths as well as the sharing of objects between different scenarios. As a result, the multimedia scenario database system can perform the pre-scheduling of multimedia objects, which makes it possible to reorder the transmission order of objects in a scenario. Consequently, the overall system resource such as data buffer and network bandwidth can be highly utilized. In this paper, we discuss the requirements of structuring a scenario to design a scenario database that stores and manages multimedia scenario. Furthermore, we devise and analyze several scheduling policies based on the reordering mechanism for the objects in a scenario.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.45-57
• /
• 2005

In this paper, we extend the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. Even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congetion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps. By analyzing the periodic bursty behavior of the source IP queue, we derive estimated for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations.