Richard G. Ogier

According to our database1, Richard G. Ogier authored at least 16 papers between 1981 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Use of OSPF-MDR in Single-Hop Broadcast Networks.
RFC, October, 2013

2009
Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding.
RFC, August, 2009

2008
OSPF Database Exchange Summary List Optimization.
RFC, May, 2008

2004
Topology Dissemination Based on Reverse-Path Forwarding (TBRPF).
RFC, February, 2004

1999
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1996
Neural Network Methods with Traffic Descriptor Compression for Call Admission Control.
Proceedings of the Proceedings IEEE INFOCOM '96, 1996

1993
Distributed algorithms for computing shortest pairs of disjoint paths.
IEEE Trans. Inf. Theory, 1993

Extract Maximum Information from Event-Driven Topology Updates.
Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

Robust Routing for Minimum Worst-Case Expected Delay in Unreliable Networks.
Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

1992
Minimum-Expected-Delay Alternate Routing.
Proceedings of the Proceedings IEEE INFOCOM '92, 1992

1991
Fair Charging Policies and Minimum-Expected-Cost Routing in Internets with Packet Loss.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1989
A Distributed Algorithm for Finding Shortest Pairs of Disjoint Paths.
Proceedings of the Proceedings IEEE INFOCOM '89, 1989

1988
Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities.
Networks, 1988

1985
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)
PhD thesis, 1985

1984
Optimal dynamic routing in communication networks with continuous traffic.
Networks, 1984

1981
Recursive linear smoothing of two-dimensional random fields.
IEEE Trans. Inf. Theory, 1981


  Loading...