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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.583-592
• /
• 1998

In this paper, the cell loss rate is analyzed in terms of the input traffic stream of different speed in ATM network. The cell loss rate is calculated by birth-death process of Leaky-Bucket mechanism as the representative algorithm of usage parameter control. The cell loss rate assumed 2-state MMPP input process to be birth-death process by considering the character of token pool about finite capacity queue. The results from numerical analysis show that the cell loss rate decreases abruptly according to the buffer size increase. The computer simulation by SIMSCRIPT II.5 has been done and compared with on/off input source case to verify the analysis results.

• 한국항공운항학회:학술대회논문집
• /
• 2016.05a
• /
• pp.269-275
• /
• 2016

This paper considers the arrival, airport and departure capacity as a whole, through which, the network effect between airports is fully emphasized, the flight action is coordinated, and the flight demand pattern is reasonably assigned. The optimization problem of flight queues in multi-airport is studied in detail; the mathematical model of multi-airport opening non-real time flow management in terminal area is established, and related problems such as the parameters, the simplification and the solving of the model are discussed in detail to some extent. Appropriate decision making variables are taken to make the multi-airport network system linear 0-1 integer programming model, thus, the solving of the model is available and the central flow management is realized. The heuristic implicit enumeration presented in this paper can effectively solve this kind of problems. Through the simulation of some airports network system, we not only validate the algorithm presented in this paper, but also give a deep analysis of the results, which would produce reference for later practicable use. The simulation proves that this algorithm offers a good way to settle the problem of multi-airport flight queue optimization in air traffic management automation system in terminal area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.168-175
• /
• 2006

To cope with channel variation, wireless networks such as IEEE 802.11 WLAN provide multiple transmission rates by employing different channel modulation and coding schemes. However, the coexistence of different transmission rates degrades the total system performance of the network. In order to eliminate this performance abnormality and improve protocol capacity, we propose a new Packet transmission algorithm, the RAT(Rate-Adapted Transmission) scheme. The RAT scheme distributes the wireless channel fairly based on the channel occupancy time. Moreover, it efficiently transmits packets even in a single station using rate-based queue management. Therefore, the RAT scheme obtains not only the inter-rate contention gain among stations but also the intra-rate contention gain among connections in a single station.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• Journal of Korea Multimedia Society
• /
• v.21 no.4
• /
• pp.499-512
• /
• 2018

The application of analytical techniques for the rational determination of problems arising from management science and corporate management. In a way that is the opposite of the repair plan that can predict accurate results is increasing utilization of the complex-based analysis methodology. In this study, we examined the application of physical space and the methodological utilization of the pedestrian model analysis that applied the simulation to the Health Checkup Center. The conclusions are as follows. First, the spatial analysis and measurement for empirical research has confirmed that the efficiency assessment through the pedestrian model simulation can lead to an objective evaluation. Second, it seems to be able to reduce the queue through a change in the number of services of the low-pressure and the hearing laboratory, the recovery room with a high proportion of male disturbances and relatively long use time. The third, the spatial density analysis and the time required to reduce the density change in comparative analysis, and the spatial layout changes, the increase in the capacity of 80 people, approximately 16 minutes to shorten the process duration.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.435-446
• /
• 2001

In this paper, a new fairness control method is proposed to distribute DQDB-SR (Distributed-Queue Dual-Bus with Slot Reuse) network bandwidth fairly to all stations on client-server environments. By using an access limit that follows a characteristic of client-sever load patterns and a bandwidth borrowing and returning mechanism, the proposed mechanism imparts fairness bandwidth control capability to DQDB-SR. To implement the proposed mechanism, we find the optimal placement of erasure nodes that maximizes network capacity for DQDB-SR, and calculate the access limit. At overload conditions, simulation results show that the proposed mechanism does not deteriorate network throughput, and outperforms other fairness control mechanisms in a success rate and an average packet transfer delay.

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.41-50
• /
• 2004

The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4724-4747
• /
• 2016

To efficiently reduce on-grid energy consumption, the admission control algorithm in the hybrid energy powered cellular network (HybE-Net) with base stations (BSs) powered by on-grid energy and solar energy is studied. In HybE-Net, the fluctuation of solar energy harvesting and energy consumption may result in the imbalance of solar energy utilization among BSs, i.e., some BSs may be surplus in solar energy, while others may maintain operation with on-grid energy supply. Obviously, it makes solar energy not completely useable, and on-grid energy cannot be reduced at capacity. Thus, how to control user admission to improve solar energy utilization and to reduce on-grid energy consumption is a great challenge. Motivated by this, we first model the energy flow behavior by using stochastic queue model, and dynamic energy characteristics are analyzed mathematically. Then, fuzzy logic based admission control algorithm is proposed, which comprehensively considers admission judgment parameters, e.g., transmission rate, bandwidth, energy state of BSs. Moreover, the index of solar energy utilization balancing is proposed to improve the balance of energy utilization among different BSs in the proposed algorithm. Finally, simulation results demonstrate that the proposed algorithm performs excellently in improving solar energy utilization and reducing on-grid energy consumption of the HybE-Net.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3523-3543
• /
• 2022

Autonomous vehicles are gradually being regarded as the mainstream trend of future development of the automobile industry. Autonomous driving networks generate many intensive and delay-sensitive computing tasks. The storage space, computing power, and battery capacity of autonomous vehicle terminals cannot meet the resource requirements of the tasks. In this paper, we focus on the task scheduling problem of autonomous driving in software-defined edge networks. By analyzing the intensive and delay-sensitive computing tasks of autonomous vehicles, we propose an emotion model that is related to task urgency and changes with execution time and propose an optimal base station (BS) task scheduling (OBSTS) algorithm. Task sentiment is an important factor that changes with the length of time that computing tasks with different urgency levels remain in the queue. The algorithm uses task sentiment as a performance indicator to measure task scheduling. Experimental results show that the OBSTS algorithm can more effectively meet the intensive and delay-sensitive requirements of vehicle terminals for network resources and improve user service experience.