Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yung-Chih Lin

dblp:59/5407 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 91% Performance modeling and evaluation · 9%
Computer networks
1 paper
Internet architecture and protocols · 67% Routing and switching · 33%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
overlay networks
0.112009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009
Routing and switching
routing
0.112009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009
Internet architecture and protocols › network topology
small-world network
0.112009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009
Distributed systems › distributed system architecture
hierarchical architecture
0.112009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009
Distributed systems
peer-to-peer systems
0.112009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009
Distributed systems › peer-to-peer systems
small-world network
0.112009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009
Performance modeling and evaluation
simulation
0.012009
Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures · IEEE Trans. Parallel Distributed Syst. 2009

Methods — techniques the papers use, named apart from their topics

simulation · 0.2localized routing · 0.2hierarchical model · 0.2
YearPublicationVenuePosition
2009 Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures
abstract
Small-world (SW) networks possess two properties, namely low diameter and high clustering coefficient, which are often desired by large-scale peer-to-peer networks. Prior studies have shown that the construction of an SW network can be based on a d-regular graph, and each node in the graph maintains d local neighbors and a small constant number of long-distance contacts. However, it is commonly understood that it is difficult to construct a short route in an SW network, given source (s) and target (t) nodes, though an SW network guarantees that a short route from s to t exists. Prior work in [1] proposed a navigable SW network for a d-dimensional lattice such that a simple localized routing algorithm can be devised to route a message from s to t using O(log2,X) hops, where X is the number of nodes in the network. In this paper, we present a novel navigable SW network based on a hierarchical model. Compared to previous efforts, the novelty of our study presents 1) that our network construction based on a hierarchical model is decentralized, 2) that routing a message between any two nodes in our SW network takes logarithmic hopcount in expectation, 3) that our SW network has high cluster coefficient, and 4) that the performance of our proposal is mathematically provable. We support the performance of our proposal in this study through rigorous, thorough performance analysis and extensive simulations.
Hung-Chang Hsiao, Yung-Chih Lin, Hao Liao
IEEE Trans. Parallel Distributed Syst.2
1997 Design of a Fuzzy Usage Parameter Controller (FUPC) for ATM Networks
abstract
This paper presents the design of a fuzzy usage parameter controller (FUPC) for ATM (asynchronous transfer mode) networks. The usage parameter control (UPC) is here based on a dual leaky bucket (DLB) mechanism, with parameters of token generation rate and token pool size. In FUPC, we further employ parameters of token-change rate and interarrival time of incoming cells as input linguistic variables to reflect the usage situation in advance. Simulation results reveal that the proposed FUPC possesses a shorter response time to detect violation cells, keeps the output rate of the user close to the declared usage parameters, and thus achieves more precise control than DLB.
Chung-Ju Chang, Chih-Feng Juan, Yung-Chih Lin, Ray-Guang Cheng
ICC (1)3