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

Gerald R. Ash

dblp:59/3554 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2003
—ORCID · none

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

Computer networks · 6 · 5 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
3 papers
Routing and switching · 50% Network optimization and economics · 22% Network performance modeling · 16%

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

TopicWeightPapersLastEvidence papers
Routing and switching
adaptive routing
0.021993
An analytical model for adaptive routing networks · IEEE Trans. Commun. 1993
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network performance modeling
queueing analysis
0.011993
An analytical model for adaptive routing networks · IEEE Trans. Commun. 1993
Routing and switching › qos routing
real-time routing
0.011993
An analytical model for adaptive routing networks · IEEE Trans. Commun. 1993
Routing and switching
traffic engineering
0.011991
Robust Traffic Design for Dynamic Routing Networks · INFOCOM 1991
Optical networks › network survivability
traffic restoration
0.011991
Robust Traffic Design for Dynamic Routing Networks · INFOCOM 1991
Network optimization and economics › resource allocation
bandwidth allocation
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Routing and switching › routing
distributed routing
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network optimization and economics › network design
network planning
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network optimization and economics › network design
robust network design
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network management and operations
failure recovery
0.011991
Robust Traffic Design for Dynamic Routing Networks · INFOCOM 1991
Network performance modeling
network reliability
0.011991
Robust Traffic Design for Dynamic Routing Networks · INFOCOM 1991

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

erlang fixed point method · 0.0birth-death equations · 0.0simulation · 0.0
YearPublicationVenuePosition
2003 Performance evaluation of QoS-routing methods for IP-based multiservice networks
Gerald R. Ash
Comput. Commun.1
1997 RTNR application in the AT&T network
abstract
Summary form only given, substantially as follows. The introduction of real-time network routing (RTNR) into the AT&T switched network was completed in July 1991, and completely replaced dynamic nonhierarchical routing (DNHR). RTNR provides the platform for the dynamic class-of-service routing features for emerging new services, and also a provides an ingress/egress routing arrangement to ensure reliability and flexibility for international and access networks. 10 virtual networks have been established to serve major classes-of-service, which share the facilities of the network but provide individual control and monitoring of traffic as well as new priority service capabilities. RTNR allows a marked improvement in network reliability by providing for the selection of over 135 routes between every pair of cities for every call. RTNR performance improvements are illustrated across various network conditions, which include: a) high day loads on the Monday after Thanksgiving, b) peak day loads on Thanksgiving and Christmas, c) a cable cut near Austin, Indiana, in which the combination of RTNR and automatic facility restoration provided excellent recovery from the failure, and d) the international network performance to Taiwan during the Chinese New Year three-day holiday calling period. We conclude that RTNR improves network performance under all network conditions, that it simplifies the operations environment and lowers operations cost, and that it enables the sharing of voice and data network capacity.
Gerald R. Ash
ISCC1
1993 An analytical model for adaptive routing networks
abstract
Real-time network routing (RTNR) is a new adaptive routing method. With RTNR, switches have a simple way of exchanging link status bit map information, thereby determining the availability and load conditions of the direct and all two-link paths to the destination. Link busy-idle status is exchanged between the network nodes using a bit map data exchange through the common channel signaling (CCS) network, and calls are set up where there is the most available capacity in the network. To date the analysis of RTNR networks has been limited to simulation models. The present authors develop an analytical model for the AT&T network under RTNR, which is shown to provide good agreement with simulation models. The analytical model for RTNR networks uses an Erlang fixed point method to solve the nonlinear equations describing dynamical network behavior. The equations include the link state probability, network flows, link arrival rates, adaptive trunk reservation level, and adaptive path selection depth. The link state model provides the aggregate link state probabilities through solution of the birth-death equations, and models the adaptive nature of trunk reservation. The network flow model provides a method to calculate the traffic flow using the least busy concept employed in RTNR, and also models the adaptive nature of the path selection depth. The analytical model addresses asymmetrical networks, and computational examples show the differences from the simulation model to be small. The authors also use the analytical model to examine key RTNR parameters over a range of values.>
Gerald R. Ash, Baosheng D. Huang
IEEE Trans. Commun.1
1991 Robust Traffic Design for Dynamic Routing Networks
abstract
The authors present traffic restoration design algorithms to attain a robust network for any facility link or node failure. Some of these algorithms were implemented on network models to compute the cost for doing traffic restoration for different traffic restoration level objectives. From their simulation studies, the authors found that with efficient use of trunk group diversity and at a reasonable incremental cost, one can obtain a robust network to respond to a major facility link or a node failure and still meet the network objectives. A similar approach based on the algorithms presented in this work has been proposed for design of the worldwide intelligent network.>
Gerald R. Ash, Fu Chang, Deep Medhi
INFOCOM1
1990 Robust Design for Switched Digital Services in a Worldwide Intelligent Network
Arik N. Kashper, Steven S. Katz, Gerald R. Ash
Comput. Networks ISDN Syst.3
1989 Robust design and planning of a worldwide intelligent network
abstract
The authors describe the structure of the worldwide intelligent network (WIN), describe methods for its design and planning, investigate the adequacy of decentralized control for problem-free worldwide call completion, explore the feasibility of adaptive routing and control concepts, discuss network robustness/reliability objectives, and describe a strategy for achieving these objectives for all cooperating international carriers. Several decentralized adaptive routing policies that are particularly attractive in the WIN environment and network performance improvements that can be achieved with the introduction of flexible routing capabilities are characterized. It is shown by example that network integration coupled with flexible routing and bandwidth allocation for preferential treatment of new services provides an effective approach for robust and economical new service provisioning.>
Gerald R. Ash, Prosper Chemouil, Arik N. Kashper, Steven S. Katz, Katsuyuki Yamazaki, Yu Watanabe
IEEE J. Sel. Areas Commun.1