default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard G. Ogier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[i4]Richard G. Ogier:
Use of OSPF-MDR in Single-Hop Broadcast Networks. RFC 7038: 1-7 (2013)
2000 – 2009
- 2009
- [i3]Richard G. Ogier, Phillip A. Spagnolo:
Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding. RFC 5614: 1-71 (2009) - 2008
- [i2]Richard G. Ogier:
OSPF Database Exchange Summary List Optimization. RFC 5243: 1-5 (2008) - 2004
- [i1]Richard G. Ogier, Fred L. Templin, Mark G. Lewis:
Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). RFC 3684: 1-46 (2004)
1990 – 1999
- 1999
- [c7]Bhargav R. Bellur, Richard G. Ogier:
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks. INFOCOM 1999: 178-186 - 1996
- [c6]Richard G. Ogier, Nina Taft Plotkin, Irfan Khan:
Neural Network Methods with Traffic Descriptor Compression for Call Admission Control. INFOCOM 1996: 768-776 - 1993
- [j4]Richard G. Ogier, Vladislav Rutenburg, Nachum Shacham:
Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Trans. Inf. Theory 39(2): 443-455 (1993) - [c5]Richard G. Ogier, Vladislav Rutenburg:
Robust Routing for Minimum Worst-Case Expected Delay in Unreliable Networks. INFOCOM 1993: 338-346 - [c4]Vladislav Rutenburg, Richard G. Ogier:
Extract Maximum Information from Event-Driven Topology Updates. INFOCOM 1993: 1004-1013 - 1992
- [c3]Richard G. Ogier, Vladislav Rutenburg:
Minimum-Expected-Delay Alternate Routing. INFOCOM 1992: 617-625 - 1991
- [c2]Vladislav Rutenburg, Richard G. Ogier:
Fair Charging Policies and Minimum-Expected-Cost Routing in Internets with Packet Loss. INFOCOM 1991: 279-288
1980 – 1989
- 1989
- [c1]Richard G. Ogier, Nachum Shacham:
A Distributed Algorithm for Finding Shortest Pairs of Disjoint Paths. INFOCOM 1989: 173-182 - 1988
- [j3]Richard G. Ogier:
Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities. Networks 18(4): 303-318 (1988) - 1985
- [b1]Richard G. Ogier:
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut). University of Illinois Urbana-Champaign, USA, 1985 - 1984
- [j2]Bruce E. Hajek, Richard G. Ogier:
Optimal dynamic routing in communication networks with continuous traffic. Networks 14(3): 457-487 (1984) - 1981
- [j1]Richard G. Ogier, Eugene Wong:
Recursive linear smoothing of two-dimensional random fields. IEEE Trans. Inf. Theory 27(1): 77-83 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
