• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제12권5호
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• The KIPS Transactions:PartA
• /
• 제12A권5호
• /
• pp.341-354
• /
• 2005

The main bottleneck for large scale VOD systems is bandwidth of storage or network I/O due to the large number of client requests simultaneously, and then efficient techniques are required to solve the bottleneck problem of the VOD system. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, called P2P proxy patching, for improving the typical patching technique by jointly using the prefix caching and P2P proxy. In our proposed scheme, each client plays a role in a proxy to multicast a regular stream to other clients that request the same video stream. Due to the use of the P2P proxy and the prefix caching, the client requests that ive out of the patching window range can receive the regular stream from other clients in the previous patching group without allocating the new regular channels from the VOD server to the clients. In the performance study, we show that our patching scheme can reduce the server bandwidth requirement about $33\%$ less than that of the existing patching technique with respect to prefix size and request interval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4063-4086
• /
• 2016

Cloud computing is a robust technology, which facilitate to resolve many parallel distributed computing issues in the modern Big Data environment. Hadoop is an ecosystem, which process large data-sets in distributed computing environment. The HDFS is a filesystem of Hadoop, which process data blocks to the cluster nodes. The data block placement has become a bottleneck to overall performance in a Hadoop cluster. The current placement policy assumes that, all Datanodes have equal computing capacity to process data blocks. This computing capacity includes availability of same storage media and same processing performances of a node. As a result, Hadoop cluster performance gets effected with unbalanced workloads, inefficient storage-tier, network traffic congestion and HDFS integrity issues. This paper proposes a storage-tier-aware Robust Data Placement (RDP) scheme, which systematically resolves unbalanced workloads, reduces network congestion to an optimal state, utilizes storage-tier in a useful manner and minimizes the HDFS integrity issues. The experimental results show that the proposed approach reduced unbalanced workload issue to 72%. Moreover, the presented approach resolve storage-tier compatibility problem to 81% by predicting storage for block jobs and improved overall data block placement by 78% through pre-calculated computing capacity allocations and execution of map files over respective Namenode and Datanodes.

• IE interfaces
• /
• 제11권3호
• /
• pp.77-87
• /
• 1998

Intelligent Peripheral(IP) system is to provide specialized resource functions (SRF) such as playing announcement, collecting user information, and receiving messages in the Advanced Intelligent Network (AIN). We analyze the call processing capacity of an AIN IP system being developed in ETRI through an extensive simulation using SLAM II under a variety of AIN service scenarios. We consider televoting (VOT) and universal personal telecommunication (UPT) services which are to be provided at the fit implementation of the AIN in Korea. As the performance criteria to determine the call processing capacity, processor utilization, delay and call loss probability are considered. It turns out that the major processor called SAMP is the bottleneck processor, the service response delay dominates the delay performance, and the call loss probability becomes the primary criterion in determining the call processing capacity of the AIN IP system. It is also shown that the call processing capacity of the AIN IP system is determined by the utilization of the processor and the delay performance when the VOT ratio is below 70 percent but it is determined by the call loss probability due to the lack of service channels for providing the SRF operations.

• Journal of Korea Multimedia Society
• /
• 제13권2호
• /
• pp.258-264
• /
• 2010

In the Ad-hoc networks, the limitation on the availability of power for operation is a significant bottleneck, given the requirements of portability, weight, and size of mobile devices. Hence, the use of routing metrics that consider the capabilities of the power sources of the network nodes contributes to the efficient utilization of energy. This paper presents a QoS routing protocol that minimize the power consumed by a packet in traversing from source node to the destination node. Results obtained of simulation show that, with our approach we can reduce the power consumption of nodes and increases the life time of the network.

• Proceedings of the Korea Contents Association Conference
• /
• 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
• /
• pp.851-855
• /
• 2009

Constructing CDS in wireless ad-hoc network, it is necessary to make more efficient algorithm that is fast, simple and has low power consumption. It is worried about losing data which brought a bottleneck state from confliction and delay when the nodes are concentrated or CDS is reconstructed. So, after constructing most efficient CDS, It is better not to reconstruct CDS in moveless wireless ad-hoc network. In this paper, we compared and estimated the performance in each situation of a CDS construction algorithm based on Node degree and Energy level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4519-4533
• /
• 2015

Hypertext Transfer Protocol (HTTP) adaptive streaming has become a new trend in video delivery. An HTTP adaptive streaming client needs to effectively estimate resource availability and demand. However, due to the bitrate of the video encoded in variable bitrate (VBR) mode, a bitrate mismatch problem occurs. With the rising demand for mobile devices, the likelihood of cases where two or more HTTP adaptive streaming clients share the same network bottleneck and competing for available bandwidth will increase. These mismatch and competition issues lead to network congestion, which adversely affects the Quality of Experience (QoE). To solve these problem, we propose a video rate adaptation scheme for the HTTP video streaming to guarantee and optimize the QoE. The proposed scheme estimates the available bandwidth according to the bitrate of each segment and also schedules the segment request time to expedite the response to the bandwidth variation. We used a multi-client simulation to prove that our scheme can effectively cope with drastic changes in the connection throughput and video bitrate.

• Journal of the Korea Society of Computer and Information
• /
• 제16권5호
• /
• pp.153-162
• /
• 2011

The minimum cut problem is to minimize c(S,T), that is, to determine source S and sink T such that the capacity of the S-T cut is minimal. The flow-based algorithm is mostly used to find the bottleneck arcs by calculating flow network, and does not presents the minimum cut. This paper suggests an algorithm that simply includes the maximum capacity vertex to adjacent set S or T and finds the minimum cut without obtaining flow network in advance. On applying the suggested algorithm to 13 limited graphs, it can be finds the minimum cut value $_{\min}c$(S, T) with simply and correctly.

• Journal of IKEEE
• /
• 제21권3호
• /
• pp.240-243
• /
• 2017

CAN (controller area network) suffers from data bottleneck since the number of in-vehicle electronic modules significantly increases. To mitigate this problem, CAN-FD (CAN with flexible data rate) has been proposed. Transmission speed is same with CAN in arbitration phase but much higher than CAN in data phase, which successfully achieves both compatibility and efficiency. In this paper, a CAN-FD controller was designed in Verilog HDL and it was implemented and verified in FPGA. The designed controller can perform CAN-FD version 1.0 and CAN version 2.0A, 2.0B. Synthesized in 0.18um technology, its size is about 46,300 gates.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2010년도 추계학술대회
• /
• pp.465-467
• /
• 2010

This paper proposes MIMO two-way cooperative relay scheme to optimize the end to end capacity in wireless multi-hop mesh network. The basic idea is to perform data transmission via multi-hop relay nodes, in equidistant topology, this method is quite efficient. However, on one hand this topology is very rare in practical situation, on the other hand, in real practical situation where the topology is most likely non equidistant, the end to end capacity significantly degrades due to bottleneck link caused by uneven SNR. Moreover, the end to end capacity degrades at high SNR due to overreach interference from far nodes existing in multi-hop relay networks. In this paper, MIMO two-way cooperative relay in the region of non equidistant nodes is found efficient to improve the end to end capacity. The proposed scheme is validated using numerical simulation.