Hop-congestion trade-offs for high-speed networks

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 n...

Full description

Saved in:
Bibliographic Details
Published inProceedings.Seventh IEEE Symposium on Parallel and Distributed Processing pp. 662 - 667
Main Authors Kranakis, E., Krizanc, D., Pelc, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1995
Subjects
Application software
Asynchronous transfer mode
Computer science
Costs
Councils
High-speed networks
ISDN
Routing
Virtual colonoscopy
Online AccessGet full text
ISBN9780818671951
0818671955
ISSN1063-6374
DOI10.1109/SPDP.1995.530745

Cover

Abstract 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.
AbstractList 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.
Author Kranakis, E.
Krizanc, D.
Pelc, A.
Author_xml – sequence: 1
  givenname: E.
  surname: Kranakis
  fullname: Kranakis, E.
  organization: Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
– sequence: 2
  givenname: D.
  surname: Krizanc
  fullname: Krizanc, D.
  organization: Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
– sequence: 3
  givenname: A.
  surname: Pelc
  fullname: Pelc, A.
BookMark eNotj0tLw0AURgesYF97cZU_MHFu5nmXUh8VChas6xIn97bxkQmZgPjvLdTVB4fDgW8mJl3qSIhrUCWAwtvX7f22BERbWq28sRdiiT6oAMF5QAsTMQXltHTamysxy_lDqZPpzFTAOvUypu5AeWxTV4xD3ZBMzLngNBTH9nCUuSdqio7GnzR85oW45Por0_J_5-Lt8WG3WsvNy9Pz6m4jW4AwSoi2iZUBZAYkrkjXABQN28r6yiDbYBUj-uiia94RAmmu3Ym5SrEiPRc3525LRPt-aL_r4Xd_Pqj_AGVHRX8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1995.530745
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 667
ExternalDocumentID 530745
GroupedDBID 29P
6IE
6IL
ACGFS
ALMA_UNASSIGNED_HOLDINGS
CBEJK
M43
RIE
RIL
ID FETCH-LOGICAL-i118t-1c5dc2419ff19ef2e3a11ec4f5257249f5850f997c6c6db918e3fa650f620f0e3
IEDL.DBID RIE
ISBN 9780818671951
0818671955
ISSN 1063-6374
IngestDate Tue Aug 26 17:09:03 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i118t-1c5dc2419ff19ef2e3a11ec4f5257249f5850f997c6c6db918e3fa650f620f0e3
PageCount 6
ParticipantIDs ieee_primary_530745
PublicationCentury 1900
PublicationDate 19950000
PublicationDateYYYYMMDD 1995-01-01
PublicationDate_xml – year: 1995
  text: 19950000
PublicationDecade 1990
PublicationTitle Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing
PublicationTitleAbbrev SPDP
PublicationYear 1995
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0053064
ssj0000558631
Score 1.3897095
Snippet Message transmission in ATM networks is via virtual paths. Packets are routed along virtual paths by maintaining a routing field whose subfields determine the...
SourceID ieee
SourceType Publisher
StartPage 662
SubjectTerms Application software
Asynchronous transfer mode
Computer science
Costs
Councils
High-speed networks
ISDN
Routing
Virtual colonoscopy
Title Hop-congestion trade-offs for high-speed networks
URI https://ieeexplore.ieee.org/document/530745
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwELVoJ6ZCKeJbGVidxnVsxzNQVUigSlCpW5WPs4SQkqpJl_567py0CMTAlmSI5Vysu3d37x1j9xIA7RoBLyjHRAiBJ9oaDka5ONcFImjiO7-86tkifl6qZaez7bkwAOCbzyCkS1_LL6p8S6myscIfMlY91jOJbqlah3RKpFSi5aG7Q1Fg7QudWnItTeylH72Ym1WqE97Z34t9-TKy47f545wYfCpsF_sxdMX7nOmgJXPXXqqQWk0-w22Thfnul5DjP7dzwkbf5L5gfnBbp-wIyiEb7Kc7BN1hP2NiVq05omUqQKHxgmaTFsAr5-oAA92AdI55vca3BGXbSl6P2GL69P4w492ABf6BuKLhIldFji7cOicsuAnIVAjIY0cSqYjLHGKJyFlrco1my6xIQLoUYzqnJ5GLQJ6zflmVcMECoBKqyCi8ELFK0gSSiYkEWCMtBlHpJRvSB1itWw2NVbv3qz-fXrPjljhOiY4b1m82W7hF199kd97oXyhspMs
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELagDDAVShFvMrA6jetH4hmoArRVJVqpW5XHWUJITdWkC78en5MWgRjYkgyOnHN0993d9x0h9xzA2jUAmmOOCRECjZQOKYTSiEzlFkEj33k0VvFMvMzlvNHZdlwYAHDNZ-Djpavl50W2wVRZT9oDKeQ-OZBCCFmTtXYJlUDKSPFdf4fE0NqVOhWniofCiT86OTctZSO9s71n2wJmoHtvk8cJcvikX7_ux9gV53UG7ZrOXTqxQmw2-fA3Vepnn7-kHP-5oWPS_ab3eZOd4zohe7DskPZ2voPX_O6nhMXFilq8jCUoaz6vWic50MKY0rOhrodKx7Rc2VW8Zd1MXnbJbPA0fYhpM2KBvltkUVGWyTyzTlwbwzSYPvCEMciEQZFUi8yMRROB0TrMlDVcqlkE3CQ2qjOqH5gA-BlpLYslnBMPsIjKUgwwmJBREkHUDwMGOuTahlHJBengB1isahWNRb33yz-f3pHDeDoaLobP49crclTTyDHtcU1a1XoDNzYQqNJbdwC-AAPxqBg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings.Seventh+IEEE+Symposium+on+Parallel+and+Distributed+Processing&rft.atitle=Hop-congestion+trade-offs+for+high-speed+networks&rft.au=Kranakis%2C+E.&rft.au=Krizanc%2C+D.&rft.au=Pelc%2C+A.&rft.date=1995-01-01&rft.pub=IEEE&rft.isbn=9780818671951&rft.issn=1063-6374&rft.spage=662&rft.epage=667&rft_id=info:doi/10.1109%2FSPDP.1995.530745&rft.externalDocID=530745
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6374&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6374&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6374&client=summon