A framework for evaluating the performance of cluster algorithms for hierarchical networks

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1478-1489

  Lian, Jie ^a   Naik, Kshirasagar ^a   Agnew, Gordon B ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Clustering algorithms; Hierarchical network; Hierarchical systems; Network performance; Peer to peer (P2P) network; Peer to peer computing; Routing

Indexed keywords

HIERARCHICAL SYSTEMS; SCALABILITY; TOPOLOGY;

HIERARCHICAL NETWORK; NETWORK PERFORMANCE; PEER-TO-PEER COMPUTING; PEER-TO-PEER NETWORK;

CLUSTERING ALGORITHMS;

EID: 37549007126     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.896499     Document Type: Article

References (42)

1. J. McQuillan, "Adaptive routing algorithms for distributed computer networks," Bolt Beranek and Newman Inc., Cambridge, MA, BBN Rep. 2831, May 1974.
2. W. T. Tsai, C. V. Ramamoorthy, W. K. Tsai, and O. Nishiguchi, "An adaptive hierarchical routing protocol," IEEE Trans. Comput., vol. 38, no. 8, pp. 1059-1075, Aug. 1989.
3. S. Murthy and J. J. Garcia-Luna-Aceves, "Loop-free Internet routing using hierarchical routing trees," in Proc. IEEE INFOCOM'97, Apr. 1997, pp. 101-108.
4. J. Behrens and J. J. Garcia-Luna-Aceves, "Hierarchical routing using link vectors," in Proc. IEEE INFOCOM'98, Apr. 1998, pp. 702-710.
5. D. J. Baker and A. Ephremides, "The architectural organization of a mobile radio network via a distributed algorithm," IEEE Trans. Commun., vol. 29, pp. 1694-1701, Nov. 1981.
6. A. Ephremides, J. E. Wieselthier, and D. J. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. IEEE, vol. 75, no. 1, pp. 56-73, Jan. 1987.
7. M. Gerla and J. T. C. Tsai, "Multicaster, mobile, multimedia radio network," ACM J. Wireless Netw., vol. 1, no. 3, pp. 255-265, 1995.
8. A. K. Parekh, "Selecting routers in ad hoc wireless networks," in Proc. SBT/IEEE Int. Telecommun. Symp., Aug. 1994, pp. 420-424.
9. P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan, "A cluster-based approach for routing in dynamic networks," in Proc. ACM SIGCOMM Comput. Commun. Rev., 1997, pp. 372-378.
10. D. Kim, S. Ha, and Y. Choi, "K-hop cluster-based dynamic source routing in wireless ad hoc packet radio networks," in Proc. IEEE Trans. Veh. Technol. Conf., 1998, pp. 224-228.
11. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, "Max-min D-cluster formation in wireless ad hoc networks," in Proc. IEEE INFOCOM 2000, 2000, pp. 32-41.
12. M. Chatterjee, S. K. Das, and D. Turgut, "WCA: A weighted clustering algorithm for mobile ad hoc networks," J. Cluster Comput., vol. 5, pp. 193-204, Apr. 2002.
13. F. Garcia, J. Solano, and I. Stojmenovic, "Connectivity based k-hop clustering in wireless networks," Telecommun. Syst., vol. 22, pp. 205-220, 2003.
14. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," in Proc. IEEE INFOCOM 2003, Apr. 2003, pp. 1713-1723.
15. L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks: Performance evaluation and optimization," Comput. Netw., vol. 1, pp. 155-174, 1977.
16. J. Lian, K. Naik, and G. Agnew, "Optimal solution of total routing table size for hierarchical networks," in Proc. IEEE ISCC, Jun. 2004, pp. 834-839.
17. D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," Mobile Comput., pp. 153-181, 1996.
18. C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," in Proc. ACM SIGCOMM'94 Conf. Communication Architectures, Protocols, and Applications, Aug. 1994, pp. 234-244.
19. C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in Proc. WMCSA'99, Feb. 1999, pp. 90-100.
20. J. Lian, G. Agnew, and K. Naik, "A variable-degree based clustering algorithm for networks," in Proc. IEEEICCCN, Nov. 2003, pp. 465-470.
21. R. Boppana and S. Konduru, "An adaptive distance vector routing algorithm for mobile, ad hoc networks," in Proc. IEEE INFOCOM, Apr. 2001, pp. 1753-1762.
22. P. Jacquet, P. Muhlethaler, and A. Quayyum, "Optimized link state routing protocol (OLSR)," IETF MANET Working Group Internet Draft, Nov. 2001.
23. C. Hedrick, "Routing information protocol," RFC 1058, 1988.
24. R. E. Bellman, Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1957.
25. R. Sivakumar, P. Sinha, and V. Bharghavan, "CEDAR: A core extraction distributed ad hoc routing algorithm," IEEE J. Sel. Areas Commun. vol. 17, no. 8, pp. 1454-1465, Aug. 1999.
26. J. Broch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva, "A performance comparison of multihop wireless ad hoc network routing protocols," in Proc. MOBICOM, Oct. 1998, pp. 85-97.
27. S. J. Lee, M. Gerla, and C. K. Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," IEEE Networks, vol. 13, no. 4, pp. 48-54, Jul. 1999.
28. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, "Scenario-based performance analysis of routing protocols for mobile ad hoc networks," in Proc. MOBICOM, Aug. 1999, pp. 195-206.
29. M. Jiang, J. Li, and Y. C. Yay, "The cluster based routing protocol (CBRP) functional specification," IFIF MANET Working Group Internet Draft, Aug. 1999.
30. R. Draves, J. Padhye, and B. Zill, "Comparison of routing metrics for static multihop, wireless networks," in Proc. ACM SIGCOMM, Sep. 2004, pp. 657-662.
31. G. G. Finn, "Routing and addressing problems in large metropolitan internetworks," ISI Research Report ISU/RR-87-180, 1987.
32. P. Bose, P. Morin, O. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," Wireless Netw., vol. 7, no. 6, pp. 609-616, 2001.
33. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. MOBICOM, 2000, pp. 243-254.
34. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad hoc routing: Of theory and practice," in Proc. ACM Symp. Principles Distrib. Comput., 2003, pp. 63-72.
35. M. Zorzi and R. Rao, "Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multi-hop performance," IEEE Trans. Mobile Comput., vol. 2, no. 4, pp. 337-348, Oct. 2003.
36. S. Biswas and R. Morris, "ExOR: Opportunistic multihop routing for wireless networks," in Proc. ACM SIGCOMM, Aug. 2005, pp. 133-143.
37. J. Lian, K. Naik, and G. Agnew, A framework for evaluating the performance of cluster algorithms for hierarchical networks," Dept. Elect. Comp. Eng., Univ. Waterloo, Waterloo, ON, Canada, Tech. Rep. TR-2007-03, Jan. 2007.
38. Gnutella. [Online]. Available: http://www.the-gdf.org/
39. KaZaA. [Online]. Available: http://www.kazaa.com/us/index.htm
40. B. Krishnamurthy, J. Wang, and Y. Xie, "Early measurements of a cluster-based architecture for p2p systems," in Proc. ACM SIGCOMM Int. Meas. Workshop, Nov. 2001, pp. 105-109.
41. B. Y. Zhao et al., "Brocade: Landmark routing on overlay networks," in Proc. IPTPS'02, Mar. 2002, pp. 34-44.
42. R. Renesse and A. Bozdog, "Willow: DHT, aggregation, and publish/ subscribe in one protocol," in Proc. Int. Workshop Peer-to-Peer Syst., 2004, pp. 173-183.