Advances in Switching Networks最新文献

筛选
英文 中文
Isomorphism of classical rearrangeable networks 经典可重排网络的同构性
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/09
M. McIlroy, J. P. Savicki
{"title":"Isomorphism of classical rearrangeable networks","authors":"M. McIlroy, J. P. Savicki","doi":"10.1090/dimacs/042/09","DOIUrl":"https://doi.org/10.1090/dimacs/042/09","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122061356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An algorithm for the construction of concentrators from 2 x 2 sorters 从2 × 2分类器构建集中器的算法
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/13
S. Li, Simon G. M. Koo, Hui Li
{"title":"An algorithm for the construction of concentrators from 2 x 2 sorters","authors":"S. Li, Simon G. M. Koo, Hui Li","doi":"10.1090/dimacs/042/13","DOIUrl":"https://doi.org/10.1090/dimacs/042/13","url":null,"abstract":"This paper presents polynomial-time algorithms for the construction of deterministic and internally non-blocking concentrators from multi-stage cascades of 2x2 sorters. The approach is a generalization of \"Fast Knockout\" and \"Sortout\" techniques. The goal is to construct best known m-to-n networks of 2x2 sorters for m-to-n concentration, where m and n are within the practical range. The main criterion on the complexity of concentration is the number of stages in the cascade.","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125369419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non-blocking multistage interconnection networks with limited depth 深度有限的非阻塞多级互连网络
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/08
I. Busi, A. Pattavina
{"title":"Non-blocking multistage interconnection networks with limited depth","authors":"I. Busi, A. Pattavina","doi":"10.1090/dimacs/042/08","DOIUrl":"https://doi.org/10.1090/dimacs/042/08","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122818888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Routing strategy and performance evaluation of multiple-ring ShuffleNet topology for high speed wavelength-division multiplexed optical communications 高速波分复用光通信中多环ShuffleNet拓扑的路由策略及性能评估
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/17
D. Huang, K. Kiasaleh
{"title":"Routing strategy and performance evaluation of multiple-ring ShuffleNet topology for high speed wavelength-division multiplexed optical communications","authors":"D. Huang, K. Kiasaleh","doi":"10.1090/dimacs/042/17","DOIUrl":"https://doi.org/10.1090/dimacs/042/17","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130493956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Repackable networks-The concept and applications 可重新包装网络——概念和应用
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/05
A. Jajszczyk, M. Kubale
{"title":"Repackable networks-The concept and applications","authors":"A. Jajszczyk, M. Kubale","doi":"10.1090/dimacs/042/05","DOIUrl":"https://doi.org/10.1090/dimacs/042/05","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129063752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Constructing nonblocking multicast switching networks with fanout reduction 基于扇出减少的非阻塞组播交换网络的构建
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/03
Chun-Fai Chan, C. Lea
{"title":"Constructing nonblocking multicast switching networks with fanout reduction","authors":"Chun-Fai Chan, C. Lea","doi":"10.1090/dimacs/042/03","DOIUrl":"https://doi.org/10.1090/dimacs/042/03","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132692965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non-blocking routing properties of Clos networks Clos网络的非阻塞路由属性
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/12
T. Lee, P. P. To
{"title":"Non-blocking routing properties of Clos networks","authors":"T. Lee, P. P. To","doi":"10.1090/dimacs/042/12","DOIUrl":"https://doi.org/10.1090/dimacs/042/12","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114340277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Average-case bounds for the complexity of path-search 路径搜索复杂度的平均情况边界
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/01
N. Pippenger
{"title":"Average-case bounds for the complexity of path-search","authors":"N. Pippenger","doi":"10.1090/dimacs/042/01","DOIUrl":"https://doi.org/10.1090/dimacs/042/01","url":null,"abstract":"Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation Constructing nonblocking multicast switching networks with fanout reduction Multirate broadcast switching networks nonblocking in a wide sense Repackable networks-The concept and applications Modeling the blocking behavior of Clos networks Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121688025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strictly nonblocking conferencing meshes 严格的非阻塞会议网格
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/14
Yi Du, G. Masson
{"title":"Strictly nonblocking conferencing meshes","authors":"Yi Du, G. Masson","doi":"10.1090/dimacs/042/14","DOIUrl":"https://doi.org/10.1090/dimacs/042/14","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121519682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions 次极大和无故障条件下可重排容错Clos互连网络分解算法的性能
Advances in Switching Networks Pub Date : 1900-01-01 DOI: 10.1090/dimacs/042/07
J. Carpinelli, Catherine B. Wang
{"title":"Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions","authors":"J. Carpinelli, Catherine B. Wang","doi":"10.1090/dimacs/042/07","DOIUrl":"https://doi.org/10.1090/dimacs/042/07","url":null,"abstract":"","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信