COMPUTING MINIMAL SPANNING TREE WITH THE ACTIVE PROGRAMMABLE HARNESS NETWORK GROUP COMMUNICATION WARE

The active harness we have developed is a scalable and versatile means for deep probing of network local states. Harness makes a clear separation between the "communication" from the "information" part of the probing process. The composition of the "information" component is handled by means of network embedded harness plug-ins. Harness supports a variety of group communication and distributed data synthesis patterns among a large set of nodes. It has been show to be capable of solving variety of messaging optimized efficient distributed algorithms used in advanced routing including shortest path, optimum clientele multicast stepping etc. In this report we illustrate how it can also solve another important problem is advanced routing—the minimum spanning tree problem. This report does not contain any performance simulation.

[1]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[2]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Kevin C. Almeroth,et al.  Scalable techniques for discovering multicast tree topology , 2001, NOSSDAV '01.

[4]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[5]  Mary Baker,et al.  Nettimer: A Tool for Measuring Bottleneck Link Bandwidth , 2001, USITS.

[6]  Douglas E. Comer,et al.  Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition , 1988 .

[7]  J. Guttag,et al.  ANTS : A Toolkit for Building and DynamicallyDeploying Network , 1998 .

[8]  Allen B. Downey.  Using pathchar to estimate Internet link characteristics , 1999, SIGCOMM '99.

[9]  G.J. Minden,et al.  A survey of active network research , 1997, IEEE Communications Magazine.

[10]  David B. Makofske,et al.  MHealth : A Real-Time Multicast Tree Visualization and Monitoring Tool , 1999 .

[11]  Vern Paxson,et al.  An architecture for large-scale Internet measurement , 1998, IEEE Commun. Mag..

[12]  Teresa H. Meng,et al.  Distributed network protocols for wireless communication , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[13]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[14]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[15]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[16]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[17]  Mohamed F. Younis,et al.  Energy-aware routing in cluster-based sensor networks , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[18]  Javed I. Khan,et al.  An Active Programmable Harness for Measurement of Composite Network States , 2001, ICN.

[19]  Deborah Estrin,et al.  Modelling Data-Centric Routing in Wireless Sensor Networks , 2002 .

[20]  Kevin C. Almeroth,et al.  Using tree topology for multicast congestion control , 2001, International Conference on Parallel Processing, 2001..

[21]  Van Jacobson,et al.  A tool to infer characteristics of internet paths , 1997 .

[22]  Sonia Fahmy,et al.  Topology-aware overlay networks for group communication , 2002, NOSSDAV '02.

[23]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[24]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[25]  Dan Rubenstein,et al.  A graph theoretic approach to bounding delay in proxy-assisted, end-system multicast , 2002, IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564).

[26]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[27]  Anna Hác,et al.  A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay , 1999, Int. J. Netw. Manag..

[28]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[29]  JAVED I. KHAN,et al.  ADAPTIVE NOMADIC TRANSCODING ON ACTIVE NETWORK , .

[30]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[31]  Timothy J. Shepard.  Decentralization channel management in scalable multihop spread-spectrum packet radio networks , 1995 .

[32]  Mohamed F. Younis,et al.  A constrained shortest-path energy-aware routing algorithm for wireless sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[33]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[34]  Henning Schulzrinne,et al.  RTP: A Transport Protocol for Real-Time Applications , 1996, RFC.

[35]  Yiwei Thomas Hou,et al.  A Server-Based Non-Intrusive Measurement Infrastructure for Enterprise Networks , 1999, Perform. Evaluation.

[36]  Tilman Wolf,et al.  Aggregated hierarchical multicast for active networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[37]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[38]  Matthew Ettus,et al.  System capacity, latency, and power consumption in multihop-routed SS-CDMA wireless networks , 1998, Proceedings RAWCON 98. 1998 IEEE Radio and Wireless Conference (Cat. No.98EX194).

[39]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[40]  T. J. Shepard.  Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks , 1995 .

[41]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[42]  Douglas Comer,et al.  Internetworking with TCP/IP , 1988 .

[43]  Kenneth L. Calvert,et al.  Concast: design and implementation of an active network service , 2001, IEEE J. Sel. Areas Commun..

[44]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.