• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1726-1734
• /
• 1993

This paper propose a survivable communication network design process using node degree that augments the usual traffic flow and cost analyses with previously ignored topological survivability and computing time considerations. At first, decide a initial topology, and then measure a throughput of network. If the throughput is smaller than the required traffic, add edge to the optimum place by using minimum node degree and link distance. Otherwise, drop useless edge by using maximum node degree, link distance and link utilization. This process is repeated until throughput equals to the required traffics. This Process designs a survivable communication network with the minimized cost and computing time and usual traffic flow. The design proceses that minimized computing time are freely select initial topology and easily design a large network. And these results of algorithm are compared with the Kris and Pramod's in order to analyses the perfmance of the designed network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.99-106
• /
• 2012

Korea navy has been using the voice-oriented ICS to raise a efficiency of naval ship operation. Recently a multimedia network which are included voice, video and text is under consideration by korean navy. As a basic research to establish the integrated multimedia network of a naval ship, this paper classify the networks in order to apply to an integrated network among the various networks within a naval ship. We also consider the sort and characteristic of the multimedia traffic which is using within the classified networks. To predict the link capacity of switch from number of traffic input source, we suggest a traffic aggregation model. Then we calculate the link capacity of aggregated traffic and analyze a aggregated traffic of Korea major naval ship.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.3
• /
• pp.59-72
• /
• 2017

As the part of study which handles the measure to use the individual vehicle information of taxi GPS data on signal controls in order to overcome the limitation of Loop detector-based collecting methods of real-time signal control system, this paper conducted series of evaluations and improvements on link travel time, queue vehicle time estimates and traffic condition decision algorithm from the research introduced in 2016. considering the control group and the other, the link travel time has enhanced the travel time and the length of queue vehicle has enhanced the estimated model taking account of the traffic situation. It is analyzed that the accuracy of the average link travel time and the length of queue vehicle are respectably both approximately 95 % and 85%. The traffic condition decision algorithm reflected the improved travel speed and vehicle length. Smoothing was performed to determine the trend of the traffic situation and reduce the fluctuation of the data, and the algorithms have refined so as to reflect the pass period on overflow judgment criterion.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.13-18
• /
• 2005

Routers determine routing path considering network topology and link state information for providing QoS (quality of service) guarantee. Therefore, it is important that routers know link state information to calculate routing path. However, if routers generate link state update messages inordinately, their router performance are reduced due to the process of link state update messages. On the other side, in case that link state information is not updated appropriately, route setup requests can be rejected even though there exist routes. In this paper, we propose an algorithm to improve router performance and evaluate the proposed algorithm performance compare with conventional algorithm by simulations.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.1-8
• /
• 1997

In this paper, we propose a call admission control scheme which can be used in real environment for the traffic cibtrik if a base station if DS-CDNA cellular systems. The proposed scheme estimates the mean and variance of other cell interference by using the values used for the closed loop power control. The reerse link capacity of the base station can be calculated by using the estimated mean and variance of other cell interference. The base station admits a call only if the number of users is less than the calculated reverse link capacity. In addition, we propose a simple method to obtain the equivalent number of voice call users per one data call user in multi-rate traffic environment. The method can be applied to call admission control in multi-rate traffic environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.277-282
• /
• 2005

The arrangement of I-picture starting times of multiplexed variable bit .ate (VBR) MPEG videos may significantly affect the cell loss ratio (CLR) characteristics of the multiplexed traffic. This paper presents an efficient I-picture arrangement method which can minimize the CLR of the multiplexed traffic when multiple VBR MPEG videos are multiplexed onto a single constant bit rate link. In the proposed method, we use the probability that the arrival rate exceeds the link capacity as the measure for the CLR of the multiplexed traffic. Simulation results show that the proposed method can find more optimal arrangement than existing methods in respect of the CLR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12A
• /
• pp.1828-1835
• /
• 2000

In this paper, we analyzed the other-cell interference characteristics for various non-uniform traffic distributions and their effects on the capacity of multi-cell CDMA system. We consider three different traffic distributions, i.e., linear, exponential and Gaussian traffic distribution with distribution parameters. Changing the distribution parameter, we can obtain the center-focused distributions or uniform distributions for each model. From the results of other-cell interference calculation we can see that the other-cell interference decreases, as the user concentrates on the base station. Also using frequency reuse efficiency indicating the capacity reduction of a multi-cell system when compared to a single cell system, we evaluate the effect of traffic distribution on the reverse link CDMA capacity. For linear case, the capacity of multi-cell system is reduced to 0.637∼0.867 times that of single cell system. On the other hand, for both exponential and Gaussian cases, the capacity under a multi-cell environment is equal to 70∼100% of that under a single cell. Therefore, we conclude that the average capacity of multi-cell CDMA system are increased when users are likely to be at near the cell base station due to reduced total other-cell interference and decreased when users exist at near the cell edge regardless of traffic distribution models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2589-2609
• /
• 2021

Segment routing (SR) is a highly implementable approach for traffic engineering (TE) with high flexibility, high scalability, and high stability, which can be established upon existing network infrastructure. Thus, when a network failure occurs, it can leverage the existing rerouting methods, such as rerouting based on Interior Gateway Protocol (IGP) and fast rerouting with loop-free alternates. To better exploit these features, we propose a high-performance and easy-to-deploy method SRUF (Segment Routing under Uncertain Failures). The method is inspired by the Value-at-Risk (VaR) theory in finance. Just as each investment risk is considered in financial investment, SRUF also considers each traffic distribution scheme's risk when forwarding traffic to achieve optimal traffic distribution. Specifically, SRUF takes into account that every link may fail and therefore has inherent robustness and high availability. Also, SRUF considers that a single link failure is a low-probability event; hence it can achieve high performance. We perform experiments on real topologies to validate the flexibility, high-availability, and load balancing of SRUF. The results show that when given an availability requirement, SRUF has greater load balancing performance under uncertain failures and that when given a demand requirement, SRUF can achieve higher availability.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.31-44
• /
• 2011

The applicability of network-based computing depends on the availability of the underlying network bandwidth. Such a growing gap between the capacity of the backbone network and the end users' needs results in a serious bottleneck of the access network in between. As a result, ISP incurs disadvantages in their business. If this situation is known to ISP in advance, or if ISP is able to predict traffic volume end-to-end link high-load zone, ISP and end users would be able to decrease the gap for ISP service quality. In this paper, simulation tools, such as ACE, ADM, and Flow Analysis, were used to be able to perceive traffic volume prediction and end-to-end link high-load zone. In using these simulation tools, we were able to estimate sequential transaction in real-network for e-Commerce. We also imported virtual network environment estimated network data, and create background traffic. In a virtual network environment like this, we were able to find out simulation results for traffic volume prediction and end-to-end link high-load zone according to the increase in the number of users based on virtual network environment.

• 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.