Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Acampora, Anthony S.; | Guo, Duanyang
Affiliations: Department of Electrical and Computer Engineering and Center for Wireless Communications, University of California, San Diego, La Jolla, CA 92093, USA, Tel.: 619-534-5438, Fax: 619-534-1483, E-mail: acampora@ece.ucsd.edu | GTE Laboratories, Inc., 40 Sylvan Road, Waltham, MA 02254, USA
Note: [] A preliminary version of this paper appeared in the Proceeding of International Conference on Communications (ICC), Seattle, June, 1995. This work was performed under ARPA contract MDA 972-92-H-0010 as part of the Optical Network Technology Consortium (ONTC). The research reported was conducted while both authors were affiliated with Columbia University, NY, USA.
Abstract: Multihop lightwave networks have recently emerged as prominent candidates for high-speed local, metropolitan, and wide-area networks. Of interest is the end-user capacity which may be afforded by a multihop lightwave network. For uniform traffic patterns, and for certain regular connection graphs, it is possible to compute the expected number of hops taken by a representative packet, the total network capacity, and the capacity available to each end-user. When the traffic patterns are non-uniform, simple expressions for network capacity cannot be produced. In this paper, we apply information theoretic concepts to find an upper bound on the capacity which may be produced, by any multihop network, for an arbitrary non-uniform user-to-user traffic pattern. Also produced is a lower bound for the expected number of hops. Such bounds are useful as yardsticks against which the performance of specific architectures and connection graphs may be compared, since the methodology does not produce an multihop connection graph capable of achieving the bound. Although the work was stimulated by an interest in multihop lightwave networks, the bounds are equally applicable when non-uniform traffic is presented to any type of network involving packet switching nodes and directed connectivity graphs. Somewhat surprisingly, results obtained suggest that, for certain types of traffic non-uniformity, the capacity achievable per end user does not diminish as the number of network access stations increases.
DOI: 10.3233/JHS-1997-6201
Journal: Journal of High Speed Networks, vol. 6, no. 2, pp. 81-92, 1997
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl