• Title/Summary/Keyword: network flow

Search Result 2,342, Processing Time 0.034 seconds

A Study on TCP-friendly Congestion Control Scheme using Hybrid Approach for Multimedia Streaming in the Internet (인터넷에서 멀티미디어 스트리밍을 위한 하이브리드형 TCP-friendly 혼잡제어기법에 관한 연구)

  • 조정현;나인호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.837-840
    • /
    • 2003
  • Recently the multimedia streaming traffic such as digital audio and video in the Internet has increased tremendously. Unlike TCP, the UDP protocol, which has been used to transmit streaming traffic through the Internet, does not apply any congestion control mechanism to regulate the data flow through the shared network. If this trend is let go unchecked, these traffic will effect the performance of TCP, which is used to transport data traffic, and may lead to congestion collapse of the Internet. To avoid any adverse effort on the current Internet functionality, A study on a new protocol of modification or addition of some functionality to existing transport protocol for transmitting streaming traffic in the Internet is needed. TCP-frienly congestion control mechanism is classified with window-based congestion control scheme and rate-based congestion control scheme. In this paper, we propose an algorithm for improving the transmitting rate on a hybrid TCP-friendly congestion control scheme combined with widow-based and rate-based congestion control for multimedia streaming in the internet.

  • PDF

Groundwater Recharge Assessment via Grid-based Soil Moisture Route Modeling (격자기반의 토양수분 추적에 의한 지하수함양량 추정기법 개발)

  • Kim, Seong-Jun;Chae, Hyo-Seok
    • Journal of Korea Water Resources Association
    • /
    • v.33 no.1
    • /
    • pp.61-72
    • /
    • 2000
  • The purpose of this study is to improve the method of evaluating groundwater recharge by using grid-based soil moisture routing technique. A model which predicts temporal variation and spatial distribution of soil moisture on a daily time step was developed. The model uses ASCII-formatted map data supported by the irregular gridded map of the GRASS(Geographic Resources Analysis Support System)-GIS and can generate daily and monthly spatial distribution map of surface runoff, soil moisture content, evapotranspiration within the watershed. The model was applied to Ipyunggyo watershed($75.6\;\textrm{km}^2$) located in the upstream of Bocheongchun watershed. Seven maps; DEM(Digital Elevation Mode]), stream, flow path, soil, land use, Thiessen network and free groundwater level, were used for input data. Predicted streamflows resulting from two years (l995, 1996) daily data were compared with the observed values at the watershed outlet. The results of temporal variations and spatial distributions of soil moisture are presented by using GRASS GIS. As a final result, the monthly predicted groundwater recharge was presented.sented.

  • PDF

Statistic Signature based Application Traffic Classification (통계 시그니쳐 기반의 응용 트래픽 분류)

  • Park, Jin-Wan;Yoon, Sung-Ho;Park, Jun-Sang;Lee, Sang-Woo;Kim, Myung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1234-1244
    • /
    • 2009
  • Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services and applications on Internet, which makes the need of application-level traffic classification important for the efficient management and control of network resources. Although lots of methods for traffic classification have been introduced in literature, they have some limitations to achieve an acceptable level of performance in terms of accuracy and completeness. In this paper we propose an application traffic classification method using statistic signatures, defined as a directional sequence of packet size in a flow, which is unique for each application. The statistic signatures of each application are collected by our automatic grouping and extracting mechanism which is mainly described in this paper. By matching to the statistic signatures we can easily and quickly identify the application name of traffic flows with high accuracy, which is also shown by comprehensive excrement with our campus traffic data.

The Performance Improvement for Congestion Control under TCP Traffic in Wireless Network (무선네트워크 전송기반에서 프로토콜에 의한 트래픽 혼잡제어)

  • Ra, Sang-Dong;Kim, Moon-Hwan;Lee, Sung-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.965-973
    • /
    • 2007
  • We analyzed that the loss of data in TCP protocol based wireless networks caused by overlapped responses in bi-directional nodes that were resulted in out of the data sequence. This loss can be prevented by using revised TCP rate control algorithm and the performance of throughput can also be improved. The rate control algorithm is applied when the congestion happens between nodes while traffic packets are retransmitting in TCP bandwidth. In addition to applying the rate control algorithm, we determine the number of system clients in bandwidth and the average of pausing time between transmitting serial files to produce a competitive level so that an efficient performance of rapid retransmitting for the loss of multi-packets. This paper discusses the improvement of congestion control in that the decrease of the loss, firstly, as ensuring an efficient connection rate and, secondly, as using sliding window flow control.

