• Proceedings of the Korean Reliability Society Conference
• /
• 2000.11a
• /
• pp.405-409
• /
• 2000

The flow network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow. In this paper we consider the measures of importance of a link in the flow network. We define the structural importance and reliability importance of link when the required amount of flow is given. Also, we present the performance importance of link in a flow network. The performance importance can be used to determine which links should be improved first in order to make the greatest improvement in performance of the network. Numerical examples are presented for illustrative purpose.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.17-24
• /
• 2016

In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.937-943
• /
• 2009

A network with variable link capacities is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow. The links are independent and either function or fail with known probability. No flow can be transmitted through a failed link. In this paper, we consider the measures of importance of a link in such networks. We define the structural importance and reliability importance, with respect to capacity, of a link when the required amount of flow is given. We also present the performance importance with respect to capacity. Numerical examples are presented as well for illustrative purpose.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.455-462
• /
• 2001

We propose a new method to evaluate the network reliability which greatly reduces the intermediate steps toward calculations of maximum capacity flow by excluding unnecessary simple paths contained in the set of failure simple paths. By using signed simple paths and signed flow, we show that our method is more efficient than that of Lee and Park (2001a) in the number of generated composite paths and in the procedure for obtaining minimal success composite paths. Numerical examples are given to illustrate the use and the efficiency of the method.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.410-421
• /
• 2006

In this work, we propose an analytic framework for dimensioning the link capacity of broadband access networks which provide universal broadband access services to a diverse kind of customers such as patient and impatient customers. The proposed framework takes into account the flow-level quality of service (QoS) of a connection as well as the packet-level QoS, via which a simple and systematic provisioning and operation of the network are provided. To that purpose, we first discuss the necessity of flow-aware network dimensioning by reviewing the networking technologies of the current and future access network. Next, we propose an analytic model for dimensioning the link capacity for an access node of broadband convergence networks which takes into account both the flow and packet level QoS requirements. By carrying out extensive numerical experiment for the proposed model assuming typical parameters that represent real network environment, the validity of the proposed method is assessed.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.117-127
• /
• 2009

This study analyzed the uncertainty of the forecasted link traffic flow, and estimated of the interval link flow using Korea Transport Data Base (KTDB) to consider those risks into the feasibility study. In the paper, the uncertainty was analyzed according to the stochastic variation of the KTDB origin-destination traffic. It was found that the uncertainty of the entire network traffic forecasts was 15.4% in average,. when the stochastic variation of the KTDB was considered. The results showed that the more congested the roads were, the bigger the uncertainty of forecasted link traffic flow were found. In particular, we estimated the variance of the forecasted traffic flow, and suggested interval estimates of the forecasted traffic flow instead of point estimates which were presented in the common feasibility studies. These results are expected to contribute the quantitative evaluation of uncertain road investment projects and to provide valuable information to the decision makers for the transport investment.

• International Journal of Reliability and Applications
• /
• v.2 no.1
• /
• pp.73-80
• /
• 2001

A network, where links have different capacities, is considered to be in functioning state if a specified amount of flow can be transmitted through the network. In this paper, we consider the measures of importance of a link in such networks. We define the structural importance and reliability importance of a link when the required amount of flow is given. We also present the performability importance, which can be used to determine which links should be improved first in order to make the greatest improvement in the expected maximum flow of network. Numerical examples are presented as well for illustrative purpose.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.10 no.6
• /
• pp.63-70
• /
• 2001

This study is concerned with Finite Element Analysis on welded part of control link fur automobile. For analysis, control link was modeled into two parts, ring and rod. Heating condition, temperature distributions and fatigue fracture strength were analyzed using "HEAT III" and "NDURE" module of NISA II. Metal flow in the process of welding was simulat- ed by $DEFORM^{TM}2D$.The analyzed results were compared with experimental inspection. Quality of welded part was able to be improved by controlling metal flow in the process of welding by increase the friction constant of ring part. Heat transfer analysis and flow simulations were in good agreement wish welding experiments.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1174-1177
• /
• 1987

The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.