The Ordered Core Based Tree Protocol

Abstract

This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that the CBT protocol can form loops during periods of routing instability, and that it can consistently fail to build a connected multicast tree, even when the underlying routing is stable. The OCBT protocol provably eliminates these deficiencies and reduces the latency of tree repair following a link or core failure. OCBT also improves scalability by allowing flexible placement of the cores that serve as points of connection to a multicast tree. Simulation results show that the amount of control traffic in OCBT is comparable to that in CBT.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1997
Accession Number
ADA461717

Entities

People

  • Clay Shields
  • J.J. Garcia-Luna-Aceves

Organizations

  • University of California, Santa Cruz

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Congestion
  • Construction
  • Denial Of Service Attack
  • Detection
  • Engineering
  • Guarantees
  • Hot Spots
  • Information Operations
  • Instability
  • Military Research
  • Networks
  • Routing Protocols
  • Simulations
  • Specifications
  • Spine
  • United States

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Graph Algorithms and Convex Optimization.