Baolei Cheng

Applied Filters

Baolei Cheng
AuthorRemove filter

Clear all

People

Colleagues

Baolei Cheng (39)
Jianxi Fan (39)
Xiaohua Jia (9)
Jingya Zhou (8)
Cheng-Kuan Lin (6)
Jia Yu (6)
Yuejuan Han (5)
Xueli Sun (4)
Guijuan Wang (3)
Shukui Zhang (3)
Yan Wang (3)
Hui Dong (2)
Mengjie Lv (2)
Qianru Zhou (2)
Wenjun Liu (2)
Xi Wang (2)
Xiaoqing Liu (2)
Yihong Wang (2)
Zhao Liu (2)
Zhiyong Pan (2)

Publication

Journal/Magazine Names

Theoretical Computer Science (9)
Journal of Parallel and Distributed Computing (5)
The Journal of Supercomputing (5)
Journal of Computer Science and Technology (2)
ACM Computing Surveys (1)
Applied Mathematics and Computation (1)
Discrete Applied Mathematics (1)
Frontiers of Computer Science in China (1)
Future Generation Computer Systems (1)
IEEE/ACM Transactions on Networking (1)
Information Sciences: an International Journal (1)
International Journal of Communication Systems (1)
International Journal of Parallel Programming (1)

Proceedings/Book Names

NPC 2013: Proceedings of the 10th IFIP International Conference on Network and Parallel Computing - Volume 8147 (2)
Algorithms and Architectures for Parallel Processing (1)
Algorithms and Architectures for Parallel Processing (1)
CSA '13: Proceedings of the 2013 International Conference on Computer Sciences and Applications (1)
CSCLOUD '15: Proceedings of the 2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing (CSCloud) (1)
MSN '15: Proceedings of the 2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN) (1)
Network and Parallel Computing (1)
PAAP '12: Proceedings of the 2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming (1)

All Publications

Other periodicals (28)
Proceedings (9)
Journals (2)

Publisher

Elsevier Science Publishers Ltd. (9)
Springer-Verlag (8)
Kluwer Academic Publishers (6)
Academic Press, Inc. (5)
IEEE Computer Society (4)
Elsevier Science Inc. (2)
Elsevier Science Publishers B. V. (2)
Association for Computing Machinery (1)
IEEE Press (1)
John Wiley and Sons Ltd. (1)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years
Past 2 years
Past year

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

39 Results for: Author: Baolei ChengEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,813,003 records)|Limit your search to The ACM Full-Text Collection (772,179 records)

Results

Showing 1 - 20of39 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

research-article
A Family of General Architectures Toward Interconnection Networks and Data Center Networks
- Xiaoqing Liu
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Bai Yin
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Xiaohua Jia
  Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong
IEEE/ACM Transactions on Networking, Volume 32, Issue 5•Oct. 2024, pp 4099-4113 • https://doi.org/10.1109/TNET.2024.3411021
Networks of large scales are an essential component in supercomputing systems as well as in data centers. As the network scale increases, the probability of processor/server failures also inevitably increases. It is therefore a worthwhile undertaking to ...
0Citation
16
Downloads
Metrics
Total Citations0
Total Downloads16
Last 12 Months16
Last 6 weeks11
Export Citations
Save to Binder
Get Access
research-article
Enhancing fault tolerance of balanced hypercube networks by the edge partition method
- Xiaoqing Liu
  School of Computer Science and Technology, Soochow University, Suzhou, 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou, 215006, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou, 215006, China
  ,
- Jia Yu
  College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou, 215006, China
Theoretical Computer Science, Volume 986, Issue C•Feb 2024 • https://doi.org/10.1016/j.tcs.2023.114340
Abstract
Interconnection networks are key component of parallel and distributed systems. As the network scale increases, the growing number of link failures becomes inevitable. Therefore, how to enhance the fault tolerance of the network has become a ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing
- Shuai Liu
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Yan Wang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Jianxi Fan
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Baolei Cheng
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
Algorithms and Architectures for Parallel Processing•October 2023, pp 40-56• https://doi.org/10.1007/978-981-97-0798-0_3
Abstract
The study of interconnection networks plays an essential role in the design of parallel computing systems because their topological properties make a great impact on the performance and reliability of the systems. The balanced hypercube, designed ... $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Reliability evaluation for a class of recursive match networks
- Qianru Zhou
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jingya Zhou
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jia Yu
  College of Computer Science and Technology, Qingdao University, Qingdao 266071, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Theoretical Computer Science, Volume 981, Issue C•Jan 2024 • https://doi.org/10.1016/j.tcs.2023.114253
