• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• Journal of Advanced Navigation Technology
• /
• v.9 no.2
• /
• pp.156-163
• /
• 2005

In this paper, we analyzed the performance of VDL mode 3 system model whose specification is defined by ICAO(International Civil Aviation Organization). For performance evaluation, we obtained BER(Bit Error Rate), transmission delay time, burst retransmission rate and throughput. From the analysis result, we could explicitly define relationships among BER, transmission delay time, throughput and burst restransmission rate. In addition, it became known that V/D retransmission rate and throughput are closely related in down link channel.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.305-313
• /
• 2011

This paper presents a P2P (Peer-to-Peer) overlay multicast tree construction algorithm to support stable multimedia service over the Internet. While constructing a multicast tree, it takes into account not only the link delay, but also peer stability. Since peers actually show dynamic and unstable behavior over P2P-based network, it is essential to consider peer stability. Furthermore, the weighting factor between link delay and peer stability is adaptively controlled according to the characteristics of the multicast tree. Basically, Genetic algorithm is employed to obtain a near optimal solution with low computational complexity. Finally, simulation results are provided to show the performance of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1072-1077
• /
• 2004

This paper provides a new approach to analyze the stability of a general multi-link TCP Vegas, which is a kind of feedback-based congestion algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium pints, this approach models a multi-link TCP Vegas network in the form of a piecewise linear multiple time-delay system. And then, based on the exactly characterized dynamic model, this paper presents a new stability criterion via a piecewise and multiple delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs).

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.109-112
• /
• 2005

In this paper, we propose an improved delay-constrained unicast routing (I-DCUR) algorithm for real-time networks which is based on the delay-constrained unicast routing (DCUR) algorithm. Our I-DCUR algorithm is quite different from DCUR algorithm, because the node will choose the link between the active node and the previous node, and it will replace the original loop path when it detects a loop. Thus, firstly consider to choose the link between the active node and the previous node to replace the original loop path when a node detects a loop. So our algorithm can make the construction of path more efficiently, as compared to DCUR algorithm. We could see that the performance of I-DCUR algorithm is much better than DCUR algorithm in the experimental results. There were over 40% improvement in 100 nodes, 60% in 200 nodes, and 9% reduction of costs.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.121-127
• /
• 2016

Satellite communication is a communication method using a satellite as a repeater communication on the air and have a communication range is wide and is possible to transmit high-speed data, so Satellite communication has been highlighted as the next generation communication. However, because the distance between the ground and the satellite is far away, there is a disadvantage that propagation delay time is very long and packet is damaged. Therefore, this study was applied to Link Relay H-ARQ system in order to complement the damage to the packet. Furthermore, we propose the Modified Link Relay H-ARQ scheme is a new scheme to supplementation the delay time. By applying the Markov channel for implementing a channel of satellite communications, the results of analyzing the performance, when applying the Link Relay HARQ scheme, BER and PER performance was improved, when applying the Modified Link Relay H-ARQ scheme, Throughput performance was confirmed improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.2
• /
• pp.171-181
• /
• 1988

In this study, a packet voice/data terminal(PVDT) that services both voice and data in the packet-switched network is implemented. The software structure of the PVDT is designed according to the OSI 7 layer architecture. The discrimination of voice and data is made in the link layer. Voice packets have priority over data packets in order to minimize the transmission delay, and are serviced by a simple protocol so that the overhead arising form the retransmission of packets may be minimized. The hardware structure of the PVDT is divided into five modules; a master control module, a speech proessing module, a speech activity detection module, a telephone interface module, and an input/output interface module. In addition to the hardware implementation, the optimal reconstruction delay of voice packets to reduce the influence of delay variance is analyzed.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.2D
• /
• pp.233-239
• /
• 2006

Most research for until at now link travel time were research for mean link travel time calculate or estimate which uses the average of the individual vehicle. however, the link travel time distribution is divided caused by with the impact factor which is various traffic condition, signal operation condition and the road conditional etc. preceding study result for link travel time distribution characteristic showed that the patterns of going through traffic were divided up to 2 in the link travel times. therefore, it will be more accurate to divide up the link travel time into the one involving delay and the other without delay, rather than using the average link travel time in terms of assessing the traffic situation. this study is it analyzed transit hour distribution characteristic and a cause using examine to the variables which give an effect at link travel time distribute using simulation program and determinate link travel time distribute ratio estimation model. to assess the distribution of the link travel times, this research develops the regression model and the fuzzy model. the variables that have high level of correlations in both estimation models are the rest time of green ball and the delay vehicles. these variables were used to construct the methods in the estimation models. The comparison of the two estimation models-fuzzy and regression model- showed that fuzzy model out-competed the regression model in terms of reliability and applicability.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.