• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.455-464
• /
• 2005

In this paper, we analyze a queueing system with overload control by arrival rates. This paper is motivated by overload control to prevent congestion in telecommunication networks. The arrivals occur dependent upon queue length. In other words, if the queue length increases, the arrivals may be reduced. By considering the burstiness of traffics in telecommunication networks, we assume the arrival to be a Markov-modulated Poisson process. The analysis by the embedded Markov chain method gives to us the performance measures such as loss and delay. The effect of performance measures on system parameters also is given throughout the numerical examples.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.395-408
• /
• 2003

Common Channel Signaling(CCS) networks need special controls to avoid overload of signaling networks and degradation of call process-ing rate, since they play an important role of controlling communication transfer networks. Congestion control and flow control mechanisms are well described in ITU-T recommendation on Signaling System No.7(SS7). For the practical provisions, however, we need an analysis on the relation among service objects, system requirements and implementation of congestion control algorithms. SS7 provides several options for controlling link congestion in CCS networks. In this paper we give a general queueing model of congestion control algorithm which covers both the international and national options. From the queuing model, we obtain the performance parameters such as throughput, message loss rate and mean delay for the international option. To show the performance of the algorithm, some numerical results are also given.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.31-55
• /
• 2007

Contemporary end-servers and network-routers rely on traffic shaping to deal with server overload and network congestion. Although such traffic shaping provides a means to mitigate the effects of server overload and network congestion, the lack of cooperation between end-servers and network-routers results in waste of network resources. To remedy this problem, we design, implement, and evaluate NetDraino, a novel mechanism that extends the existing queue-management schemes at routers to exploit the link congestion information at downstream end-servers. Specifically, NetDraino distributes the servers' traffic-shaping rules to the congested routers. The routers can then selectively discard those packets-as early as possible-that overloaded downstream servers will eventually drop, thus saving network resources for forwarding in-transit packets destined for non-overloaded servers. The functionality necessary for servers to distribute these filtering rules to routers is implemented within the Linux iptables and iproute2 architectures. Both of our simulation and experimentation results show that NetDraino significantly improves the overall network throughput with minimal overhead.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.5
• /
• pp.312-325
• /
• 2006

Integration applications, such as EAI, B2Bi, need stable massive data processing systems during overload state cause by service request congestion in a short period time. In this paper, we propose the PLC (Peak Load Control)-based Worker-Linker pattern, which can effectively and stably process massive I/O transactions in spite of overload state generated by service request congestion. This pattern uses the delay time algorithm for the PLC mechanism. In this paper, we also show the example of applying the pattern to business-business integration framework and the experimental result for proving the stability of performance. According to our experiment result, the proposed delay time algorithm can stably control the heavy overload after the saturation point and has an effect on the controlling peak load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4641-4657
• /
• 2017

Named Data Networking (NDN) has emerged and become one of the most promising architectures for future Internet. However, like traditional IP-based networking paradigm, NDN may not evade some typical network threats such as malicious data aggregates (MDA), which may lead to bandwidth exhaustion, traffic congestion and router overload. This paper firstly analyzes the damage effect of MDA using realistic simulations in large-scale network topology, showing that it is not just theoretical, and then designs a fine-grained MDA mitigation mechanism (MDAM) based on the cooperation between routers via alert messages. Simulations results show that MDAM can significantly reduce the Pending Interest Table overload in involved routers, and bring in normal data-returning rate and data-retrieval delay.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.289-296
• /
• 2015

Wireless multimedia sensor network senses and transfers mass multimedia data. Also, it is sensitive to latency. This thesis proposes a routing technique based on traffic priority in order to improve the network efficiency by minimizing latency. In addition, it proposes a congestion control mechanism that uses packet service time, packet inter-arrival time, buffer usage, etc. In this thesis, we verified the reduction of packet latency in accordance with the quality level of packet as a result of the performance analysis through the simulation method. Also, we verified that the proposed mechanism maintained a reliable network state by preventing packet loss due to network overload.

• Journal of the Korea Society for Simulation
• /
• v.27 no.3
• /
• pp.45-52
• /
• 2018

We consider the busy period of an M/G/1/K queueing system with queue-length-dependent overload control policy. A variant of an oscillating control strategy that was recently analyzed by Choi and Kim (2016) is considered: two threshold values, $L_1({\leq_-}L_2)$ and $L_2({\leq_-}K)$, are assumed, and service rate and arrival rate are adjusted depending on the queue length to alleviate congestion. We investigate the busy period of an M/G/1/K queue with two overload control policies, and present the formulae to obtain the expected length of a busy period for each control policy. Based on the numerical examples, we conclude that the variability and expected value of the service time distribution have the most influence on the length of a busy period.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.297-312
• /
• 2005

The multimedia traffic of continuous video and audio data via streaming service accounts for a significant and expanding portion of the Internet traffic. This streaming data delivery is mostly based on RTP with UDP. However, UDP does not support congestion control. For this reason, UDP causes the starvation of congestion controlled TCP traffic which reduces its bandwidth share during overload situation. In this paper, we propose a new TCP-friendly rate control scheme called 'TF-RTP(TCP-Friendly RTP)'. In the congested network state, the TF-RTP exactly estimates the competing TCP's throughput by using the modified parameters. Then, it controls the sending rate of the video streams. Therefore, the TF-RTP adjusts its sending rate to TCP-friendly and fair share with competing TCP traffics. Through the simulation, we prove that the TF-RTP correctly estimates the TCP's throughput and improves the TCP-friendliness and fairness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.581-590
• /
• 2005

The IEEE 802.17 Resilient Packet Ring Working Group develops standards to support the development and deployment of Resilient Packet Ring networks in Local, Metropolitan, and Wide Area Networks for resilient and efficient transfer of data Packets at rates scalable to many gigabits Per second. It was known that the fairness algorithm of the IEEE 802.17 Resilient Packet Ring suffers from throughput degradation under an unbalanced overload. This Paper proposes a congestion release advertisement method to improve this throughput degradation and discusses its performance. Under the proposed method, a congested node decides whether its congestion is released or not. If released, it advertises the congestion release to upstream nodes, and then upstream nodes transmit their traffic without uy regulation. The proposed method is compatible with the legacy fairness algorithm.