Efficiently linking storage object replicas in a computer network
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/176
출원번호
UP-0704320
(2003-11-07)
등록번호
US-7555527
(2009-07-09)
발명자
/ 주소
Slaughter, Gregory L.
Chen, Xiaohui Dawn
Saulpaugh, Thomas E.
출원인 / 주소
Symantec Operating Corporation
인용정보
피인용 횟수 :
19인용 특허 :
45
초록▼
A system and method for efficiently linking together replicas of a storage object. The location of a first replica of the storage object may be stored on a node in a network. When new replicas of the storage object are created, the node that stores the new replica may efficiently lookup the location
A system and method for efficiently linking together replicas of a storage object. The location of a first replica of the storage object may be stored on a node in a network. When new replicas of the storage object are created, the node that stores the new replica may efficiently lookup the location of the first replica and utilize the location information to perform an efficient process to link the new replica to the first replica and any other existing replicas by causing routing information to be created on various nodes.
대표청구항▼
What is claimed is: 1. A computer-readable storage medium storing program instructions executable to implement a method comprising: a first node storing a first replica of a first storage object; the first node sending location information for the first replica of the first storage object to a seco
What is claimed is: 1. A computer-readable storage medium storing program instructions executable to implement a method comprising: a first node storing a first replica of a first storage object; the first node sending location information for the first replica of the first storage object to a second node, wherein the location information specifies that the first replica of the first storage object is stored on the first node; a third node storing a second replica of the first storage object; the third node querying the second node to obtain the location information for the first replica of the first storage object; in response to determining that the location information specifies that the first replica of the first storage object is stored on the first node, the third node initiating an operation to create first routing information for sending messages from the third node to the first replica of the first storage object on the first node; sending a publish message from the third node to the first replica of the first storage object on the first node using the first routing information; and creating second routing information for sending messages from the first node to the second replica of the first storage object on the third node in response to the publish message. 2. The computer-readable storage medium of claim 1, wherein the operation to create the first routing information includes sending a message from the third node to the first node. 3. The computer-readable storage medium of claim 2, wherein the message is propagated from the third node to the first node via one or more intermediate nodes; wherein a reply message is propagated from the first node to the third node via the one or more intermediate nodes; wherein creating the first routing information comprises the third node and each intermediate node creating routing information for routing messages to the first replica of the first storage object via a respective link by which the reply message was received. 4. The computer-readable storage medium of claim 1, wherein the publish message is propagated from the third node to the first node via one or more intermediate nodes; wherein creating the second routing information comprises the first node and each intermediate node creating routing information for routing messages to the second replica of the first storage object via a link by which the publish message was received. 5. The computer-readable storage medium of claim 1, wherein the method implemented by the program instructions further comprises: the first node selecting the second node for storing the location information for the first replica of the first storage object based on one or more of: an ID of the first storage object; and an ID of the second node. 6. The computer-readable storage medium of claim 1, wherein the method implemented by the program instructions further comprises: the third node determining that the location information for the first replica of the first storage object is located stored on the second node based on one or more of: an ID of the first storage object; and an ID of the second node; wherein the third node queries the second node to obtain the location information in response to said determining that the location information is stored on the second node. 7. The medium of claim 1, wherein the method implemented by the program instructions are further comprises: a fourth node storing a third replica of the first storage object; the fourth node querying the second node to obtain the location information for the first replica of the first storage object; in response to determining that the location information specifies that the first replica of the first storage object is stored on the first node, the fourth node initiating an operation to create third routing information for sending messages from the fourth node to the first replica of the first storage object on the first node; sending an additional publish message from the fourth node to the first replica of the first storage object on the first node using the third routing information; and creating fourth routing information for sending messages from the first node to the third replica of the first storage object on the fourth node in response to the additional publish message. 8. The computer-readable storage medium of claim 7, wherein the operation to create the third routing information includes sending a message from the fourth node to one or more intermediate nodes; wherein the one or more intermediate nodes includes a fifth node that already has routing information for sending messages to the first replica of the first storage object located on the first node; wherein the fifth node does not further propagate the message to another node. 9. The computer-readable storage medium of claim 1, wherein the first storage object comprises a file. 10. A system comprising: a plurality of nodes, wherein each of the plurality of nodes includes memory storing program instructions executable to implement a method comprising: a first node of the plurality of nodes storing a first replica of a first storage object; the first node sending location information for the first replica of the first storage object to a second node of the plurality of nodes, wherein the location information specifies that the first replica of the first storage object is stored on the first node; a third node of the plurality of nodes storing a second replica of the first storage object; the third node querying the second node to obtain the location information for the first replica of the first storage object; in response to determining that the location information specifies that the first replica of the first storage object is stored on the first node, the third node initiating an operation to create first routing information for sending messages from the third node to the first replica of the first storage object on the first node; sending a publish message from the third node to the first replica of the first storage object on the first node using the first routing information; and creating second routing information for sending messages from the first node to the second replica of the first storage object on the third node in response to the publish message. 11. The system of claim 10, wherein the operation to create the first routing information includes sending a message from the third node to the first node. 12. The system of claim 11, wherein the message is propagated from the third node to the first node via one or more intermediate nodes; wherein a reply message is propagated from the first node to the third node via the one or more intermediate nodes; wherein creating the first routing information comprises the third node and each intermediate node creating routing information for routing messages to the first replica of the first storage object via a respective link by which the reply message was received. 13. The system of claim 10, wherein the publish message is propagated from the third node to the first node via one or more intermediate nodes; wherein creating the second routing information comprises the first node and each intermediate node creating routing information for routing messages to the second replica of the first storage object via a link by which the publish message was received. 14. The system of claim 10, wherein the method implemented by the program instructions further comprises: the first node selecting the second node for storing the location information for the first replica of the first storage object based on one or more of: an ID of the first storage object; and an ID of the second node. 15. The system of claim 10, wherein the method implemented by the program instructions further comprises: the third node determining that the location information for the first replica of the first storage object is stored on the second node based on one or more of: an ID of the first storage object; and an ID of the second node; wherein the third node queries the second node to obtain the location information in response to said determining that the location information is stored on the second node. 16. The system of claim 10, wherein the method implemented by the program instructions further comprises: a fourth node of the plurality of nodes storing a third replica of the first storage object; the fourth node querying the second node to obtain the location information for the first replica of the first storage object; in response to determining that the location information specifies that the first replica of the first storage object is stored on the first node, the fourth node initiating an operation to create third routing information for sending messages from the fourth node to the first replica of the first storage object on the first node; sending an additional publish message from the fourth node to the first replica of the first storage object on the first node using the third routing information; and creating fourth routing information for sending messages from the first node to the third replica of the first storage object on the fourth node in response to the additional publish message. 17. The system of claim 16, wherein the operation to create the third routing information includes sending a message from the fourth node to one or more intermediate nodes; wherein the one or more intermediate nodes includes a fifth node that already has routing information for sending messages to the first replica of the first storage object located on the first node; wherein the fifth node does not further propagate the message to another node. 18. The system of claim 10, wherein the first storage object comprises a file. 19. A method comprising: a first node storing a first replica of the first storage object; the first node sending location information for the first replica of the first storage object to a second node, wherein the location information specifies that the first replica of the first storage object is stored on the first node; a third node storing a second replica of the first storage object; the third node querying the second node to obtain the location information for the first replica of the first storage object; in response to determining that the location information specifies that the first replica of the first storage object is stored on the first node, the third node initiating an operation to create first routing information for sending messages from the third node to the first replica of the first storage object on the first node; sending a publish message from the third node to the first replica of the first storage object on the first node using the first routing information: and creating second routing information for sending messages from the first node to the second replica of the first storage object on the third node in response to the-publish message. 20. The method of claim 19, wherein the operation to create the first routing information includes sending a message from the third node to the first node. 21. The method of claim 20, wherein the message is propagated from the third node to the first node via one or more intermediate nodes; wherein a reply message is propagated from the first node to the third node via the one or more intermediate nodes; wherein creating the first routing information comprises the third node and each intermediate node creating routing information for routing messages to the first replica of the first storage object via a respective link by which the reply message was received. 22. The method of claim 19, wherein the publish message is propagated from the third node to the first node via one or more intermediate nodes; wherein creating the second routing information comprises the first node and each intermediate node creating routing information for routing messages to the second replica of the first storage object via a link by which the publish message was received. 23. The method of claim 19, further comprising: the first node selecting the second node for storing the location information for the first replica of the first storage object based on one or more of: an ID of the first storage object; and an ID of the second node. 24. The method of claim 19, further comprising: the third node determining that the location information for the first replica of the first storage object is stored on the second node based on one or more of: an ID of the first storage object; and an ID of the second node; wherein the third node queries the second node to obtain the location information in response to said determining that the location information is stored on the second node. 25. The method of claim 19, further comprising: a fourth node storing a third replica of the first storage object; the fourth node querying the second node to obtain the location information for the first replica of the first storage object; in response to determining that the location information specifies that the first replica of the first storage object is stored on the first node, the fourth node initiating an operation to create third routing information for sending messages from the fourth node to the first replica of the first storage object on the first node; sending publish message from the fourth node to the first replica of the first storage object on the first node using the third routing information; and creating fourth routing information for sending messages from the first node to the third replica of the first storage object on the fourth node in response to the additional publish message. 26. The method of claim 25, wherein the operation to create the third routing information includes sending a message from the fourth node to one or more intermediate nodes; wherein the one or more intermediate nodes includes a fifth node that already has routing information for sending messages to the first replica of the first storage object located on the first node; wherein the fifth node does not further propagate the message to another node. 27. The method of claim 19, wherein the first storage object comprises a file.
연구과제 타임라인
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.
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.
Muntz, Daniel A.; Karamanolis, Christos; Zhang, Zheng; Mahalingam, Mallik, Namespace service in a distributed file system using a database management system.
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.
Dobinson, Ian; Haynes, Peter, Bi-directional synchronization of data between a product lifecycle management (PLM) system and a source code management (SCM) system.
Matsuo, Hideki, Distributed storage system, node device, recording medium in which node processing program is recorded, and address information change notifying method.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.