Uma Generalização dos Critérios de Conectividade #C(v) e MCC(v)

• Jonatan Schroeder UFPR
• Jaime Cohen UEPG
• Elias Procópio Duarte Jr. UFPR

DOI: https://doi.org/10.5753/wtf.2006.23344

Abstract

The criteria #C(v) e M CC(v) allow evaluation of node connectivity on computer networks. These criteria evaluate the connectivity based only on a neighborhood of at least two nodes. This work presents a generalization of these criteria, for which the minimum neighborhood size is variable. A reverse criterion that finds a neighborhood that satisfies a desired connectivity is also presented.

References

C. Huitema. Routing in the Internet. Prentice Hall, Upper Saddle River, 2nd edition, 1999.

E. P. Duarte Jr., R. Santini, and J. Cohen. Delivering packets during the routing convergence latency interval through highly connected detours. In Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks (DSN’2004), pages 495–504, Florence, Italy, 2004.

R. E. Gomory and T. C. Hu. Multi-terminal network flows. SIAM Journal on Applied Mathematics, 9:551–556, 1961.