By Topic

Dynamic Communication Networks with Capacity Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Frank, H. ; Univ. of California, Berkeley, CA ; El-Bardai, M.

Communication networks with link transit times are modeled by linear graphs with branch time delays and finite branch capacities. Memoryless linear routing strategies as well as linear routing strategies with finite memory are defined. The state reachability problem in both cases is considered, and the sets of reachable demand vectors are exhibited. The problem of finding optimal routings which minimize network losses subject to demand constraints is formulated as a linear program, and extensions to infinite memory and time-varying systems are given.

Published in:

Communication Technology, IEEE Transactions on  (Volume:17 ,  Issue: 4 )