JP2003527008A - Dual tree hierarchical communication system and method - Google Patents

Abstract

Abstract: A method and system for improving a registration process in a communication system, preferably an all-IP communication system, wherein a set of location registration (LR) nodes is designed to handle mobile registration locally. You. When the mobile node registers with the home network from another regional network, a location registration chain is established through these nodes. The information needed for mobile nodes to access the network is distributed from the home network to these nodes. As the mobile node roams into a different visited network or returns to its home network, neighboring location registration nodes process the mobile registration and update the location chain accordingly.

Description

Description FIELD OF THE INVENTION [0001] The present invention relates generally to communication systems, and more particularly, to all-IP communication systems.
Improved methods and systems to improve the registration process in
. BACKGROUND OF THE INVENTION A universal personal communication system is where everyone is anywhere in the world
A system that allows you to communicate with people. One of the problems with this system is
To efficiently locate millions of moving customers. Moving within the system
Existing methods of locating customers to move are paging and central databases.
The registration to use. Huge number of customers in global systems
Given this, this first method is not practical even if used without knowing the location of the customer. During ~
Registration methods that record all customer movements in a central database are also impractical. [0003] Global roaming is the development of next-generation or third-generation (3G) cellular networks.
It is one of the total goals. Real-time services for mobile users within this network
Signaling and payloads to support IM applications efficiently
-Traffic delay must be minimized. One of the causes of long delays
One is known to be triangle routing. That is,
For example, during the registration process, each time a mobile node places a call, or
If the network roams to a different visiting network, the registration request
All the way from agents in other areas of the network to the home network
Must be sent. Triangulation is also used during the call setup process.
Shin has been identified as a cause of long delays. In a mobile IP network as specified in RFC2002, a home agent
Function as both a centralized location directory and a tunneling endpoint.
Therefore, all packets addressed to the mobile node
, Then encapsulated and sent to the corresponding other regional agent
Must. This method is commonly used for triangular delivery or tromboning.
). This method does not use network resources efficiently, and
One of the major obstacles to IP networks supporting system applications
Has become. [0005] Regional Tunnel Management is a system for registering signals.
In order to eliminate corner distribution, hierarchical multi-region agent
The architecture was introduced. However, regional tunnel management becomes a 3G cellular network
There are several issues with adoption. The problem is that home and other
In the main, the system architecture is not homogeneous;
Triangular distribution; inability to accommodate personal mobility (compared to device);
And the deregistration process is not fixed; mobile node significantly increases registration process
May be involved. [0006] The proposed Universal Mobile IP (UMIP) technology is
Designed for teen (3G) cellular networks. This is real-time and non-
Multiple heterogeneous wireless access networks for real-time applications
To provide comprehensive mobility services to workers with global coverage
Things. The proposed technology points to RFC 2002, a special case of UMIP.
Adds functionality to the mobile IP criteria defined and is compatible with it retroactively. Regional G
Channel management is also a special case of UMIP. As a result, the time required for call setup and payload delivery is reduced.
There is a need for a method and system for reducing. The present invention relates to a mobile station's visited domain.
Signaling and payoff through a distributed hierarchical architecture in both the home domain
We propose to eliminate triangulation in both network traffic. DETAILED DESCRIPTION OF THE INVENTION Acronyms are used for convenience with reference to the drawings and the entire specification. The following are used
Here is a list of acronyms. [0009] Bluetooth (Bluetooth) is a mobile PC, mobile
Small-factor, low-cost short-range wireless links between phones and other portable devices
Is the code name for the technical specification for Bluetooth Special Interest Group
To develop and market this technology in telecommunications and computer businesses
An industrial group of leaders in the industry. B Bit Busy BRAN Broadband Radio Access Network
rk) BTS Base Transceiver Station CN Core IP-based Network Current ID ID of LR that mobile node successfully registered (NAI) DECT Digital European cordless telephone
Telephone) DNS Domain Name Server F Bit Other regional agent FA Other regional agent FD Other regional domain. Home where the mobile node subscribes to network services
• Coverage area outside the domain H Bit Home Agent HA Home Agent Home ID Home ID The home LR where the MN subscribes to network services.
Mobile Node ID (NAI) assigned Home Network MN subscribes to network services
Home LR coverage area HD home domain. A home where the mobile node subscribes to network services.
The entire area covered by the top layer LR including the system subtree IR intelligent routing (Intelligent Routing) IrDA Infrared Data Association Location chain Location chain Distribution path between the current LR of the MN and its home LR
Sequence of location pointers in the LR that forms the location pointer (Location Pointer) Outgoing packet is addressed to the mobile user
LR IP address LR Location register or location register. IP network to handle mobility management
Network elements within the network MIN Mobile Node Identification Number MN Mobile Node NAI Network Access Identifier Network elements including NE LR, RNN New ID New mobile user Discovered and sent a Universal Registration Request message
RL ID (NAI) PDSN Packet Data Service Node RAN Radio Access Network RNN Radio Network Node (R) for voice / data applications
adio Network Node) RNS Radio Network Subsystem RT Regional Tunnel UMIP Universal Mobile IP VHE Virtual Home Environment AA: Mobile IP Agent Advertisement Message (Mobile IP Ag
ent Advertisement message) Authen: Authentication Cch (i): Current address of MN and home address (NAI) in layer i or higher
True if same Ccn * (i): True if layer i processing node is on current branch Chn * (i): True if layer i processing node is on home branch Cnc (i): New address and current address of MN (NAI) is the same in layer i and above
Kishin Cnh (i): New address of MN and home address (NAI) in layer i or higher
True if same Cnn * (i): True if layer i processing node is on new branch CRN: Current root node; root of tree registered by MN
DR: De-registration FL: Forward link address conveyed in the message FRN: Foreign root node;
HB: Home branch; Home branch; branch connecting MN's home LR to HRN
Lunch HRN: Home root node; MN subscribes to service
Root node of tree I: Top layer of LR node in UMIP hierarchy i: [1, I] representing layer of RL node LRh (i): Location register of layer i on home branch LRn (i): Position register of layer i on new branch LT: Lifetime LTR: Lifetime Update Request n *: Node processing message NACK: Negative acknowledgment NRN: New root node (New root) node) PTR: Pointer indicating the next LR in the chain toward MN Rch: Index [0, I identifying the layer where the current branch and the home branch are branched
Rnc: Index [0, I] for identifying a layer where the new branch and the current branch are branched Rnh: Index [0, I] for identifying a layer where the new branch and the home branch are branched
RN: Root node RR FL: FL conveyed in registration request message TA: Target address of message to be sent A simplified 3G wireless network architecture is shown in FIG. Figure
As shown, the architecture has two separate network portions. Part 1
Minutes are radio access networks (RANs), zones, paging areas or
Wireless network nodes (RNNs) involved in coverage areas such as distribution areas
)including. The second part of the system is the core network (CN),
Enables integrated mobility for all of the underlying heterogeneous RANs. FIG. 2 illustrates a UMIP system architecture with four layers of location registers (LR).
Show. The RNN is the lowest LR in the hierarchy (ie, L1 LR). In the preferred embodiment
In addition, a unique NAI or IP address identifies the LR in the hierarchy. Different wires
System has its own network components, equivalent to an RNN
. For example, the Radio Network Subsystem (RNS)
Are equivalent components of. RNN supports voice and / or data applications.
Responsible for both. Each RNN is identified by one location ID and under its control
Shared by a number of base transceiver stations (BTS). RNN is the mobile node (MN)
And has a link layer connection (eg, common control channel or equivalent)
It is assumed that RNN addresses all wireless connectivity and fine mobility management (if any) issues
. The core network (CN) is WCDMA, CDMA2000, GSM, IS-95, DECT, BRAN (
Broadband wireless access network), BLUETOOTH, IrDA and other future
It can respond to multiple wireless connection technologies such as technical technologies. For example, CDMA users
Wants to talk directly to a GSM cellular user simply by dialing the called party ID
is there. The proposed solution is to callee location with the help of a distributed LR database
Can be specified, and an appropriate connection can be made to the called party. As a by-product of UMIP,
Network-to-network interface (NNI) is RAN-CN
Interface, thereby reducing CN reuse and mobility management.
Maximize system integration. RAN-CN interface for management functions such as mobility management
The faces are marked "M interface" in FIG. About RAN
Whatever technology is incorporated, in the preferred embodiment, the RAN-CN interface
The base must be IP compliant. [0013] The mobility management is realized in an LR (location register). As another regional agent
LR not only responds to registration requests to the home agent,
Maintain and update the mobility database. LR is organized in a multi-tier architecture
(The largest layer i is 4 in FIG. 2). Tier indicators are from bottom to top of the architecture
Are assigned in ascending order. The number of layers in different subtrees (domains)
Not necessarily the same. Each LR has zero or more child LRs in the next lower layer.
Each LR has zero (called the root LR) or one direct parent LR. Everything
All root LRs can communicate with each other and can be located across multiple domains.
It is assumed that a chain can be formed. Each LR is a logical coverage area
Related to. The total coverage area of the lower LR is the coverage area of its parent LR.
Must be an appropriate subset of. In other words, the logical boundaries of the higher layer LR
Must not cross the boundaries of its child LR. The behavior of each LR depends on the layer in which it is located. Wireless interface to MN
Only LRs that have a face need to notify the MN of their existence (advertisement).
You. An LR at a particular layer has an opposing child LR and an interface to the RAN.
Note that you can do that. The root LR in one hierarchy is the root LR in another hierarchy.
Interface with a remote node. [0015] In addition to the IP address, all functional components (ie, LR, RNN and MN)
Is identified by its globally unique identifier. In the preferred embodiment
, NAI (Network Connection Identifier) is used as a globally unique identifier
You. However, without departing from the spirit and scope of the invention, other globally unique
One skilled in the art will appreciate that identifiers can be used. [0016] In a preferred embodiment, the allocation of NAIs to obtain an efficient system solution
Obeys the following rules. That is, mobile users are identified by their NAI
. This provides an opportunity for UMIP to address personal mobility. Bottom layer LR
The NAI, not the IP address, of the current, new or
It is used as a frame position identifier. LR's NAI is the current, new
Or, by comparing the home identifier, the LR at any layer can make a distribution decision.
Must be assigned so that The full specification of the NAI assignment is outside the scope of the present invention. However, as an execution method
Lower NAIs for higher tier components
The NAI assigned to the lower-level child component is a suffix of the NAI. Was
For example, the LR of layer 1 has a NAI of "123.Arlington_Heights.Chicago.IL_US@abc"
I have it. Layer 2 LR is NAI "Arlington_Heights.Chicago.IL_US@abc"
Having. The LR in layer 3 has a NAI of "Chicago.IL_US@abc". Finally, layer 1
Mobile users registered in the LR are listed in “4567.123.Arlington_Heights.Chicago.IL_US@a
bc ”. NAI is an NA for which all numeric numbers (such as telephone numbers) are valid
Note that it is defined in a versatile way, such as I. Also, everything
All existing IP, IMSI and MIN address methods can be treated as valid NAI. Sa
In addition, the NAI of all network components, including LR and mobile users, is scalable.
It can be reassigned taking into account. The proposed solution is permanently assigned
It works for mobile users with different NAIs. However, reassignable NAIs are preferred
No. Efficiency in NAI allocation is the focus of realization. UMIP is pre-assigned
The assigned NAI also corresponds to the reassigned NAI. Referring to FIG. 3, each LR has an LR table for storing and distributing MN location information.
There is. In a preferred embodiment, and under the following conditions, the LR
One component is created and maintained in the table. At this time, the mobile user
Is outside its registered home network and LR is on the location chain
. The location chain starts with the lowest LR of mobile users in its home domain.
, Ending in the lowest LR of the visited network. In the preferred embodiment, the LR tape
If no component is found in the mobile node, the mobile node joins its home network.
It is assumed that there is. As seen in FIG. 3, in the preferred embodiment, the LR table has at least
There are five components. These are the indicator, pointer, pointer status, validity period
And playback protection, each of which is described below. First of LR table
The column is an indication index, which is the mobile user's home NAI. This is registered by LR
It is used to search for mobile information and call connections for processing location updates. Offer
Possible solutions include a mobile user identifier (NAI) and a distributable IP address.
There must be a mechanism for mapping. This mapping function is LR
Executed in The second column is the position pointer of the mobile user. Mobile user
Location pointer is the IP address of the LR where the LR sends outgoing packets to that mobile user.
is there. The third column is the status of the position pointer for the mobile user. Preferably,
There are at least three types of situations. That is, pending, active, and ongoing
. The entry for the mobile user is entered by the LR into the universal registration initiated by the mobile user.
After receiving a recording request and before receiving a positive response (authentication), the
Attach. LR receives a positive universal registration response for the mobile user
After that, mark the entry "active". LR expires the relevant validity period
Before an authorized deregistration message with a forwarding address is received
Marks the entry "in progress". The fourth column of LR is the validity period. All three types of pointer status of LR are valid
Time (in seconds). Assigned to an entry with a status of “in progress”
The validity period is reasonable to prevent a large number of entries from accumulating in the LR table.
Must be as short as possible. UMIP is the M of binding information
To request an extension of the validity of N, a validity renewal must be performed.
The validity period renewal can be by any LR on the MN location chain or its home LR.
Or it can be sent by MN. Before the expiration of the validity period
In order to respond to the request, the validity period update request generated by the MN is
Must be sent on the path to the work. LR is based on outdated information
Do not make any decisions. The fifth column is the type of playback protection in use. Receiving
If the received universal registration request requires a playback protection type not supported by the LR,
If it contains a raw protection extension, the LR will reject the universal registration request and
In the code field set to supported (UNSUPPORTED_REPLAY_PROTECTION)
A universal registration response must be sent with the value. The MN registers with a universal registration in parallel with the normal registration on its home network.
Performing the recording, the MN has one replay protection mechanism and sequence for the LR,
Different mechanisms and sequences for HA must be maintained. Rehabilitation
For protection, the use of nonces allows universal registration request / response messages.
The identification field in the message is used. The sender of the message is the identification field
The higher 32 bits of the next Universal Registration Request / Sent to this LR node.
The response is required to set the value of the nonce used by the LR. Identification field low
The next 32 bits must be set to the nonce value used for this message.
Can be Thus, in each message, the LR is the next number used for the target LR.
To communicate the value of the If no messages are lost in the network,
The target LR may remain synchronized with respect to the nonce used. However
When the target LR receives a message that appears to be an incorrect nonce,
-Re-synchronization with LR may occur by using a monkey registration request. For example, as shown in FIG. 4, if the current location of the MN is LR2122,
1121 (home network) to LR112, and LR11, LR1, LR2, LR
Position chain setup up to 21, LR212 and finally to LR2122
Is made. The layer i LR does not maintain location information for at least the following three types of mobile users:
I have to. (1) Visitor: Registered outside the LR coverage area
(That is, subscribed to the service) and log in the coverage area of the LR.
Mobile user during the game. (2) Native Local Rome: LR Cabaret
Is registered in the same area, but is currently different from the registered one in layer i-1.
Mobile users located in the valley area. (3) Native Traveler: Kabale
Outside the coverage area of the LR of the relevant layer i.
Mobile user to be mobile. For example, as shown in FIG.
1 is subscribed to the service. When this user registers in LR2122
In this case, it is a visitor for LR2122, LR212, LR21 and LR2. LR1
When registering for 111, it is a native local Rome for LR11
. When registering with an LR having a route other than LR1, LR1121, LR112, LR1
1 and LR1 are native travelers. If the mobile user
Tier i LR for the mobile user as long as it stays within the
No location information is required inside. Considering the local mobile behavior of mobile users
This significantly increases the memory size, search delay, and thus the complexity and cost of LR
It is reduced. To accommodate heterogeneous RAN methods in the proposed solution, agent agents
Must be able to implement data on multiple layers of the hierarchy.
No. For example, a cellular distribution area is tied to a layer 1 network component and
The star cell is associated with the layer 2 LR, and so on. Layer i (eg, i = 1) network
Of the application are related to mobile users of application J (eg, cellular).
Must announce its presence via the Agent Advertisement Message
Must. At this time, the lowest coverage area of application J is layer i
Involves with the coverage area. Local system supports regional tunnel management
To distinguish between sponsored and unsupported, the agent advertisement
Preferably, the message has an "RT" flag. This flag is
When a col is used in a radio transmission medium, it is inserted into one of the reserved fields.
You. Another flag is “IR” indicating whether or not to support intelligent distribution.
. If the global challenge is realized by the system, consider the safety
, Must be regularly included in the agent advertisement message
Absent. The LR IP address (handling address) of layer i and its NAI are
Notified in the advertisement message. When using IP as a radio wave transmission medium
The LR NAI extension after the given advertisement extension.
Must be included in the advertisement message. The agent advertisement message includes a plurality of handling addresses and NAs.
I have. The first service address and NAI must be of layer iLR.
The lowest LR continues to send agent advertisements and has already
For mobile nodes registered with it, they have not moved out of the region
And that the network components have not failed.
No. Network components are included in the agent advertisement.
By setting the "B" bit, "busy" to register a new mobile node
"". Agent advertisement message is "F"
If the bit is not set, the "B" bit shall not be included and the "F" bit
Advertisements that send at least one of the "H" bits
Must be set for all comment messages. [0028] The advertising network component may support the UMIP by:
Must include the NAI in the agent advertisement message
No. If present, the NAI extension of the network element will be
After the advertisement extension in the agent advertisement message.
I have to. The NAI domain part of the network element and its own NAI
By comparing the domain part with the mobile node,
Or in the visiting domain, and the domain since the last registration
It can be determined whether or not it has been changed. In the layers above the lowest layer iLR and related applications, the effective user
As soon as the universal registration message is received, an additional extension is added to the message.
Will be added. These are not inclusive and new addresses (NAIs)
At the bottom level of the Considering intelligent distribution, hierarchical LR
Extension (layer i (above the bottom layer of the application) LR NAI and its IP address)
It may be added to the message. When the power is turned on, the LR NAI of the layer i stored at the beginning of the MN (functions as the current ID)
) Must be its own MN NAI. MN is responsible for the handling address or LR.
Other local indicators adopted by the associated RAN may be registered. Newly discovered
Note that the layer i LR that is created may be its own home LR (HA). Assigning a plurality of addresses to one mobile user for each different application
I can do it. The active account is included in the combined universal registration request message.
An extension is defined to convey the application address. Universal
Upon receiving the multiple address extension from the registration request, the LR sends that information to the mobile node.
Must be stored as part of the associated mobile user profile. This information
Must be accessible from the LR table of the LR. The RAN builds all the MN movement detection mechanisms employed by the RAN system
Can be One preferred example of the MN movement detection mechanism is described below. UM
In IP, MN does not require knowledge of core network architecture
To transmit this type of information on a band-limited wireless channel on a regular basis.
No need. Involving the MN from a registration point of view is the lowest layer of application
It only monitors the NAI of the LR common control channel. For movement detection, common
/ When using IP on a dedicated control channel or using IP on a radio communication medium,
Use the LR NAI sent in the Gent Advertisement message. M
N is fixed to the identified LR (the details of the LR identification process are outside the scope of the present invention.
), Must track the LR NAI extension from all received advertisements
No. If the received NAI changes, the mobile node shall assume that it has moved.
I have to. For example, the MN of an application J of a certain mobile user is in layer i
Agent advertisement received from LR at the bottom of Application J
The new tier i LR coverage area (paging area, delivery
Rear, zone, etc.). Agent Advertise
If the MN indicates that it corresponds to a universal registration, the MN will
Open the registration process by sending a universal registration request to the viewed layer iLR.
Have to start. How to handle user authentication with global challenges
Responds to the Global Challenge with a Universal Registration Request message
Must be included as part of the Upon receipt of the authorized universal registration request, the LR sends the universal registration request
The IP address of the sent network element must be registered. Related information
Information must be stored and indexed by the mobile user's NAI. This includes moving
Includes the user's NAI, status and validity period. The status is marked as "pending"
Attached. If the LR does not have the credentials, it sends a universal registration request to the MN's home
・ Relay to the next LR on the route to the network. And finally home LR
Reach and authenticate. The LR will recognize if the request contains all sensitive information.
Testify. Upon successful authentication, the situation is marked "active". Registration response
A message is also generated and sent along the location chain towards the mobile node.
The registration response message contains the user profile (to support VHE) and confidential information.
Information (to support mobile user authentication) and other information such as billing information. Upon receiving the registration response message, the LR authorizes the message and “pending”
You need to check if the entry already exists. The response indicates that the registration request
Once notified, the status of the mobile user entry will say "Active
Is marked. Next, the LR sends the response message to the next LR on the route to the MN.
Transfer to In the registration update path, each LR except the lowest LR includes a hierarchical LR extension in the registration message.
Add a child. This information is communicated to the downstream LR (via the location update chain)
Used to update the table. Also used for further distribution optimization
There is also. Universal registration requests in the core network may include one or more hierarchical LR extensions.
There is a papier-mache. When these extensions are added to the registration request by the LR,
The LR sends the universal registration request from there as a location pointer for the mobile user.
Using the received LR IP address, set a pending registration record for the mobile user.
Set. A new extension is generated and the extension is included as part of the registration message.
It must end with all extensions included in the upstream LR. Multiple floors
If the layer LR extension is not realized, the receiving LR transmits the layer LR extension its own information.
Replace with an extension. The hierarchical LR extension is used in the upward update path (from layer i to layer i + 1).
Only should be added. Extension of higher layer when multi-layer LR extension is built
The child should be added after the lower layer extension. The hierarchical LR extension is E. Gusta
fsson, A. Jonsson and C. Perkins, Mobile IP Regional Tunnel Management
Is defined with the following modifications. Collectively,
The LR network is open to all mobile users outside the registered network (HA)
It must be possible to establish a position chain for Position
The chain must start at the lowest home LR and end at the mobile user's current location.
No. All pointers in the location chain are distributable IP addresses. Rank
Each link in the placement chain is the next highest layer, next to the same domain (subtree)
Refers to the LR of the layer, or if the LR is the root LR itself, the
May refer to LR. Pointers can be any other LR (or
May also refer to network components). Universal registration request sent
Whenever done, the timer is set. Retry or registration failure when timer expires
The message is sent to the appropriate party (if N> = failure retries). Such as dealing with global mobility management and real-time applications
It is very important to have a fully distributed location update process in
It is desirable. As soon as the location register receives the universal registration request, it
Make the final step of the journey. If not the last, universal registration
Determine the next step for the message. All mobility management message delivery decisions
In the preferred embodiment, the mobile user identifier (NAI), the previous LR and the current LR
Must be based on The deregistration process should not involve the mobile node directly. Unregister
The process should be part of a mobile user initiated location update process and the LR
Performed by network collaboration. The new position of the mobile node on the location chain related to the current location of the mobile user's MN
All LRs that are no longer in the location chain involved in the
Must be notified and the database updated accordingly. Upon approving the received de-registration message, the LR sends the mobile user in a “transferring” status.
Update the associated data entry to indicate the user's new location (IP address). Transfer port
The intercom, for example, places the incoming packet of the roaming mobile user in its new location.
Help transfer. The transfer pointer is valid until its validity period has expired.
You. Upon expiration, the relevant entry is removed from the LR database. This
All information of the mobile user, such as the user's confidential data, user profile, etc.
Are also removed from the LR database. For example, as shown in FIG. 4, a mobile subscriber may register his registered home address (
(NAI) is assigned to the LR 1121. The mobile node is LR1121
, There is no location information in the LR hierarchy. this is
By default, if no location information is available in the LR, the mobile user is at home
It is assumed that Next, the mobile node determines the coverage area of the LR2122.
Suppose you are trying to register in a. The location chain starts from the home LR and LR
It is set to end at 2122. There are several ways to set up a location chain
There are possible ways. One possibility is the following method. Pointers include:
Each LR (except the top layer) in the mobile user's home domain, then the next higher layer LR
IP address is included. For example, LR1121 has a pointer to LR112.
It exists. The top LR of the mobile user's home domain contains
There is a pointer to the main (LR2) root node. Other area of mobile user
Each main LR has a position pointer pointing to the next lower layer LR where the mobile user is located.
Exist. For example, the pointer in LR2 is the next move in the position chain to which LR21 is associated.
Order. LR21 has a pointer pointing to LR212. LR212 is
, LR2122, which have a link layer connection (eg, shared) to the MN.
Communication control channel). Another method is to bypass the LR of a certain layer. For example, MN Home
-The pointer of the related LR in the domain is set as the root node LR2 of the other regional domain.
Thus, the number of procedures can be reduced. For example, after the MN succeeds in registering with the LR 2122, the MN moves to a different location area.
Moves to the coverage area of the LR 2121, and then sends a registration message to the LR 2121.
There is no need to send all the way to 1121. In fact, half is fine. The required changes are LR
Update the related pointers of 212 and LR2122 and set a new pointer in LR2121.
Just specify. All these updates are performed locally. The location information is transmitted to the station in the LR of both the mobile user's home and other regional domains.
Locally available, and statistically the majority of traffic (incoming and outgoing)
Generated in these domains, the time delay and the associated
Reduced. For example, the home is the MN currently registered with LR2122 at LR1121.
The corresponding call is generated in the coverage area of the LR2121,
The location of the called party by local access to LR2122 and LR2122
. A communication system may be owned by more than one component. Therefore, the neighbor LR
Can be of two types. The first type of LR shares the same operating agency
Things. In this case, the same secret data is shared. The second type of LR has different behavior
It is in the writing agency. There is a mechanism between these LRs to help establish confidentiality.
There must be a way to do dense key management. A confidentiality relationship can work well between domains (sets) of LRs of different operators.
It is assumed that it is set up and can function. Also, confidentiality has already been
It is also assumed that it has been set. In addition, LRs in different domains are compatible
Or at least one common type of encapsulation, compression mechanism, etc.
It is assumed that they must be dealt with. Confidentiality is not based on calls
Note, rather, that they are set on an operator basis. [0047] The MN-HA authentication extension is used when the MN performs universal registration.
Must be included as part of the recording request. LR requests universal registration
Received, will confirm the validity of the MN if there is a local copy of the MN-related sensitive data.
Admit. Update the location database accordingly and ensure that mobile users are locally authenticated.
The network component upstream (via the location update chain)
Acknowledge the new. Otherwise, there is no local copy of MN-related sensitive data.
Even rejecting the request (by ignoring the request or sending a NACK)
Ends in failure. If such sensitive data is not locally available, LR will register
Route the message to the mobile user's home network seeking authentication
Follow along to the next step. On the other hand, the newly updated position pointer
Time-limited until a positive response is received from the LR (via the location update chain)
It is marked as a "pending" stage with a validity period. Validity period related to this
Timeout or negative response to pending information about mobile user
Once received, the request is rejected and the associated data is discarded. The validity period involved
If a positive response is received before it expires, the associated location information is in a "pending" state
Are upgraded to "active" status, and the acknowledgment message is
Update chain). Authentication between LRs is performed with the help of an authentication extension. This is the base mobile IP
The same format and default algorithm as the three authentication extensions defined for
They share the requirements for supporting the rhythm, but are distinguished by their type. The value of the authenticator is
Secret, UDP payload (ie universal registration request or response message)
Sage), leaving all the above extensions as they are, and
The length of the byte, including the length, but not the authenticator field itself or the UDP header.
Calculated from the trim. This extension is used for all universal registration requests and
It is required to be used in response messages. The LR that handles location updates generates a universal registration response only under two conditions.
Does not succeed. The first condition is that there is an LR at the end of the transfer position update process.
You. An example of this is when the LR is the lowest LR in the mobile user's home domain.
It is. As another example, sensitive data of mobile users can be recognized and located within the system.
This is the case when it is not necessary to further propagate the update message. The second condition for generating a universal registration response is that the LR is pending migration from the downstream LR.
This is a case where a universal registration response for the user is received. Universal registration
The response is relayed to the upstream (via the location update chain) network component
. When a universal registration response message is generated, the downstream (mobile user
The LR will put the message in a hierarchical LR extension or LR table
A previously received universal registration request message is recorded as a pending pointer in
Deliver to the next upstream LR IP address, derived from the Sage's new address extension
I have to. The LR that initiates the universal registration response must send the appropriate sensitive data (
For example, a registration key or a challenge response vector) is distributed to the associated LR. For example,
LR is a mobile user key response extension added to the universal registration response message
Or use other AAA features. User profile extensions are also
-As part of the monkey registration response message. Sensitive data and you
Distribution of the profile information makes it locally available to visited networks
Noh. As a result, triangular distribution in the authentication and service provision process (
Reduces the time delay and associated time disturbance caused by tromboning)
I do. Movement-If the Local LR Authentication Extension is in the Universal Registration Request message,
The LR in the other regional domain performs the authentication. Similarly, the other region-home authentication extension is
If it is in the universal registration request message, the authentication is the visiting domain and home
-Executed between LRs in the domain. When everything goes smoothly, all of the universal registration request messages
The network element receives one and only one universal registration response.
I have to trust. When the LR generates or receives a Universal Registration Response,
A memory lookup function to determine where to relay a given message.
Run. The lowest LR of the visited network receives a successful universal registration response.
To the associated MN if received from the LR downstream (by the associated location chain)
A monkey registration response must be sent. [0053] The universal registration request / response message is located at the location from the viewpoint of encryption and confidentiality.
Note that some of the intervals on the update chain need to be recoded
No. For example, if there is a mobile user key response extension, the universal registration response
LR decrypts the confidential data. LR then (if necessary)
For example, add the new mobile user key response extension to the universal registration response message.
And then relay it to the next LR. New mobile user key response extension
, Secret and encrypted sensitive data shared between the LR and the LR for the next step in the hierarchy
Is included. This universal registration response relay process is performed in the lowest LR where the mobile user is located.
Iterate at each LR participating in the hierarchy until the message arrives. Bottom layer
When the LR receives the universal registration response, it performs a memory lookup function and
Relay the response to the mobile node. Existing IP encryption techniques are proposed for conveying sensitive data. Existing IP authentication
Technology (AAA and confidential extensions) proposed to address LR certification process
. Sensitive extensions are universal registration request and universal registration response messages
Part of. For example, if an LR receives a universal registration request from another LR,
Detects the authentication extension in the message using the mobility confidentiality shared with the sending LR.
Proof is required. Authentication extension for universal registration messages
Needed. Upon successful authentication, the location database is updated accordingly
. If not, a certification exclusion must be raised. Each mobile user location update triggered by a universal registration request has a maximum validity period
Involve in between. When sending a universal registration request message, the relevant LR
The validity period must be set to the remaining registration validity period. After that, the same transfer
The validity period must be renewed every time the location of the mobile user is updated. Valid registration solution
Since there is a elimination process, the lifetime parameter is used in terms of network bandwidth efficiency.
Therefore, it should be set to a reasonably large value. The billing function typically includes usage occurrence (column 1), usage aggregation (column 2), and billing (column 2).
Split between columns 3). In UMIP, usage generation and aggregation are combined. Combination
The function formed is distributed to the LR of the layer i (i = 1 in RAN, corresponding to L1 in FIG. 1).
. Alternatively, in CN, i = 2, which corresponds to L2 in FIG. 1). Network operator
Can determine whether this combined billing function is in the RAN or in the CN.
Wear. In addition to the basic subscriber and service information, each LR on the tier i location chain
, Contains the subscriber billing information normally maintained in the billing system (column 3). for example
LR will be granted access time, various levels of services provided and credit
/ Information on prepaid status. Since the transmission path flows between the LRs, the LRs generate traffic generated for a certain subscriber.
Record Subscriber traffic information is added to the subscriber billing information held in the LR.
The LR then generates a CDR (Call Detail Records), which is
Enables billing to be sent to a billing system. Billing system
Contains the information needed to generate the invoice, eg name, address, credit card number
, Billing address and telephone number. If the subscriber is in the visited network, the billing system for the visited
And send it to the subscriber's home billing system. This distributed billing method is a centralized method that collects usage information from all network elements.
There is no need for a simplified charging mediation device. This is the originating LR (eg, LR11 in FIG. 1).
21 or the LR 112). Also, network
Operators will also receive prepaid status information at the originating LR,
There is no need to develop a “prepaid service”. Sending subscriber interest in the network
Requires less communication resources for user data, and consequently user traffic.
More bandwidth can be used for traffic. The subscriber charging information at the visited LR is distributed to the LR together with the registration response message.
You. Conversely, the subscriber billing data is updated in the LR of the home network (for example,
For example, a change in the level of service provided) and the current LR with which the subscriber is registered
Sent to The subscriber accesses his / her own billing information stored in the currently registered local LR.
Can be accessed. The information available includes the level of service allowed and prior
Includes payment status. This local access allows subscribers to
You can check your billing status. FIG. 5 is a flow chart of a communication system operating according to an embodiment of the present invention upon receiving a registration request.
2 shows the reaction of LR in layer i> 1 in the system. Receiving a registration request in step 20
The LR authentication decision is made in step 22. If the LR is not authenticated, an authentication failure message
Message is sent to the sender location register in step 24 and the process stops.
. If the LR is authenticated, then in step 26, the processing node of layer i is the home node of i = 2.
A determination is made as to whether or not it is on a branch. If yes, a response is generated in step 28
And the flow proceeds to FIG. If not, flow proceeds to step 30 where entry
A determination is made as to whether is present. If yes, a response is created in step 28
, The flow proceeds to FIG. If no, flow proceeds to step 32, where the message
It is determined whether the node that processes the page is another regional root node. I
If yes, in step 34, the mobile node comes from another foreign domain
A determination is made as to whether the If yes, at step 36 a deregistration is sent
The transfer link address conveyed in the message is set equal to LRn (2).
, The target address of the sent message is set equal to the current root node. Next, in step 38, the transfer link address processes the message address
Target to send a registration request to the home root node equal to the serving node
The address is set equal to the home root node. Then, in step 40
And an entry with a pending status is created. Mobile node separates in step 34
If not, in step 38 the message address
Home root node with a forwarding link address equal to the node handling the
Target address is equal to the home root node in order to send a registration request to the
Is set. In step 32, the node that processes the message is
If not, flow proceeds to step 42, where the node processing the message
A determination is made as to whether or not it is on the system branch. If yes, submit a registration request
In step 46, the target address is the address of LR (i-1)
And an entry with a pending status is created at step 40. Stage 42
In, if the node that processes the message is not on the home branch,
In step 44, to send a registration request to the LR of the address LR (i + 1)
An entry is set at step 40 that is set equal to Thereafter, a determination is made whether a registration request with a transfer link address has been received,
Step 48 is performed. If yes, the next position in the chain towards the mobile node
The pointer to the register is equal to the transfer link address in step 54.
A registration request with a properly configured and forwarding link address is sent in step 56,
The process stops. In step 48, the registration request does not involve a forwarding link address
To the next location register in the chain towards the mobile node
The pointer is set equal to the IP address of the sender location register in step 50.
In step 52, the registration request is sent without the forwarding link address and
The process stops. The flowcharts of FIGS. 6 and 7 operate in accordance with an embodiment of the present invention upon receiving a registration response.
2 illustrates the response of the LR in a communication system. No generation response decision is made in step 28
Then, at step 72, a determination is made whether the mobile node is authenticated.
If not, an authentication failure response is sent to the sender's location register in step 74.
Sent and the process stops. If the mobile node is authenticated in step 72, step 76
Extracts the user profile. Then, in step 78, the mobile node
A determination is made as to whether or not it was on the home network. If yes, step 8
At 0, an entry is made and a pointer to the next position register in the chain
Equals the forwarding link address conveyed in the registration request message, or
Is set equal to the address of the sending side position register depending on the status of the pointer. next
, The target address message is set equal to the sender location register. afterwards
, The flow proceeds to step 81, block A of FIG. At step 78, the mobile node is home
If not, step 82 determines if the mobile node is currently at home.
Judgment is made. If yes, determine at step 84 whether to send a deregistration
Is made. If yes, at step 86, deregistration transfers equal to LRn (2)
Sent with the link address and the target address equals the address of LR (i + 1).
The validity period is set. After that, the validity period is set for RR,
In step 88, the response is sent to the home, and in step 90 the entry is deleted and the process
Stop. If it is not necessary to send a deregistration at step 84, then at step 92
A target address set equal to the address of the layer 1 location register on the branch
A deregistration will be sent with it. Thereafter, a validity period is set, and in step 88, a response is
The home is sent, the entry is deleted at step 90, and the process stops. If the mobile node is not home in step 82, a message is sent in step 94
A determination is made whether the node to be processed is in another regional domain. If yes
At step 96, a determination is made whether to send a deregistration. Place of Jesus
If the current pointer to the next position register in the chain is
A deregistration is sent with the target address set equal and the forwarding link address
The address is set equal to LRn (2) and the valid period is set. Then, in step 100
And set a pointer equal to the address of the sending side position register
Is set to equal the pointer, the entry is updated. After that, the flow
Proceed to block B in step 101 of FIG. If registration cancellation is not sent in step 96
, The flow proceeds to step 100 as described above. The node that processes the message goes to step 94
If it is not in the other regional domain at step 102,
A determination is made whether the node is on the home branch. If no, flow is above
The process proceeds to step 96 as shown in FIG. If yes, the mobile node is routed in step 104
It is determined whether to roam across nodes. In step 104,
If the node does not roam across the root node, step 106
A determination is made as to whether to send a rejection. If you send a deregistration,
Proceed to step 98 as described. If not, the flow proceeds to step 100 as described above.
No. In step 104, when the mobile node roams across the root node
Determines in step 108 whether the mobile node is currently in another regional domain.
It is. If yes, flow proceeds to step 109, block C of FIG. Mobile node
If roaming to another regional domain in step 108, a deregistration is sent and i
If = 1, the target address is set equal to the current pointer, otherwise
The target address is set equal to the address of parent LRi + 1. In addition, transfer link
The dress is set equal to the address of the parent LRi + 1, and the validity period is set. afterwards
, If i is greater than 2 in step 112, the transfer link address is
Page and the target address is the home branch LR.
Home update is set equal to the address of (i-1) and the validity period is set.
Will be sent to Thereafter, the flow stops at step 100 as described above. If the determination in step 108 is yes, in step 120, the mobile node
A determination is made as to whether to roam from the default. If yes, go to step 122
The target address is set equal to the current pointer and the transfer link address is
Set to the new branch's layer 2 location register (ie, LRn (2)) equal to
A time-delayed registration release message is sent. In step 120, if the mobile node is in another area
If not, send a deregistration and binding renewal at step 124
A determination is made as to whether or not it is. If yes, at step 126 the target address is
Pointer is set equal to the pointer, and the transfer link address is
A registration that is set equal to the register (ie LRn (2)) and has a validity period
Will be sent. The determination in step 124 may be that the deregistration and binding renewal are not sent.
If so, in step 130, the entry is updated to a pending status and the pointer is
Set equal to the forwarding link address carried in the registration request message. After the deregistration has been sent, flow proceeds to step 128 where the transfer link address
Is set equal to the forwarding link address conveyed in the registration request message,
Target address is set equal to the home branch LR (i-1) address and is valid
The binding update is sent to the home with the time period set. Then, step 130
In, the entry is updated to pending status and the pointer is
Set on hold by setting the pointer equal to the transmitted transport link
It is. At step 132, a determination is made whether to send a response to the home branch.
Done. If yes, at step 136, the target address is the next position in the chain.
Set equal to pointer to register. Thereafter, the flow of step 101
Proceed to block B and then to step 140 where the validity period is set and a response is sent
And the status is set to active. Then the process stops. Flow is stage 8
Proceeding to block A of step 1, at step 138, the target address is
Set equal to the Layer 1 location register (ie, LRh (1)) and the transfer link address
With the update set equal to the node that processes the message,
Is sent. Thereafter, the flow proceeds to step 140, where the validity period is set and the response is
Sent and the status of the entry is set to active. FIG. 8 is a flowchart illustrating a communication system operating according to an embodiment of the present invention when a registration response is received.
3 shows the reaction of LR in the case of the layer i> 1. When i is greater than 1, in step 150
When the location register of layer i receives the registration response, the LR authentication decision is made at step 152
Be executed. If not, at step 154, a message indicating authentication failure is responded.
The answer is sent to the location register that sent the answer and the process stops. If authenticated in step 152, in step 156 a message processing no
A determination is made whether the node is on the home branch. Not on home branch
If so, at step 158 the target address is set equal to the pointer. Step 156
And if the node processing the message is in the home branch, step 162
Then, it is determined whether or not to send along the home branch. If no
Flow proceeds to step 158 as described above, where the target address is set equal to the pointer.
It is. If the decision in step 162 is to send along the home branch
For example, in step 164, the target address is set equal to the address of the parent LR (i + 1).
Is done. Once the target address has been set, a positive determination is made in step 160.
You. If the response in step 160 is positive, in step 166, the status is set to active
, The validity period is updated. Then, at step 168, a response is sent and the process stops.
Stop. If the answer in step 160 is not yes, the entry in the LR table is
It is deleted at 170 and it is determined at step 172 whether to send a negative response.
Is done. If no, the process stops. If sending a negative response,
A response is sent at floor 168 and the process stops. FIG. 9 is a flowchart showing a communication system operating according to an embodiment of the present invention when a registration request is generated.
3 shows the response of a mobile node in the system. The mobile node paging or moving in step 180
Step 182 upon receiving the dynamic IP agent advertisement message.
The network address where the new network access identifier is received.
Access identifier. Next, in step 184, the new network
No determination is made whether the access identifier is equal to the current network access identifier.
It is. If yes, the process stops. If no, registration request is stage 1
At 86, it is sent to the location register (1) and the process stops. FIG. 10 is a flowchart showing a communication system operating according to the embodiment of the present invention when a registration response is received.
3 shows the reaction of a mobile node in the system. When the mobile node receives the response at step 190
In step 192, an authentication decision is made. If no, the process stops.
You. If the authentication decision is yes, an affirmative decision is made at step 194. Response is positive
If so, in step 196 the address is updated and the current network access
Access identifier is set equal to the new network access identifier, indicating registration completion.
Is done. Thereafter, the process stops. If the response is not positive in step 194
In step 198, a retransmission decision is made. If the resend decision is no, the process
Stop. If the resend decision is yes in step 198, the registration request message is resent
And the process stops. The flowchart of FIG. 11 operates according to an embodiment of the present invention when a validity period update request is generated.
4 illustrates a response of a mobile node in a communication system. Generate a validity period update request in step 210
If so, at step 212, a determination is made whether the validity period is about to expire.
If no, the process stops. If the expiration date is about to expire at step 212
The validity period update request is sent to the location register (1) fixed by the mobile node.
, Then the process stops. The flowchart of FIG. 12 operates according to an embodiment of the present invention upon receiving a validity period update response.
4 illustrates a response of a mobile node in a communication system. Mobile node is valid in step 220
Upon receiving the update response, an authentication decision is made at step 222. If the certification decision is no
If so, the process stops. At step 222, if the authentication decision is yes, step 224
Updates the validity period and stops the process. FIG. 13 is a flowchart showing a communication system operating according to the embodiment of the present invention when a registration request is received.
The reaction of LR with layer = 1 in the system is shown. Position register (1) requests registration at step 230
, A pending entry is created in step 232 and the pointer is set to the parent LR (i + 1
). Thereafter, a registration request is made at step 234
(2), and the process stops. FIG. 14 is a flowchart illustrating a communication system operating according to an embodiment of the present invention when a registration response is received.
The reaction of LR with layer = 1 in the system is shown. In step 240, the position register (1) responds to the registration
Is received, at step 242, an authentication decision is made. If the certification decision is no,
Seth stops. If the authentication decision is yes, a positive decision is made in step 244
. If the response is positive, step 246 sets the status to active by setting the status to active.
The entry is updated, then the response is relayed to the mobile node at step 248. Then
The process stops. If the response is not affirmative in step 244, a negative is returned in step 250
The acknowledgment is processed and a response delivery decision is made at step 252. Response sending decision
If so, the process stops. If the decision to send the response in step 252 is yes,
At floor 248 the response is relayed to the mobile node and the process stops. The flowchart of FIG. 15 illustrates a communication system operating according to an embodiment of the present invention when receiving a binding update.
The reaction of LR with layer = 1 in the system is shown. At step 260, the position register (1) updates the binding
Is received, an authentication decision is made at step 262. If the certification decision is no,
Seth stops. If the authentication determination is yes in step 262, the mobile node
The entry is updated in the reverse direction, and the process stops. The flowchart of FIG. 16 illustrates a communication system operating according to an embodiment of the present invention upon receiving a deregistration.
The reaction of LR with layer = 1 in the system is shown. In step 270, the position register (1) is deregistered
Is received, an authentication decision is made at step 272. If the authentication decision is no
, The process stops. If the authentication decision is yes in step 272, the entry is moved
Updated at step 274 from the node in the reverse direction and the process stops. The flowchart of FIG. 17 operates according to an embodiment of the present invention upon receiving a validity period update request.
4 shows the response of LR for layer = 1 in the communication system. In step 280, the position register (1)
Upon receiving the validity period update request, an authentication decision is made at step 282. Authentication decision
If no, the process stops. If the authentication decision in step 282 is yes
, The lifetime request is relayed to the parent LR (I + 1), after which the process stops. The flowchart of FIG. 18 operates according to an embodiment of the present invention upon receiving a validity period update response.
4 shows the response of LR for layer = 1 in the communication system. In step 290, the position register (1)
Upon receiving the validity period update response, an authentication decision is made at step 292. Authentication decision
If no, the process stops. If the authentication decision is yes in step 292, the step
The entry is updated at 294 and the validity period is set equal to the received validity period.
You. At step 296, the lifetime response is relayed to the mobile node. After this, the process
Stops. The flowchart of FIG. 19 operates according to an embodiment of the present invention upon receiving a deregistration message.
2 illustrates the reaction of LR for layer i> 1 in a communication system. Step 3 when i is greater than 1
If the location register of layer i receives the deregistration message at 00, it is acknowledged at step 302.
A testimony is made. If the authentication decision is no, in step 304 a message indicating authentication failure is received.
The message is sent to the location register that sent the deregistration. Then the process stops
I do. If the authentication decision in step 302 is yes, the message is processed in step 306
A determination is made whether the destination node is above layer two. If no, step 30
At 8, the target address for the message to be sent is indicated by the existing pointer
The registration is set equal to the address of the LR (i-1) to be registered, and the deregistration is sent. Stage 3
At 06, if the node processing the message is above tier 2, then at step 310,
A determination is made whether the node processing the message is on the home branch
. At step 310, if the node processing the message is not on the home branch,
At step 314, the target address for the message to be sent equals the current pointer.
Is set. At step 310, the node processing the message is
If so, in step 312 a determination is made whether to send along the home branch.
Done. If yes, at step 316 the target account for the message to be sent is
The dress is set equal to the address of the parent LR (i + 1). E in step 312
If the determination as to whether or not to send along the branch is no, step 314
The target address is set equal to the current pointer. After setting the target address, the flow
Proceed to floor 318 where the carry forward link address and expiration date from deregistration
A deregistration with an interim or default validity period is sent. Then in step 320
A determination is made whether the node processing the message is on the home branch.
You. If no, at step 324, the status is set to transfer and the mobile node
The status of the entry is indicated. It also points to the next position register in the chain.
The interface is set equal to the transport link address carried in the message and is valid
The period is updated. Then the process stops. At step 320, the message
If the node to be processed is on the home branch, the entry is deleted in step 322.
And then the process stops. The flowchart of FIG. 20 illustrates a communication system operating according to an embodiment of the present invention when receiving a binding update.
The reaction of LR in layer i> 1 in the system is shown. If i is greater than 1, position 330
When register (i) receives the binding update, an authentication decision is made at step 332. Recognition
If the test result is no, in step 334, the location register that sent the binding update loses authentication.
A message is sent indicating a loss, after which the process stops. Step 332 authentication
If the answer is yes, a determination is made at step 336 as to whether to send a binding update.
You. If yes, at step 338, the goal for the message to be sent
The address is set equal to the address in LR (i-1) indicated by the existing pointer.
The binding update is sent in the
The validity period is carried over from the binding update message. Then in step 340
Pointer is set equal to the forwarding link address and the validity period is updated
. If the determination as to whether to send the binding update in step 336 is no,
As such, the process proceeds to step 340 where the pointer is equal to the transfer link address.
And the validity period is updated. The flowchart of FIG. 21 operates according to an embodiment of the present invention upon receiving a validity period update request.
Figure 4 shows the reaction of LR for layer i> 1 in a communication system. If i is greater than 1, step 35
If the location register (i) receives the validity period update request at 0, the authentication decision is made at step 352.
Disconnection is made. If no, the validity period request is sent in step 356.
A message indicating authentication failure is sent to the position register, and the process stops. Stage
If the authentication decision at 352 is yes, at step 354, a mobile node authentication decision is made.
You. If the mobile node is not authenticated, an authentication failure message sends a lifetime request
Is sent to the specified position register. If the mobile node is authenticated in step 354, step 3
At 58, a determination is made as to whether layer i processing the node is on the home branch.
Is done. However, i = 2. If yes, renew the validity period in step 360
A determination is made as to whether the If renewing the validity period, a new validity period is entered in step 362
A period is set, and a determination is made in step 364 as to whether to send a valid period response.
Is done. If not, the process stops. If yes, at step 366
LR whose target address for the message to be sent is indicated by an existing pointer
The valid period response is sent with the address set to be equal to the address (i-1). after,
The process stops. The determination whether to renew the validity period in step 360 is
If so, the process stops. If the determination in step 358 is no, step 368
Determines whether the node that processes the message is the root node of another region.
Done. If yes, at step 370 the target account for the message to be sent is
Dress is set equal to the home root node, and at step 372, the validity period
An update request is sent. At step 368, the node that processes the message determines
If not, in step 374, the node that processes the message
A determination is made as to whether or not it is on a branch. If no, request a validity period renewal
In step 376, the target address for the message to be sent is sent to the parent for sending.
It is set equal to the address of the parent LR (i + 1). Process message at step 374
To send a lifetime request to home if the serving node is on the home branch
In step 378, the target address for the message to be sent is
It is set equal to the address of LR (i-1) on the lunch. After that, the validity period needs to be renewed.
The request is sent at step 372. After sending the LTR, flow proceeds to step 360,
Update the validity period as follows. The foregoing description of a preferred embodiment of the invention has been presented for purposes of demonstration and description.
is there. It is not intended to be exclusive or to limit the invention to the form as disclosed.
Absent. Other modifications or variations are possible in light of the above doctrine. The embodiment is based on
To explain the principles of the invention and its practical use, and to those skilled in the art,
The invention may be used in various embodiments and with various modifications to suit the purpose.
It has been selected and described to enable its use. All of these
Changes and modifications shall be made to the extent that they are fairly, legally and equally entitled.
It is within the scope of the present invention to be determined when interpreting the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 shows a simplified 3G wireless system according to the method and system of the present invention.
1 illustrates a network architecture. FIG. 2 shows a hierarchical system architecture with four layers of location registers.
1 shows a communication system according to the method and system of the present invention. FIG. 3 shows a location register table for storing mobile node location information.
Show. FIG. 4 illustrates a position in a hierarchical architecture according to the method and system of the present invention.
An example of an installation chain is shown. FIG. 5 is a function showing a process of a position register of a layer> 1 receiving a registration request;
It is a flowchart. FIG. 6 is a functional flow diagram showing a process of a position register for generating a registration response.
is there. FIG. 7 is a functional flow diagram showing a process of a position register for generating a registration response.
is there. FIG. 8 is a function showing a process of a position register of layer> 1 receiving a registration response
It is a flowchart. FIG. 9 is a functional flow diagram of a process of a mobile node for generating a registration request. FIG. 10 is a functional flow diagram of a process of a mobile node receiving a registration response.
. FIG. 11 is a function showing a process of a mobile node for generating a validity period update request.
It is a flowchart. FIG. 12 shows a function of a process of a mobile node receiving a validity period update response.
It is a flowchart. FIG. 13 is a function showing a process of a position register (1) for receiving a registration request;
It is a flowchart. FIG. 14 is a diagram illustrating a process of a layer = 1 position register receiving a registration response;
It is a flow chart. FIG. 15 illustrates a process for a layer = 1 location register receiving a binding update.
It is a flow chart. FIG. 16 is a diagram illustrating a process of a layer = 1 position register receiving a deregistration.
It is a flow chart. FIG. 17 shows a process of a position register of layer = 1 receiving a validity period update request.
FIG. FIG. 18: Process of the position register of layer = 1 receiving the validity period update response
FIG. FIG. 19 shows a process of a position register of layer> 1 for receiving a deregistration message.
3 is a functional flow chart illustrating a process. FIG. 20 illustrates a process for a layer> 1 location register receiving binding updates.
It is a flow chart. FIG. 21 is a diagram illustrating a process of a position register of a layer> 1 receiving a validity period update request
FIG.

