Mathematical modelling for the design of an edge router

被引:0
作者
Bhattacharjee, Partha [1 ]
Sanyal, Goutam [2 ]
机构
[1] CMERI, Durgapur, W Bengal, India
[2] NIT, Durgapur, W Bengal, India
来源
PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING | 2008年
关键词
Markov modulated Poisson process; independent identically distributed; Quality of Service; continuous time Markov chain; buffer capacity; link speed;
D O I
10.1109/SNPD.2008.139
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents the formulation, modelling and analysis of network traffic for the purpose of designing an edge router, catering for a large campus. Presuming packet arrival from Poisson's process, and departure or service time distribution to be exponential, a Markov model has been developed. The stochastic characteristics of the traffic has been monitored and studied over long durations through different times of a day and different days of a week. Design parameters like buffer capacity, link speed and various other key parameters for an edge router have been derived. Additionally, an algorithm has been suggested to manipulate the weights of the queues dynamically in a weighted round robin scheduling, thereby changing the packet departure rate of the flows. The algorithm eventually provides a control over the load factors and the probability of packet.
引用
收藏
页码:212 / +
页数:2
相关论文
共 12 条
[1]  
BENSAOU B, 2001, IEEE ACM T NETWORKIN, V9
[2]  
Bhattacharjee P., 2006, STUDY STOCHASTIC CHA, P648
[3]  
BHATTACHARJEE P, INT J HIT T ECCN JAN
[4]  
CLAFFY KC, P ACM SIGCOMM 93 SEP, P194
[5]  
FELLER W, 1968, INTRO PROBABILITY TH, V1, P243
[6]  
KOMPELLA RR, 2004, NOSSDAV 04 JUN 16 18
[7]   PROBABILISTIC MODELS OF DATABASE LOCKING - SOLUTIONS, COMPUTATIONAL ALGORITHMS, AND ASYMPTOTICS [J].
MITRA, D ;
WEINBERGER, PJ .
JOURNAL OF THE ACM, 1984, 31 (04) :855-878
[8]   Markov models of internet traffic and a new hierarchical MMPP model [J].
Muscariello, L ;
Mellia, M ;
Meo, M ;
Marsan, MA ;
Lo Cigno, R .
COMPUTER COMMUNICATIONS, 2005, 28 (16) :1835-1851
[9]  
PANDIT C, 2006, 0217836 ECS
[10]   CONNECTING REVERSIBLE MARKOV-PROCESSES [J].
POLLETT, PK .
ADVANCES IN APPLIED PROBABILITY, 1986, 18 (04) :880-900