Buffer Dimensioning of DTN Replication-Based Routing Nodes

被引:14
作者
Mahendran, V. [1 ]
Murthy, C. Siva Ram [1 ]
机构
[1] Indian Inst Technol Madras, Dept Comp Sci & Engn, Madras, Tamil Nadu, India
关键词
Buffer dimensioning; DTN; large deviations theory; performance modeling; routing; NETWORKS;
D O I
10.1109/LCOMM.2012.120312.122262
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The crux of the Delay-Tolerant Network (DTN) routing architecture lies in the physical transportation of messages by the resource-bound nodes. This requires a demanding (node) buffer space for a seamless functioning of the routing protocols. An analytical instrument to systematically quantify this buffer space is vital to wield the buffer loss. Buffer dimensioning is therefore essential to design a practical and efficient DTN. In this letter, we address the problem of quantifying the buffer size of DTN source nodes, under replication based routing protocol, using Markov modulated processes and large deviation techniques. Our proposed dimensioned-buffer model is shown to exhibit a routing performance of an equivalent infinite buffer model. Furthermore, our analysis is validated via extensive simulation results.
引用
收藏
页码:123 / 126
页数:4
相关论文
共 11 条
  • [1] [Anonymous], THESIS U NICE SOPHIA
  • [2] [Anonymous], 2000, HDB SYSTEMIC AUTOIMM
  • [3] A Survey on Delay-Aware Resource Control for Wireless Systems-Large Deviation Theory, Stochastic Lyapunov Drift, and Distributed Stochastic Learning
    Cui, Ying
    Lau, Vincent K. N.
    Wang, Rui
    Huang, Huang
    Zhang, Shunqing
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (03) : 1677 - 1701
  • [4] Effective Bandwidth of General Markovian Traffic Sources and Admission Control of High Speed Networks
    Elwalid, Anwar I.
    Mitra, Debasis
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (03) : 329 - 343
  • [5] Ganesh A, 2004, Lecture Notesin Mathematics
  • [6] Keranen A., P 2009 INT C SIM TOO
  • [7] Krifa A., P 2008 INT S WORLD W, P1
  • [8] On queues with Markov modulated service rates
    Mahabhashyam, S
    Gautam, N
    [J]. QUEUEING SYSTEMS, 2005, 51 (1-2) : 89 - 113
  • [9] Mahendran V., P 2012 INT C DISTR C, P502
  • [10] (p,q)-epidemic, routing for sparsely populated mobile ad hoc networks'
    Matsuda, Takahiro
    Takine, Tetsuya
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (05) : 783 - 793