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

Yow-Wei Yao

dblp:50/393 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1992
—ORCID · none

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author

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 networks
2 papers
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network interconnection
protocol conversion
0.021991
Constructing Protocol Converters with Guaranteed Service · INFOCOM 1991
A Modular Approach to Constructing Protocol Converters · INFOCOM 1990
Internet architecture and protocols › integrated services
guaranteed service
0.011991
Constructing Protocol Converters with Guaranteed Service · INFOCOM 1991

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

top-down synthesis · 0.0liveness verification · 0.0finite state machine decomposition · 0.0
YearPublicationVenuePosition
1992 Constructing Protocol Converters from Service Specifications
abstract
A four-step algorithm for constructing a protocol converter using the top-down approach is proposed. The algorithm involves construction of a system graph from the required service specification and the service specifications of the target protocols; construction of a service converter and new protocols services from the constructed system graph modification of the given protocols entities, to support the new service specifications, and derivation of a final converter by integrating the service converter and the constructed protocol entities. The protocol converter is guaranteed not only to satisfy the conformity property, but also to be free from deadlock and livelock.>
Yow-Wei Yao, Ming T. Liu
ICDCS1
1991 Constructing Protocol Converters with Guaranteed Service
abstract
The authors consider the conformity property, i.e. that the protocol converters providing communication between different networks meets the service specified by the designer, in constructing protocol converters. Using the top-down approach, an algorithm consisting of the following five steps is proposed to construct a protocol converter: (1) construction of a system graph from the given input; (2) removal of states and transitions that violate the synchronization requirements from the system graph constructed previously; (3) enforcement of liveness requirement on the system graph; (4) verification of the system graph against the service specification; and (5) derivation of a protocol converter from the system graph. The protocol converter so constructed is guaranteed not only to satisfy the conformity property, but also to be free from both deadlock and livelock.>
Yow-Wei Yao, Ming T. Liu
INFOCOM1
1990 A Modular Approach to Constructing Protocol Converters
abstract
A modular approach is proposed for constructing a converter for two protocols that go through different phases, performing separate functions in each phase. The construction of such a converter consists of three steps: (1) the decomposition of protocols into distinct functions; (2) the construction of functional converters for each pair of functions selected by the converter designer; and (3) the merging of local functions with functional converters to construct the final converter. The final converter not only contains a common subset of functions of the two protocols, but also includes functionalities specified to each protocol.>
Yow-Wei Yao, Wen-Shyen E. Chen, Ming T. Liu
INFOCOM1