Abstract
Due to system failures in endlessly, efforts are always strived to improve the reliability of the system. As a fundamental problem in large-scale parallel and distributed systems, connectivity and diagnosability, especially g-extra connectivity ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Fault tolerance of recursive match networks based on g-good-neighbor fault pattern
- Qianru Zhou
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Hai Liu
  Department of Computing, Hang Seng University of Hong Kong, Siu Lek Yuen, Hong Kong
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Yuejuan Han
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Applied Mathematics and Computation, Volume 461, Issue C•Jan 2024 • https://doi.org/10.1016/j.amc.2023.128318
Abstract
The rapid informatization and digitalization of the society heavily rely on the extensive use of parallel and distributed, networked computer systems. It is important for large-scale parallel and distributed systems to be able to ...
Highlights

We proposed a new class of networks, named recursive match networks (RMNs), which contain the BCube, BC networks, and some other networks.
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks
- Mengjie Lv
  School of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jia Yu
  College of Computer Science and Technology, Qingdao University, Qingdao 266071, China
  ,
- Xiaojua Jia
  Department of Computer Science, City University of Hong Kong, Hong Kong
Journal of Parallel and Distributed Computing, Volume 183, Issue C•Jan 2024 • https://doi.org/10.1016/j.jpdc.2023.104761
Abstract
With the increasing demand for information, the number of nodes in the network is increasing rapidly, followed by the problem of information loss and communication delay caused by insufficient communication. Therefore, how to effectively transmit ...
Highlights

We propose a fault-tolerant path algorithm of Q n k to obtain a fault-free path between any two distinct fault-free nodes.
We design two algorithms, called DPQ1 and DPQ2, to construct disjoint paths between any two distinct nodes of Q ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Connectivity and diagnosability of a class of recursive networks
- Yaqian Tang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, Jiangsu, China
  ,
- Baolei Cheng
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, Jiangsu, China
  ,
- Yan Wang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, Jiangsu, China
  ,
- Yuejuan Han
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, Jiangsu, China
  ,
- Jia Yu
  https://ror.org/021cj6z65School of Computer Science and Technology, Qingdao University, 266000, Qingdao, Shandong, China
  ,
- Jianxi Fan
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, Jiangsu, China
The Journal of Supercomputing, Volume 80, Issue 3•Feb 2024, pp 3817-3848 • https://doi.org/10.1007/s11227-023-05589-2
Abstract
With the expansion of network scale, it is essential to study network reliability through connectivity and diagnosability. For Hypercube, DCell, BCube, and other networks, their connection modes are specific and different, so it is necessary to ... $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Probabilistic Fault Diagnosis of Clustered Faults for Multiprocessor Systems
- Xue-Li Sun
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  https://ror.org/05t8y2r12Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, 215006, Suzhou, China
  ,
- Jian-Xi Fan
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  https://ror.org/05t8y2r12Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, 215006, Suzhou, China
  ,
- Bao-Lei Cheng
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Yan Wang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Li Zhang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
Journal of Computer Science and Technology, Volume 38, Issue 4•Jul 2023, pp 821-833 • https://doi.org/10.1007/s11390-021-1099-0
Abstract
With the development of high-performance computing and the expansion of large-scale multiprocessor systems, it is significant to study the reliability of systems. Probabilistic fault diagnosis is of practical value to the reliability analysis of ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Reliability evaluation of complete graph-based recursive networks
- Yihong Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Yuejuan Han
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Theoretical Computer Science, Volume 966, Issue C•Jul 2023 • https://doi.org/10.1016/j.tcs.2023.114015
Abstract
With the development of cloud computing and high-performance computing technologies, the scales of data center networks and interconnection networks become more and more large. As a result, the reliability evaluation of the two kinds ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication
- Huanwen Zhang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Yan Wang
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Jianxi Fan
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Yuejuan Han
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Baolei Cheng
  https://ror.org/05t8y2r12School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
The Journal of Supercomputing, Volume 80, Issue 2•Jan 2024, pp 1907-1934 • https://doi.org/10.1007/s11227-023-05546-z
Abstract
If a set of spanning trees of a graph do not share any edge with each other, they are called edge-disjoint spanning trees (for short EDSTs), which have widespread practical applications, such as fault-tolerant broadcasting, the distributed ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
survey
Published By ACM
Published By ACM
Independent Spanning Trees in Networks: A Survey
- Baolei Cheng
  Soochow University
  ,
