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

Thomas Raleigh

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

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

Computer networks · 3

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
Cellular and mobile networks · 48% Optical networks · 24% Internet architecture and protocols · 21%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobile networks › mobile network architecture › mobile core network
location register
0.011999
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers · INFOCOM 1999
Cellular and mobile networks › mobility management
Mobile IP
0.011999
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers · INFOCOM 1999
Optical networks
network survivability
0.011999
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers · INFOCOM 1999
Internet architecture and protocols
protocol design
0.011998
Protocol boosters · IEEE J. Sel. Areas Commun. 1998
Distributed systems
fault tolerance
0.011999
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers · INFOCOM 1999
Distributed systems › replication › replica control
quorum consensus
0.011999
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers · INFOCOM 1999
Distributed systems
replication
0.011999
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers · INFOCOM 1999
Transport protocols and congestion control
error control
0.011998
Protocol boosters · IEEE J. Sel. Areas Commun. 1998

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

triangle lattice · 0.0quorum consensus · 0.0optimistic protocol · 0.0
YearPublicationVenuePosition
1999 Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers
abstract
The mobile IP (MIP) protocol for IP version 4 provides continuous Internet connectivity to mobile hosts. However, currently it has some drawbacks in the areas of survivability, performance, interoperability with protocols for providing QoS. We have proposed an alternative protocol, mobile IP with location registers (MIP-LR), which overcomes some of these drawbacks and is closer to the "service node" database approach used in the public switched telephone network (PSTN): before launching a packet to the mobile host, the sender first queries a database, called the home location register (HLR), to obtain the recipient's current location. MIP-LR is designed for operation in enterprise environments or within logical administrative domains. We focus on showing how MIP-LR enhances the survivability of MIP by eliminating some of the functions which MIP introduces for mobility support, allowing the HLR to be placed outside the mobile's home network in case the latter is particularly vulnerable, and replicating and distributing HLRs. We present two schemes for managing the multiple HLRs and enabling mobile and correspondent hosts to dynamically discover the addresses of the HLRs serving a given mobile host. The first scheme introduces a set of translation server (TS) databases while the second uses a form of quorum consensus based on the triangle lattice (TL); for the latter we present an enhanced protocol called the optimistic TL(OTL). For both schemes we present algorithms for mobile host registration and packet delivery, protocols for recovery from HLR failures, and complexity analysis of the overhead involved.
Ravi Jain, Thomas Raleigh, Danny Yang, Li-Fung Chang, Charles Graff, Michael Bereschinsky, Mitesh P. Patel
INFOCOM2
1998 Mobile Internet access and QoS guarantees using mobile IP and RSVP with location registers
abstract
The mobile IP (MIP) protocol for IP version 4 as being standardized by the Internet community provides continuous Internet connectivity to mobile hosts, without requiring any changes to existing routers and higher-layer applications. We propose an alternative protocol, mobile IP with location registers (MIP-LR) which is closer to the "service node" database approach used in the public switched telephone network (PSTN): before launching a packet to the mobile host, the sender first queries a database to obtain the recipient's current location. MIP-LR is designed for operation in enterprise environments or within logical administrative domains, as it requires a sending host to be aware of which hosts are potentially mobile and implement the MIP-LR protocol. The benefits of MIP-LR are that potentially long routes, called "triangle routes", from the sender to the mobile host are avoided, encapsulation of packets sent to a mobile host is not required, the load on the home network as well as the home and foreign agents is reduced, and there is substantially improved interoperability with protocols such as RSVP for providing QoS guarantees. We carry out a simplified average-case analysis of the costs and benefits of MIP-LR and show it can result in significant reductions in mean network costs compared to MIP.
Ravi Jain, Thomas Raleigh, Charles Graff, Michael Bereschinsky
ICC2
1998 Protocol boosters
abstract
This paper describes a new methodology for protocol design, using incremental construction of the protocol from elements called "protocol boosters" on an as-needed basis. Protocol boosters allow: (1) dynamic protocol customization to heterogeneous environments and (2) rapid protocol evolution. Unlike alternative adaptation approaches, such as link layer, conversion, and termination protocols, protocol boosters are both robust (end-to-end protocol messages are not modified) and efficient (do not replicate the functionality of the end-to-end protocol). We give examples of error and congestion control boosters, and give initial results from booster implementations.
David C. Feldmeier, Tony McAuley, Jonathan M. Smith, Deborah S. Bakin, William S. Marcus, Thomas Raleigh
IEEE J. Sel. Areas Commun.6