Cart (Loading....) | Create Account
Close category search window
 

Hop-congestion trade-offs for high-speed networks

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

3 Author(s)
Kranakis, E. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; Krizanc, D. ; Pelc, A.

Message transmission in ATM networks is via virtual paths. Packets are routed along virtual paths by maintaining a routing field whose subfields determine the intermediary destinations of the packet. In such a network it is important to construct path layouts that minimize the hop number (i.e. the number of virtual paths used to travel between any two nodes) as a function of edge-congestion (i.e. the number of virtual paths passing through a link). In this paper we construct asymptotically optimal virtual path layouts for chains and meshes

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.