http://iet.metastore.ingenta.com
1887

Electrical network analogue for determining the optimal flows in multiterminal communication networks

Electrical network analogue for determining the optimal flows in multiterminal communication networks

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings G (Electronic Circuits and Systems) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An electrical network model of a multiterminal communication network is described which can be used as a special-purpose analogue computer to determine the optimal distribution of information flow. It provides an alternative to digital-computer methods for which the computation time increases very rapidly with increasing network complexity, and which are therefore impractical for large networks.

References

    1. 1)
      • G.G. Savvin . (1968) Raspredelenie potokov v setyach svyazi The flow distribution in communications networks, Information networks and switching.
    2. 2)
      • Kutasin, B.P., Yashchuk, L.E.: `Nekotorie voproci primeneniya EVM dlya upravleniya setio svyazi', 18, Research Report, 1979, (Some questions of application of general purpose computers to control of communications networks) (in Russian).
    3. 3)
      • V.V. Vasiliev , A.G. Dodonov . (1974) , Gibridnie Modeli zadach optimizatsii.
    4. 4)
      • J.B. Dennis . (1959) , Mathematical programming and electrical networks.
    5. 5)
      • E.W. Dijkstra . A note on two problems in connection with graphs. Numer. Math. , 269 - 271
    6. 6)
      • S.E. Dreyfus . An appraisal of some shortest-path algorithms. Oper. Res. , 395 - 412
    7. 7)
      • J.L. Kennington . A survey of linear cost multicommodity network flows. Oper. Res. , 209 - 236
    8. 8)
      • P. Penfield , R. Spence , S. Duinker . (1970) , Tellegen's theorem and electrical networks.
    9. 9)
      • B.V. Odintsov . (1974) Ob odnom algoritme optimalinogo raspredeleniya potokov v mnogopolyosnoi seti, Vopro si Elektrosvyazi Questions of telecommunications.
    10. 10)
      • Ikhlef, C., Mordelet, N., Pelletier, J.: `An interactive routing program for international circuits', 2nd International Network Planning Symposium, March 1983, Brighton, England, p. 81–85.
    11. 11)
      • Burity, L.O., Pelletier, J.: `Methods for the dynamic optimization of transmission networks', 2nd International Network Planning Symposium, March 1983, Brighton, England, p. 92–97.
    12. 12)
      • Wollner, E.: `A primal method for planning a standby network', 2nd International Network Planning Symposium, March 1983, Brighton, England, p. 163–166.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-g-1.1984.0034
Loading

Related content

content/journals/10.1049/ip-g-1.1984.0034
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address