Experiment and Implementation of a Machine-Learning Based k-Value Prediction Scheme in a k-Anonymity Algorithm (k-익명화 알고리즘에서 기계학습 기반의 k값 예측 기법 실험 및 구현)

  • Muh, Kumbayoni Lalu;Jang, Sung-Bong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.1
    • /
    • pp.9-16
    • /
    • 2020
  • The k-anonymity scheme has been widely used to protect private information when Big Data are distributed to a third party for research purposes. When the scheme is applied, an optimal k value determination is one of difficult problems to be resolved because many factors should be considered. Currently, the determination has been done almost manually by human experts with their intuition. This leads to degrade performance of the anonymization, and it takes much time and cost for them to do a task. To overcome this problem, a simple idea has been proposed that is based on machine learning. This paper describes implementations and experiments to realize the proposed idea. In thi work, a deep neural network (DNN) is implemented using tensorflow libraries, and it is trained and tested using input dataset. The experiment results show that a trend of training errors follows a typical pattern in DNN, but for validation errors, our model represents a different pattern from one shown in typical training process. The advantage of the proposed approach is that it can reduce time and cost for experts to determine k value because it can be done semi-automatically.

Time Slot Assignment Algorithm with Graph Coloring (그래프 채색에 의한 타임 슬롯 할당 알고리즘)

  • Kwon, Bo-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.52-60
    • /
    • 2008
  • A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

Development of Automatic Data Transmitting System of Atrial Blood Gas Results via LAN (LAN을 이용한 혈액가스 검사결과 전송시스템)

  • Kim, Nam-Hyun;Huh, Jae-Man;Kim, Ji-Hyue;Kim, Do-Nyun;Kim, Won-Ky;Chang, Byung-Chul
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1992 no.11
    • /
    • pp.103-104
    • /
    • 1992
  • Automatic transmission of data from the blood analyzer to the request site is one of the most important part in hospital computerization. We have developed a system to automatically transmit the data from the atrial blood gas analyzer. In this system, HOST computer, FILE server, LAN(Local Area Network), 3270 Emulator and Multi-port card were integrated. Also, 3 blood gas analyser(NOVA Inc., USA) were connected to a single multi-port card which is attached in a personal computer for data acquisition. When specimen is collected from sampling sites, it is transfered to the lab. After analysis, the result is transmitted to the personal computer via serial communication between machine and multi-port card using interrupt method. Then, the patient's information (Name, Sex, etc.) is obtained from the HOST computer througth the emulator. The combined data(patient information & lab data) is transmitted to the each request site via LAN automatically. From the collected data, patient's previous data could be reviewed, and it could be used for the various statistics and the flow chart for clinical research. Also, we found that this system reduces the personal labor.

  • PDF

CLUSTERING DNA MICROARRAY DATA BY STOCHASTIC ALGORITHM

  • Shon, Ho-Sun;Kim, Sun-Shin;Wang, Ling;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.438-441
    • /
    • 2007
  • Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

  • PDF

Comparison of Changes in Upstream and Downstream Water Quality of Tributary Rivers: Gyeseong-stream and Hwapo-stream in Nakdongmiryang Watershed (지류하천의 상·하류 수질변화 비교: 낙동밀양 중권역 내 계성천 화포천을 대상으로)

  • Shim, Kyuhyun;Kim, Gyeonghoon;Kim, Seongmin;Kim, Youngseok;Kim, Jin-pil
    • Journal of Korean Society on Water Environment
    • /
    • v.36 no.5
    • /
    • pp.445-452
    • /
    • 2020
  • Tributary is a part of life space for people and a very important place that accommodates rest recreation and other daily activities. absolutely insufficient basic data about water quality and flow rate are available for basin management. Efficient water and basin management systems, which are also supported by local residents can be established by securing such basic data of major tributaries in the Nakdong river system. In this study, the fluctuation characteristics of upstream and downstream water pollution levels were compared using the measurement results of the water environment measurement network and the tributary monitoring project for the gyeseong-stream and Hwapo-stream in the Nakdong-miryang watershed. In 2017, when water pollution is the highest, it was confirmed that the annual average rainfall was the lowest. Although the upstream and downstream water quality tendencies of the Gyeseong-stream are similar, the water quality concentrations of the Gyeseong-stream are relatively different. But although the Hwapo stream has various causes of pollution, there was not much difference in the level of pollution between the upper and lower streams. In addition, both rivers need the ability to purify rivers by securing sufficient water for river maintenance, and if the correlation between water quality items can be inferred through continuous monitoring of tributaries where the aspect of water quality change is unclear, water quality management Determined to be efficient operation.

A Multiple User Class Congestion Pricing Model and Equity (혼잡통행료 산정모형의 개발 및 계층간 형평성 연구)

  • Im, Yong-Taek;Kim, Byeong-Gwan
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.5
    • /
    • pp.183-193
    • /
    • 2007
  • Traditionally, a congestion charge based on first-best congestion pricing theory, namely, the theory of marginal cost pricing theory, is equal to the difference between marginal social cost and marginal private cost. It is charged on each link so as to derive a user equilibrium flow pattern to a system optimal one. Based on this theory this paper investigates on the characteristics of first-best congestion pricing of multiple user class on road with variable demand, and presents two methods for analysis of social and spatial equity. For these purposes, we study on the characteristics of first-best congestion pricing derived from system optimal in time and in monetary unit, and analyze equity from this congestion pricing with an example network.