────────────────────────────────────────────────── ─── Continuation of front page    (81) Designated country EP (AT, BE, CH, CY, DE, DK, ES, FI, FR, GB, GR, IE, I T, LU, MC, NL, PT, SE, TR), OA (BF , BJ, CF, CG, CI, CM, GA, GN, GW, ML, MR, NE, SN, TD, TG), AP (GH, G M, KE, LS, MW, MZ, SD, SL, SZ, TZ , UG, ZW), EA (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM), AE, AG, AL, AM, AT, AU, AZ, BA, BB, BG, BR, BY, B Z, CA, CH, CN, CR, CU, CZ, DE, DK , DM, DZ, EE, ES, FI, GB, GD, GE, GH, GM, HR, HU, ID, IL, IN, IS, J P, KE, KG, KP, KR, KZ, LC, LK, LR , LS, LT, LU, LV, MA, MD, MG, MK, MN, MW, MX, MZ, NO, NZ, PL, PT, R O, RU, SD, SE, SG, SI, SK, SL, TJ , TM, TR, TT, TZ, UA, UG, UZ, VN, YU, ZA, ZW (72) Inventor Tan, Dar-Rain, Armon             United States Illinois 60540             Ipperville Green Trails Do             Live 1337 F term (reference) 5K030 GA03 GA12 HA08 HC09 HD10                       JT09 KA04 KA05 LB07 MA06                       MD07                 5K067 AA21 BB04 BB21 EE02 EE10                       EE16 HH31 JJ61 JJ68

Claims (1)

Claims: 1. A method of locating a portable transceiver in a communication system, the communication system comprising: a plurality of transceivers, with a plurality of ports transferring communication information through the communication system. Wherein the portable transceiver is one of the plurality of transceivers;
A plurality of ports, each of the plurality of transceivers coupled to one of the plurality of ports; a plurality of nodes transferring information between the plurality of ports, each of the plurality of ports being Is coupled to one of the multiple nodes, each of the multiple nodes having a memory capable of storing data indicating a port to which the portable transceiver is coupled; and the multiple ports and the multiple A plurality of node trees, each of the plurality of node trees being: a plurality of groups of the plurality of ports; and a plurality of groups of the plurality of nodes constructed as a hierarchical system of nodes. The root node is constructed as the highest node of the hierarchical system of nodes, and the plurality of node trees are: A home tree associated with a transceiver, wherein the portable transceiver has an address indicating a home port of the home tree, and wherein the plurality of node trees further comprises a second tree having a second port. The method comprising: (a) coupling the second port to the portable transceiver; and (b) responsive to the coupling of step (a), a root node of the home tree. Adding a first data entry to the portable transceiver, the first data entry being associated with the portable transceiver and indicating a root node of the second tree.