Re-mapping a location-independent address in a computer network
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
G06F-015/173
출원번호
US-0609985
(2003-06-30)
등록번호
US-7467194
(2008-12-16)
발명자
/ 주소
Slaughter,Gregory L.
Saulpaugh,Thomas E.
Muth,John A.
출원인 / 주소
Symantec Operating Corporation
대리인 / 주소
Moser IP Law Group
인용정보
피인용 횟수 :
4인용 특허 :
45
초록▼
A system and method for re-mapping location-independent addresses in a computer network. A first node may send a first message addressed to a location-independent address, where the first message comprises a request to host an instance of the location-independent address. A second node with which th
A system and method for re-mapping location-independent addresses in a computer network. A first node may send a first message addressed to a location-independent address, where the first message comprises a request to host an instance of the location-independent address. A second node with which the location-independent address is associated may receive the first message, possibly after the first message was propagated through a path of intermediate nodes. The second node may send a response message to the first node, where the response message indicates whether the second node is granting permission to the first node to host an instance of the location-independent address. The response message may also specify whether the second node is giving up its own instance of the location-independent address.
대표청구항▼
What is claimed is: 1. A method for changing a location-independent address in a network of nodes, the method comprising: a first node in the network sending a first message, wherein the first message is addressed to the location-independent address, wherein a second node hosts an instance of the l
What is claimed is: 1. A method for changing a location-independent address in a network of nodes, the method comprising: a first node in the network sending a first message, wherein the first message is addressed to the location-independent address, wherein a second node hosts an instance of the location-independent address, wherein the first message comprises a request to host an instance of the location-independent address; the second node receiving the first message; and the second node sending a response message to the first node, wherein the response message grants permission to the first node to host an instance of the location-independent address; wherein the location-independent address comprises a role. 2. The method of claim 1, further comprising: the first node receiving the response message; and the first node adding an instance of the location-independent address in response to the response message. 3. The method of claim 2, wherein said first node adding an instance of the location-independent address enables messages addressed to the location-independent address to be sent to the first node. 4. The method of claim 2, wherein the response message indicates that the second node does not give up its instance of the location-independent address; wherein the first node and the second node each host an instance of the location-independent address after said first node adding an instance of the location-independent address. 5. The method of claim 4, further comprising: a third node sending a second message after said first node adding an instance of the location-independent address, wherein the second message is addressed to the location-independent address; and the first node and the second node both receiving the second message. 6. The method of claim 2, further comprising: the second node giving up its instance of the location-independent address in response to receiving the first message, wherein the response message indicates that the second node gives up its instance of the location-independent address; wherein the second node does not host an instance of the location-independent address after said giving up its instance of the location-independent address; wherein the first node hosts an instance of the location-independent address after said adding an instance of the location-independent address. 7. The method of claim 6, further comprising: a third node sending a second message after said second node giving up its instance of the location-independent address and first node adding an instance of the location-independent address, wherein the second message is addressed to the location-independent address; and the first node receiving the second message, but not the second node. 8. The method of claim 6, wherein the first message is propagated from the first node to the second node via a plurality of intermediate nodes; wherein each of the intermediate nodes stores routing information specifying how to route messages addressed to the location-independent address; wherein the method further comprises each intermediate node changing its stored routing information so that subsequent messages addressed to the location-independent address are routed toward the first node instead of toward the second node. 9. The method of claim 8, wherein the response message is propagated from the second node to the first node via the plurality of intermediate nodes. 10. The method of claim 8, wherein each intermediate node has a plurality of links by which to receive and send messages; wherein each intermediate node receives the first message by one of its links; wherein each intermediate node stores routing information specifying a link over which to forward the first message; wherein said each intermediate node changing its stored routing information comprises the intermediate node changing its stored routing information to specify that subsequent messages addressed to the location-independent address be forwarded over the link by which the intermediate node received the first message. 11. The method of claim 10, further comprising: each intermediate node storing a message record specifying information regarding the first message in response to receiving the first message, wherein the message record includes information specifying the link by which the intermediate node received the first message. 12. The method of claim 11, wherein the response message is propagated from the second node to the first node via the plurality of intermediate nodes; wherein the method further comprises each intermediate node: retrieving the message record that specifies information regarding the first message in response to receiving the response message; and determining from the message record the link by which the intermediate node received the first message. 13. The method of claim 12, wherein said storing the message record comprises storing the message record in a hash map; wherein the hash map maps a message ID of the first message to the message record for the first message. 14. The method of claim 13, wherein the response message includes information specifying the message ID of the first message; wherein said retrieving the message record that specifies information regarding the first message in response to receiving the response message comprises looking up the message record using the message ID of the first message. 15. The method of claim 14, wherein the response message has a message ID that is the same as the message ID of the first message; wherein the information specifying the message ID of the first message comprises the message ID of the response message. 16. The system of claim 15, wherein the first message is propagated from the first node to the second node via a plurality of intermediate nodes; wherein each of the intermediate nodes stores routing information specifying how to route messages addressed to the location-independent address; wherein each intermediate node is operable to change its stored routing information so that subsequent messages addressed to the location-independent address are routed toward the first node instead of toward the second node. 17. The system of claim 16, wherein the response message is propagated from the second node to the first node via the plurality of intermediate nodes. 18. The system of claim 16, wherein each intermediate node has a plurality of links by which to receive and send messages; wherein each intermediate node receives the first message by one of its links; wherein each intermediate node stores routing information specifying a link over which to forward the first message; wherein said each intermediate node changing its stored routing information comprises the intermediate node changing its stored routing information to specify that subsequent messages addressed to the location-independent address be forwarded over the link by which the intermediate node received the first message. 19. The system of claim 18, wherein each intermediate node stores a message record specifying information regarding the first message in response to receiving the first message, wherein the message record includes information specifying the link by which the intermediate node received the first message. 20. The system of claim 19, wherein the response message is propagated from the second node to the first node via the plurality of intermediate nodes; wherein each intermediate node is operable to: retrieve the message record that specifies information regarding the first message in response to receiving the response message; and examine the message record to determine the link by which the intermediate node received the first message. 21. The system of claim 20, wherein said storing the message record comprises storing the message record in a hash map; wherein the hash map maps a message ID of the first message to the message record for the first message. 22. The system of claim 21, wherein the response message includes information specifying the message ID of the first message; wherein said retrieving the message record that specifies information regarding the first message in response to receiving the response message comprises looking up the message record using the message ID of the first message. 23. The system of claim 22, wherein the response message has a message ID that is the same as the message ID of the first message; wherein the information specifying the message ID of the first message comprises the message ID of the response message. 24. The method of claim 1, wherein the first node executes client application software and network software, wherein said first node sending the first message comprises the network software executing on the first node sending the first message in response to a request received from the client application software executing on the first node; wherein the second node executes client application software and network software, wherein said second node sending the response message comprises the network software executing on the second node sending the response message in response to a request received from the client application software executing on the second node; wherein the network software executing on the second node enables the client application software executing on the second node to specify whether to grant permission to the first node to host an instance of the location-independent address. 25. The method of claim 24, wherein the client application software executing on the second node invokes an application programming interface (API) of the network software executing on the second node to send the response message; wherein said client application software invoking the API of the network software includes the client application software passing one or more parameters specifying whether to grant permission to the first node to host an instance of the location-independent address. 26. The method of claim 24, wherein the network software executing on the second node also enables the client application software executing on the second node to specify whether the second node is giving up its instance of the location-independent address. 27. A system comprising: a network; a plurality of nodes coupled via the network, wherein each node includes a processor and memory; wherein the plurality of nodes includes a first node operable to send a first message, wherein the first message is addressed to a location-independent address, wherein a second node in the plurality of nodes hosts an instance of the location-independent address, wherein the first message comprises a request to host an instance of the location-independent address; wherein the second node is operable to receive the first message and send a response message to the first node, wherein the response message grants permission to the first node to host an instance of the location-independent address; wherein the location independent address comprises a role. 28. The system of claim 27, wherein the first node is operable to receive the response message and add an instance of the location-independent address in response to the response message. 29. The system of claim 28, wherein said first node adding an instance of the location-independent address enables messages addressed to the location-independent address to be sent to the first node. 30. The system of claim 28, wherein the response message indicates that the second node does not give up its instance of the location-independent address; wherein the first node and the second node each host an instance of the location-independent address after said first node adding an instance of the location-independent address. 31. The system of claim 30, wherein the plurality of nodes includes a third node operable to send a second message after said first node adding an instance of the location-independent address, wherein the second message is addressed to the location-independent address; wherein the first node and the second node both receive the second message. 32. The system of claim 28, wherein the second node is operable to give up its instance of the location-independent address in response to receiving the first message, wherein the response message indicates that the second node gives up its instance of the location-independent address; wherein the second node does not host an instance of the location-independent address after said giving up its instance of the location-independent address; wherein the first node hosts an instance of the location-independent address after said adding an instance of the location-independent address. 33. The system of claim 32, wherein the plurality of nodes includes a third node operable to send a second message after said second node giving up its instance of the location-independent address and first node adding an instance of the location-independent address, wherein the second message is addressed to the location-independent address; wherein the first node receives the second message, but not the second node. 34. The system of claim 27, wherein the first node executes client application software and network software, wherein said first node sending the first message comprises the network software executing on the first node sending the first message in response to a request received from the client application software executing on the first node; wherein the second node executes client application software and network software, wherein said second node sending the response message comprises the network software executing on the second node sending the response message in response to a request received from the client application software executing on the second node; wherein the network software executing on the second node enables the client application software executing on the second node to specify whether to grant permission to the first node to host an instance of the location-independent address. 35. The system of claim 34, wherein the client application software executing on the second node invokes an application programming interface (API) of the network software executing on the second node to send the response message; wherein said client application software invoking the API of the network software includes the client application software passing one or more parameters specifying whether to grant permission to the first node to host an instance of the location-independent address. 36. The system of claim 34, wherein the network software executing on the second node also enables the client application software executing on the second node to specify whether the second node is giving up its instance of the location-independent address.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (45)
Corson, Mathew Scott; Park, Vincent Douglas, Adaptive routing method for a dynamic network.
Chao, Ching-Yun; Hough, Roger Eldred; Shaheen, Amal Ahmed, Apparatus and method for maintaining consistency of shared data resources in a cluster environment.
Van Horne, Peter; Olson, Keith; Miller, Kevin, Automatic static to dynamic IP address and DNS address management for remote communications network access.
Isfeld Mark S. ; Mallory Tracy D. ; Mitchell Bruce W. ; Seaman Michael J. ; Arunkumar Nagaraj, Bridge/router architecture for high performance scalable networking.
Davis Jonathan B. (Boca Raton FL) Lanier Charles S. (Delray Beach FL) Sze Daniel T. W. (Boca Raton FL) Weiss Leonard (Hollywood FL), Loop initialization mechanism for a peer-to-peer communication system.
Slaughter, Gregory L.; Saulpaugh, Thomas E.; Traversat, Bernard A.; Abdelaziz, Mohamed M.; Duigou, Michael J., Mechanism and apparatus for using messages to look up documents stored in spaces in a distributed computing environment.
Stuart Lup-Sing Kwan ; Glenn Alexander Curtis, Method and computer readable medium for discovering master DNS server computers for a given domain name in multiple master and multiple namespace configurations.
Beardsley Brent Cameron ; Iskiyan James Lincoln ; Micka William Frank ; Yudenfriend Harry Morris, Peer-to-peer backup system with failure-triggered device switching honoring reservation of primary device.
Deaton ; Jr. George Allen ; Franse David James ; Horton Vicki Gentry ; Lynch Jeffrey James ; Potok R. John ; Ragsdale James Harold ; Rheinart Charles Pierre,FRX ; Williford C. Eric, Seamless peer-to-peer communications in a layered communications architecture.
Micka William Frank ; Novick Yoram,ILX, Storage system employing universal timer for peer-to-peer asynchronous maintenance of consistent mirrored storage.
Heil Thomas F. ; Francis Martin H. ; DeKoning Rodney A. ; Weber Bret S., System and method for peer-to-peer accelerated I/O shipping between host bus adapters in clustered computer network.
Attanasio Clement Richard ; Goldszmidt German Sergio ; Hunt Guerney Douglas Holloway ; Smith Stephen Edwin, System and method for providing dynamically alterable computer clusters for message routing.
van Hoff Arthur A. ; Shaio Sami ; Hamilton Graham ; Mueller Marianne, System and method for secure peer-to-peer communication between downloaded programs.
Bertin Olivier (Nice FRX) Chobert Jean-Paul (Carros FRX) Pruvost Alain (Valauris FRX), System for managing topology of a network in spanning tree data structure by maintaining link table and parent table in.
McLaughlin Paul Francis ; Felix Joseph P. ; Swanson Norman Raymond, Systems and methods for minimizing peer-to-peer control disruption during fail-over in a system of redundant controllers.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.