Combinatorial design of congestion-free networks

@article{Yener1997CombinatorialDO,
  title={Combinatorial design of congestion-free networks},
  author={B{\"u}lent Yener and Yoram Ofek and Moti Yung},
  journal={IEEE/ACM Trans. Netw.},
  year={1997},
  volume={5},
  pages={989-1000}
}
This paper presents a new design methodology and tools to construct a packet switched network with bursty data sources. This network design combines two important properties for arbitrary traffic pattern: (1) the aggregate throughput is scalable and (2) there is no packet loss within the subnet. More specifically, given a bounded number of ports in every switching node, the design is based on the construction of multiple virtual rings under the following constraints: (1) the virtual rings are… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Projective planes and congestion-free networks

  • Discrete Applied Mathematics
  • 2002
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

The use of hop-limits to provide survivable ATM group communications

  • Networked Group Communication
  • 2000
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

An information-theoretical framework for modeling component-based systems

  • IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
  • 2004
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.

Combinatorial Theory

M. Hall
  • New York: Wiley,
  • 1986
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers