A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks

@article{Lin1992ANM,
  title={A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks},
  author={Frank Yeong-Sung Lin and James R. Yee},
  journal={INFORMS Journal on Computing},
  year={1992},
  volume={4},
  pages={250-266}
}
In this paper, the routine problem in virtual circuit networks is considered. In virtual circuit networks, all of the packets in a session are transmitted over exactly one path established between the origin and the destination. We consider the problem of choosing a path for each origin-destination pair so as to minimize the average number of packets in the network. We consider the formulation of this problem as a nonlinear multicommodity flow problem with integer decision variables. The… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Some approaches to solving a multihour broadband network capacity design problem with single-path routing

  • Telecommunication Systems
  • 2000
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Near-optimal delay constrained routing in virtual circuit networks

  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND