• Journal of Internet of Things and Convergence
• /
• v.9 no.3
• /
• pp.1-6
• /
• 2023

One of the economical ways to satisfy the quality of service desired by the user in a web service environment is to adjust the size of the object. To this end, this study finds the maximum size of objects that satisfy this constraint when the mean response time is given below an arbitrary threshold for quality of service. It can be inferred that in the steady state of system, the mean response time in the deterministic model by using the round-robin will be the same as that of the queueing model following the general distribution. Based on this, analytical formulas and procedures for finding the maximum object size are obtained. As a service distribution of web traffic, the Pareto distribution is appropriate, so the maximum object size is computed by applying the M/G(Pareto)/1 model and the M/G/1/PS model using exponential distribution as computational experience. Performance evaluation through numerical calculation shows that as the shape parameter in the Pareto distribution increases, the M/G(Pareto)/1 model and M/G/1/PS model have the same maximum object size. The results of this study can be used to environments where objects can be sized for economical web service control.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.942-955
• /
• 2000

This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

• Journal of Korean Society of Transportation
• /
• v.32 no.6
• /
• pp.579-588
• /
• 2014

In this study, three signal control strategies such as Bike box, Hook-turn, and 6-phase were assessed for various traffic conditions at signalized intersections incorporating bicycle left-turn traffic. Results showed that the size of a waiting zone mainly affected the performance of signal control in both Bike box and Hook-turn. Both Bike box and Hook-turn yielded an identical vehicle delay, but Bike box produced less bicycle delay than Hook-turn by 2.5~29.9 sec/veh for undersaturated traffic conditions. For saturated traffic condition, Bike box produced less vehicle delay than Hook-turn and 6-phase strategies, but bicycle delay was found to increase at the 700 vph of bicycle traffic compared to 6-phase. Bicycle delay was greatly increased under Hook-turn and Bike box strategies when bicycle traffic was greater than 300 vph and 500 vph, respectively. It was also shown that bicycle delay could be significantly reduced by providing appropriate size of queueing space. In addition, Bike box was likely to yield less vehicle and bicycle delay than Hook-turn for traffic volume patterns investigated in this study.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1206-1218
• /
• 1992

Token ring systems which control to switch the data stream of networks by passing the token have been widely used to medium access controls in many ring or bus topology LANs. The system could be modeled for analysis as single-server-multi-queue system of the cyclic service method. These concepts could be expanded to multi-token ring systems interconnected with single ring consisting of bridges implemented simply to be stored and transmitted. In the proposal for the performance analysis of the interconnected token ring system, in has been assumed M/G/1 queueing model that frame arrivals are the Poisson process at each station queue and frame sizes are independently and identically distributed. And the average time delays were analyzed mathematically for arbitrary frame transferred from source station to destination area. The time delay of the frame transmission could be explained as the sum of the average time which the token passed from arbitrary position to source station, such as the waiting time in the source station transferring the previous arrival frames, and the propagation time from source station to interdestinated point. These delays were given as the sum of the duration from inner and outer bridge queues, the time delays from inner and outer bridge queues, and the time from outer bridge queue to destination station. These results were investigated by varing parameters effected to total time delays. In the results, those factors to be effected to dominant the total time delays were increased were in the cases of the high arrival rates and the high ration of destination of the other outerring. The system were shown the time delays increased exponentially in spite of the priority service policy. In order to decreasing the number of outerrings and increasing the number of nodes in backbone relatively, so the systems could be decreased the total delay in the interconnected token ring system.

• Journal of Service Research and Studies
• /
• v.14 no.3
• /
• pp.172-187
• /
• 2024

This paper deals with asymptotic approximations analysis of M/M/s and M/D/s queues. For M/M/s queue, we observe "economies of scale" under the fixed utilization ρ and the fixed probability α that customer waits in system, how the average system size vary according to the number of servers s increasing. Simulation results show that as s increases, the number of servers who are idling increases, that is, the slack n-E[Q_n] diverges. In addition, through changing the waiting probability α under the M/M/s system, α was not highly sensitive to the behavior of the system size. And, it is shown that using ${\rho}_n\,=\,1-k/\sqrt{n}$ to handle heavy-traffic regime is only appropriate for k = 1 by observing the effect on the performance of the system with different values of k. For the M/D/s queue, two approximations are used to evaluate the expected system size under the fixed ρ and α. Simulations and comparison of these two approximations show that Cosmetatos' approximation performs quite well when the number of servers is small and traffic intensity is heavy, but it overestimates the true value for the large number of servers. Meanwhile, the modified approximation gives good results for the steady state count of the system although the number of servers grows large.