Open Access Open Access  Restricted Access Subscription or Fee Access

Reliable Communication with Dynamic Routing Topology Inference

P. Priya, K. Vani, V. Vivek, Beaulah David

Abstract


Inferring in dynamic routing is important component in network monitoring. Security is critical for the deployment of these services. Application-level security has received relatively little attention since it is focused primarily on MAC. In this paper we propose a new protocol framework, Secure Group communication in dynamic routing (SeGroCDR), that employs decentralized group membership, exploits to achieve efficient secure group communication and efficiently accommodate group dynamics and reduce communication overhead by designing topology inference algorithms based on additive metrics. The framework can flexibly fuse information from multiple measurements to achieve better estimation accuracy. In particular, for applications where nodes may add or leave frequently such as overlay network construction, peer-to-peer file sharing/streaming, we use Secure Group communication in dynamic routing (SeGroCDR) which reduces the probing overhead and can efficiently handle node dynamics.

Keywords


Dynamic Routing, Group Communication, Network Tomography, Topology Inference

Full Text:

PDF

References


Jian Ni, Haiyong Xie, Sekhar Tatikonda, Y.R.Yang ,”Efficient and Dynamic Routing Topology Inference From End-to-End Measurements,” IEEE/ACM Transactions on Networking, vol. 18, no. 1, Feb. 2010.

H. Chan, A. Perrig, and D. Song. “Random key pre distribution schemes for sensor networks”. In Proc. of S&P, 2003.

A. Perrig, D. Song, and J. D. Tygar. Elk, “A new protocol for efficient large-group key distribution”. In S&P, 2001.

R. Torres, X. Sun, A. Walters, C. Nita-Rotaru, and S. Rao.”Enabling confidentiality of data delivery in an overlay broadcasting system”, IEEE Journal on Selected Areas in Communications, vol. 25, no. 9, pp. 1732 – 1744, ISSN: 0733-8716 ,04 December 2007.

C. Wong, M. Gouda, and S. Lam,” Secure group communications using key graphs,” Trans. Netw., 8(1), 2000.

F. L. Presti, N. G. Duffield, J. Horowitz, D. Towsley, “Multicast- Based Inference of Network-Internal Delay Distributions,” IEEE/ACM Transactions on Networking, vol. 10, no. 6, pp. 761-775, Dec. 2002.

W. Diffie and M. E. Hellman, ”New directions in cryptography”, IEEE Trans. Inform. Theory, vol. 22, no. 9, 1976.

Jing Dong, Kurt Ackermann, Cristina Nita Rotaru, ”Secure group communication in Wireless Mesh networks”, Ad Hoc Networks, vol. 7, no. 8, pp. 1563-1576, November 2009.

S. Ratnasamy and S. McCanne, “Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-end Measurements,” IEEE INFOCOM, Aug. 2002.

B. Yao, R. Viswanathan, F. Chang, D. Waddington, “Topology Inference in the Presence of Anonymous Routers,” Proc. IEEE INFOCOM, Apr. 2003.

M. Shih, A. O. Hero III, “Hierarchical Inference of Unicast Network Topologies Based on End to-End Measurements,” IEEE Transactions on Signal Processing, vol. 55, no. 5, pp. 1708-1718, May 2007.

M. Coates, A. O. Hero III, R. Nowak, B. Yu, “Internet Tomography,” IEEE Signal Processing Magazine, vol. 19, no. 3, pp. 47-65, May 2002.

A. Bestavros, J. Byers, K. Harfoush, “Inference and Labeling of Metric-Induced Network Topologies,” Proc. IEEE INFOCOM, June 2002.

R. Castro, M. Coates, G. Liang, R. Nowak, B. Yu, “Network Tomography: Recent Developments,” Statistical Science, vol. 19, no. 3, pp. 499-517, 2004.

J. Ni and S. Tatikonda, “A Markov Random Field Approach to Multicast- Based Network Inference Problems,” Proc. IEEE ISIT, Seattle, July 2006.

J. Ni and S. Tatikonda, “Explicit Link Parameter Estimators Based on End-to-End Measurements,” Proc. Allerton Conference on Communication,Control, and Computing, Sept. 2007.

D. Antonova, A. Krishnamurthy, Z. Ma, R. Sundaram, “Managing a Portfolio of Overlay Paths,” Proc. NOSSDAV, Kinsale, Ireland, June 2004.

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, R. Morris, “Resilient Overlay Networks,” Proc. SOSP, Oct. 2001.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.