Virtual Path Network Topology Optimization Using Random Graphs

@inproceedings{Farag1999VirtualPN,
  title={Virtual Path Network Topology Optimization Using Random Graphs},
  author={Andr{\'a}s Farag{\'o} and Imrich Chlamtac and Stefano Basagni},
  booktitle={INFOCOM},
  year={1999}
}
An algorithm is presented for designing the logical topology of the virtual path (VP) network, an important task in ATM network design. We prove that the algorithm provides a VP network topology that is asymptotically optimal with respect to both connectivity and the diameter of the network. These optimality properties are combined with algorithmic simplicity and polynomial running time, thus overcoming the notorious “optimality vs. scalability” dilemma. This result is made possible by applying… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Similar Papers

Loading similar papers…