By Topic

Optimal allocation of channels in an alternate route communication network [Comments on]

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
$33 $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

3 Author(s)
S. Ling ; Dept. of Elec. Communication Engrg., Faculty of Eng., Osaka University, Japan ; Y. Tezuka ; Y. Kasahara

Recently, it has been reported that the Hakimi Theorem, quoted as Theorem 1 in the above named-paper (ibid., vol. CS-12 pp. 185-190, June 1964), does not hold in the general case. The theorem, however, is still true in so-called bi-path networks discussed by D.T. Tang (1964). In case of bi-path networks, the argument in the original paper is sound. However, in general networks, some modifxation must be made. In that case, a more fundamental relation can be readily derived from the definition of branch capacity. The commentor derives a new expression that should be used in place of (6) in the original paper Consequently, Theorem 2 of the original work should be changed as noted herein. A more detailed treatment of the problem is found in Ling et al. (Inst. Elect. Commun. Engrs. Japan, vol. 48, pp. 40-48, January 1965 (in Japanese), to be translated into English and published by the IEEE in Electronics and Communzeataons an Japan).

Published in:

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