1 / 5

Full tree, too big to read clearly.

Full tree, too big to read clearly. Logical multicasting tree. Logical tree without inter-node name. BTW, even using topology inference, we still be able to know name of end-point. Tree with loss rate and color.

tanner-robbins
Download Presentation

Full tree, too big to read clearly.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Full tree, too big to read clearly.

  2. Logical multicasting tree.

  3. Logical tree without inter-node name. BTW, even using topology inference, we still be able to know name of end-point

  4. Tree with loss rate and color. The quality is not as good as previous ones, because I add previewer into the postscript file using window version ghostview, while add previewer into the rest of postscript file using unix version of ghostview, the latter doesn’t support color stuff. :-(

More Related