- Dajin Wang
  Montclair State University
  ,
- Jianxi Fan
  Soochow University
ACM Computing Surveys, Volume 55, Issue 14s•December 2023, Article No.: 335, pp 1-29 • https://doi.org/10.1145/3591110
The problem of constructing independent spanning trees (ISTs) dates back to as early as the late 1980s. Given a network G of a certain topology, the question is whether we can, as well as how to, construct a set of ISTs in G. ISTs have proven to be of ...
12Citation
582
Downloads
Metrics
Total Citations12
Total Downloads582
Last 12 Months268
Last 6 weeks34
Export Citations
Save to Binder
Get Access
research-article
Reliability of augmented k-ary n-cubes under the extra connectivity condition
- Xueli Sun
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, People’s Republic of China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, People’s Republic of China
  ,
- Eminjan Sabir
  College of Mathematics and System Sciences, Xinjiang University, 830000, Urumqi, People’s Republic of China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, People’s Republic of China
  ,
- Jia Yu
  College of Computer Science and Technology, Qingdao University, 266071, Qingdao, People’s Republic of China
The Journal of Supercomputing, Volume 79, Issue 12•Aug 2023, pp 13641-13669 • https://doi.org/10.1007/s11227-023-05141-2
Abstract
Fault tolerance is critical to the reliability analysis of interconnection networks because the vulnerability of components increases with the growth of network scale. Extra connectivity and extra diagnosability are two decisive indicators to ... $_{}$ $_{}$ $\frac{^{}}{}$ $_{}$ $\frac{^{}}{}$ $\frac{}{}$ $_{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
The t/m-diagnosis strategy of augmented k-ary n-cubes
- Xueli Sun
  School of Computer Science and Technology, Soochow University, Suzhou 215006, PR China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, PR China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, PR China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, PR China
Theoretical Computer Science, Volume 945, Issue C•Feb 2023 • https://doi.org/10.1016/j.tcs.2022.12.021
Abstract
As the scale of interconnected networks grows, so does the number of processor failures in the network. When a processor fails, the information transmitted through the failed processor is unreliable. In fact, the higher the network's ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
- Zhiyong Pan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Xiajing Li
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China
Theoretical Computer Science, Volume 942, Issue C•Jan 2023, pp 33-46 • https://doi.org/10.1016/j.tcs.2022.11.023
Abstract
The line graphs of some well-known graphs, such as the generalized hypercube and the crossed cube, have been adopted for the logic graphs of data center networks (DCNs). Conditional bijective connection networks (conditional BC ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Fault-tolerability of the hypercube and variants with faulty subcubes
- Yihong Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Xueli Sun
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Journal of Parallel and Distributed Computing, Volume 167, Issue C•Sep 2022, pp 148-156 • https://doi.org/10.1016/j.jpdc.2022.05.001
Abstract
A faulty vertex may probably affect its neighbors and further causes them being faulty, which makes a subnetwork (structure) fail. Therefore, looking into the effect caused by some structures becoming faulty is meaningful. The ...
Highlights

We study fault-tolerability of two important interconnection networks when a hypercube-based subnetwork fails.
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Connectivity and constructive algorithms of disjoint paths in dragonfly networks
- Suying Wu
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  ,
- Jia Yu
  School of Computer Science and Technology, Qingdao University, Qingdao 266000, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Theoretical Computer Science, Volume 922, Issue C•Jun 2022, pp 257-270 • https://doi.org/10.1016/j.tcs.2022.04.028
Abstract
Dragonfly networks have been widely used in the current High Performance Computing (HPC) computers due to lower global network diameter and other advantages of communication performance such as modularity and cost-effectiveness. The ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Completely Independent Spanning Trees in the Line Graphs of Torus Networks
- Qingrong Bian
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, 215006, Suzhou, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, 215006, Suzhou, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Zhiyong Pan
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, 215006, Suzhou, China
Algorithms and Architectures for Parallel Processing•December 2021, pp 540-553• https://doi.org/10.1007/978-3-030-95391-1_34
Abstract
Due to the application in reliable information transmission, parallel transmission and safe distribution of information, and parallel diagnosis algorithm for faulty servers, completely independent spanning trees (CISTs) play important roles in the ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Fault-Tolerant and Unicast Performances of the Data Center Network HSDC
- Hui Dong
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, Suzhou, China
  ,
- Jingya Zhou
  School of Computer Science and Technology, Soochow University, Suzhou, China
International Journal of Parallel Programming, Volume 49, Issue 5•Oct 2021, pp 700-714 • https://doi.org/10.1007/s10766-021-00699-x
Abstract
In order to satisfy the rapidly increasing demand for data volume, large data center networks (DCNs) have been proposed. In 2019, Zhang et al. proposed a new highly scalable DCN architecture named HSDC (Highly Scalable Data Center Network), which ... $_{}$ $_{}$ $_{}$ $_{}$
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements
- Gui-Juan Wang
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  School of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), 250353, Jinan, China
  ,
- Cheng-Kuan Lin
  College of Mathematics and Computer Science, Fuzhou University, 350108, Fuzhou, China
  ,
- Jian-Xi Fan
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Jing-Ya Zhou
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Bao-Lei Cheng
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
Journal of Computer Science and Technology, Volume 35, Issue 5•Oct 2020, pp 1064-1083 • https://doi.org/10.1007/s11390-020-9508-3
Abstract
BCube is one kind of important data center networks. Hamiltonicity and Hamiltonian connectivity have significant applications in communication networks. So far, there have been many results concerning fault-tolerant Hamiltonicity and fault-...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
Connectivity and Routing Algorithm of the Data Center Network HSDC
- Hui Dong
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Jianxi Fan
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Baolei Cheng
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Yan Wang
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
  ,
- Jingya Zhou
  School of Computer Science and Technology, Soochow University, 215006, Suzhou, China
Network and Parallel Computing•September 2020, pp 407-419• https://doi.org/10.1007/978-3-030-79478-1_35
Abstract
In order to satisfy the rapidly increasing demand for data volume, large data center networks (DCNs) have been proposed. In 2019, Zhang et al. proposed a new highly scalable DCN architecture named HSDC, which can achieve greater incremental ... $_{}$ $_{}$ $_{}$ $_{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder

Author Profile Pages

Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples:
History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:
- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.

Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
Future Direction: The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.

A direct search interface for Author Profiles will be built.

An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.

It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.

Bibliometrics

The ACM DL is a comprehensive repository of publications from the entire field of computing.

It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.

Average citations per article = The total Citation Count divided by the total Publication Count.
Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)

ACM Author-Izer Service

Summary Description

ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.

Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.

ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.

To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.

How ACM Author-Izer Works

Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.

The Service can be applied to all the articles you have ever published with ACM.

Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.

For authors who do not have a free ACM Web Account:

Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.

For authors who have an ACM web account, but have not edited their ACM Author Profile page:

Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.

For authors who have an account and have already edited their Profile Page:

Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"

ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.

Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.

FAQ

Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
Q. What articles are eligible for ACM Author-Izer?
A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.

Q. Are there any restrictions on authors to use this service?
A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.

Q. What are the requirements to use this service?
A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.

Q. What is an ACM Author Profile Page?
A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.

Q. How do I find my Author Profile page and take ownership?
A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours

Q. Why does my photo not appear?
A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters

Q. What if I cannot find the Add Personal Information function on my author page?
A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.

Q. What happens if an author changes the location of his bibliography or moves to a new institution?
A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.

Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.

However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.

Q. What happens if the author’s bibliography lives on a page with several aliases?
A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.

Q. Why should authors use ACM Author-Izer?
A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.

Q. Does ACM Author-Izer provide benefits for authors?
A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.

Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.

Q. How does ACM Author-Izer benefit the computing community?
A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.

In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.

Q. How do authors access ACM Author-Izer?
A. See How to Use

Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.

Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner

Baolei Cheng

Baolei Cheng

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

A Family of General Architectures Toward Interconnection Networks and Data Center Networks

Enhancing fault tolerance of balanced hypercube networks by the edge partition method

Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing

Reliability evaluation for a class of recursive match networks

Fault tolerance of recursive match networks based on g-good-neighbor fault pattern

Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks

Connectivity and diagnosability of a class of recursive networks

Probabilistic Fault Diagnosis of Clustered Faults for Multiprocessor Systems

Reliability evaluation of complete graph-based recursive networks

Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication

Independent Spanning Trees in Networks: A Survey

Reliability of augmented k-ary n-cubes under the extra connectivity condition

The t/m-diagnosis strategy of augmented k-ary n-cubes

A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

Fault-tolerability of the hypercube and variants with faulty subcubes

Connectivity and constructive algorithms of disjoint paths in dragonfly networks

Completely Independent Spanning Trees in the Line Graphs of Torus Networks

Fault-Tolerant and Unicast Performances of the Data Center Network HSDC

Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements

Connectivity and Routing Algorithm of the Data Center Network HSDC