Source: https://patents.google.com/patent/US9554418B1/en
Timestamp: 2019-04-23 17:04:32+00:00

Document:
A system for hiding an internal topology of a network having plurality of client and server entities is provided herein. The system comprises a topology hiding node that coordinates communication between systems in two distinct networks: Home Public Land Mobile and Visited Public Land Mobile. The topology hiding node includes long term storage and a short term storage which includes a change list.
A real identity of one system entity is represented by at least one virtual identity allocated from a group of at least two virtual identities, when communicating with the other system entities, and the relation between the virtual identities and the real identities of a current communication session is recorded in the change list and stored in short term storage and the relation between the virtual identities and the real identities of a previous communication sessions is stored in the long term storage.
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/770,466 filed on Feb. 28, 2013, which is hereby incorporated by reference in its entirety.
This technology relates generally to hiding a topology of a visited network. More particularly, this technology relates to hiding a topology of a visited network system when user equipment updates on change of location or other service related changes in the visited network or gets unsolicited notifications from its home network.
There are various solutions for hiding topology of network systems known in the art. However none of these solutions provides hiding of internal topology of networks for user equipment that is consuming visited network services.
According to some examples of this technology, a system for hiding an internal topology of a network having plurality of client and server entities is provided herein. The system comprises a topology hiding node for coordinating communication between systems in two distinct networks: systems in Home Public Land Mobile (HPLM) networks and systems in Visited Public Land Mobile (VPLM) network. The topology hiding node includes long term storage and a short term storage which includes a change list.
According to some examples of this technology, a real identity of one system entity is represented by at least one virtual identity allocated from a group of at least two virtual identities. When communicating with other system entities, the relation between the virtual identities and the real identities of a current communication session is recorded in a change list and stored in short term storage and the relation between the virtual identities and the real identities of a previous communication sessions is stored in the long term storage.
This technology provides a system for hiding an internal topology of a network having plurality of client and server entities. The system comprises a topology hiding node for coordinating communication between systems in two distinct networks: systems in Home Public Land Mobile (HPLM) networks and systems in Visited Public Land Mobile (VPLM) network, includes a long term storage and a short term storage which includes a change list.
According to some examples of this technology a real identity of one system entity is hidden from external networks and represented by at least one virtual identity allocated from a group of at least two virtual identities when communicating with the other system entities.
According to some examples of this technology the relation between the virtual identities and the real identities of a current communication session is recorded in a change list which is stored in short term storage and the relation between the virtual identities and the real identities of a previous communication sessions is stored in the long term storage.
According to some examples of this technology the communication coordination is achieved by allocating mutually exclusive virtual H-MME from a list of virtual H-MME and sending it as origin host, when User Equipment (UE) just entered a new visited network and the IMSI does not exists in the THN at the exit of the visited network.
According to some examples of this technology in case UE did not enter a new visited network when transiting from one cell in the visited network to another cell in visited network the THN, then checking if the origin host is different from the one that is tracked in LTS, in case the origin host is different from the one that is tracked in LTS then the THN set a new origin host in IMSI record in LTS.
According to some examples of this technology the communication coordination is achieved by preparing a change List for the request using a record from LTS, storing it in STS, applying the change list on the real request and sending an update location request to HSS.
According to some examples of this technology the change list is updated in STS.
According to some examples of this technology, in case an outgoing message is sent from a UE that just entered a visited network then, the THN retrieve IMSI from LTS and apply the change list on IMSI in the answer which was received from the HSS and sending said answer to the MME by the THN.
This technology provides a method for hiding an internal topology of a network having a plurality of client and server entities (MME) using a topology hiding node (THN). The method comprises coordinating communication between systems in two distinct networks: systems in Home Public Land Mobile (HPLM) networks; and systems in Visited Public Land Mobile (VPLM) network and includes a long term storage, a short term storage, and a change list. A real identity (IMSI) of one system entity is represented by at least one virtual identity allocated from a group of at least two virtual identities when communicating with the other system entities. The relation between the virtual identities and the real identities of a current communication session in the change list is recorded and stored in short term storage (STS), while the relation between the virtual identities and the real identities of a previous communication sessions is stored in the long term storage (LTS).
These, additional, and/or other aspects and/or advantages of this technology are: set forth in the detailed description which follows; possibly inferable from the detailed description; and/or learnable by practice of this technology.
FIG. 4 is a flow diagram of second step of THN device activity when a message is going out of HSS, according to some examples of this technology.
Before explaining at least one example of this technology in detail, it is to be understood that this technology is not limited in its application to the details of construction and the arrangement of the components set forth in the following description or illustrated in the drawings. This technology is applicable to other examples or of being practiced or carried out in various ways. Also, it is to be understood that the phraseology and terminology employed herein is for the purpose of description and should not be regarded as limiting.
The term “International Mobile Subscriber Identity (IMSI)” as used herein in this application, is defined as a unique identification of user equipment. Other methods for identification are applicable too.
The term “Topology Hiding Node (THN)” as used herein in this application, is defined as a computing device that is located in the exit of a visited network, or on the boundary between networks.
The term “Tracking Area (TA)” as used herein in this application, is defined as registration areas which are groups of cells in a radio network.
The term “Mobile Management Entity (MME)” as used herein in this application, is defined as an entity that among other things supports Tracking Area (TA) management and paging.
Evolved Packet Core (EPC) is the core network architecture of 4G Long Term Evolution (LTE). EPS provides operators ability to deliver broadband services.
EPC supports mobility procedure of User Equipment (UE) from one TA to another. A TA comprises a set of cells and a registration area in EPS is a list of one or more TAs.
FIG. 1 illustrates an example of a configuration of an EPC, showing connections and information flow between the following elements of the EPC: user equipment (UE) 165 communicating with network of communication cell network (190), where mobility is managed by Mobile Management Entities (MME) (130, 120), and a Home Subscriber Server (HSS) 110.
According to this technology it is suggested to locate an intermediary node: a Topology Hiding Node (THN) device 180 or other computing device or system at the exit of the visited network systems or the boundary between networks for intermediating between the HSS and MME entities located in different networks. The description is not limited to communication between MME and HSS and can extended to communication between PDN Gateway (PGW) and Policy Charging Ruling Function (PCRF) for policy push or pull, or between any pairwise combination of entities located at different networks.
Referring more specifically to FIGS. 1-2, in this example the THN device 180 includes a processor 181, a memory 182, and a communication interface 183 which are coupled together by one or more buses or other links, although the THN device 180 may include other types and numbers of elements in other configurations.
The processor 181 of the THN device 180 may execute one or more programmed instructions stored in the memory 182 for hiding an internal topology of a network having plurality of client and server entities as illustrated and described in the examples herein, although other types and numbers of functions and/or other operation can be performed. The processor 181 of the THN device 180 may include one or more central processing units and/or general purpose processors with one or more processing cores, for example.
The memory 182 of the THN device 180 stores the programmed instructions and other data for one or more aspects of the present technology as described and illustrated herein, although some or all of the programmed instructions could be stored and executed elsewhere. A variety of different types of memory storage devices, such as a random access memory (RAM) or a read only memory (ROM) in the system or a floppy disk, hard disk, CD ROM, DVD ROM, or other computer readable medium which is read from and written to by a magnetic, optical, or other reading and writing system that is coupled to the processor 181, can be used for the memory 182.
The communication interface 183 of the THN device 180 operatively couples and communicates between the THN device 180 to other equipment, systems and/or devices, although other types and numbers of communication interfaces and connections and configurations to other equipment, systems and/or devices may be used.
According to some examples of this technology, a UE 165 performs TA update when the UE 165 is moving outside of a specified TA list. In other words, from one point A to another point B that is covered by different network cells. Additionally, the UE 165 performs TA update when the periodic TA update timer expires.
A TA update procedure starts with a TA update message (175) from old MME 120 to a new MME 130. When the new MME 130 receives the update message request (175), the new MME 130 checks if a context that is representing the connection of the UE to the mobile network for the UE 165 exists. If the context does not exist, then the MME 130 transmits request for context (160) to the old MME 120.
Context as mentioned in the application is referred to connectivity related context. Context may be for example, date, time, geographical localization and Quality of Service (QoS) metrics. This should not be limited to discussion on handover, other examples are applied too.
The old MME 120 transmits the context (160) of the UE 165 to the requesting new MME 130. Upon reception of the context (160), the new MME 130 sends a notification 145A that the context of the UE 165 has moved, to Home Subscriber Server (HSS) 110 via Topology Hiding Node (THN) 180, as illustrated in FIGS. 2, 3A and 3B.
According to some examples of this technology, the THN device 180 may process the notification and send it (145B) to HSS 110. After the HSS 110 cancels the context (115A-B), (125A-B) of the UE 165 in the old MME 120 via the THN device 180, the HSS 110 may acknowledge the new MME 130 and may insert new subscriber data of (140A-B) UE 165A in the MME 130 via the THN device 180 as illustrated in FIG. 4.
According to some examples of this technology, the data 140B may be transmitted from the THN device 180 after it is processed. At the final step the new MME 130 informs (155) the UE 165A that the TA procedure was successful.
In case the MME is in a visited network as illustrated later on in FIG. 2, during communication between MME in the visited network systems and HSS the security of the visited network systems may be compromised.
FIG. 2 is a block diagram of a THN device 220 device in connection with the visited network 270 and to a HSS 250, according to some other examples of this technology. In these examples, the THN device 220 is the same in structure and operation as the THN device 180, except as illustrated and described with reference to the examples herein.
According to an aspect of this technology, an intermediary device, i.e. the THN device 220, between the visited network 270 systems and home network 260 systems is provided to support internal topology hiding process of the visited network 270 systems from one hand, and to allow proper mobility management or other interaction procedure between network boundaries, e.g. Tracking Area Update (TAU) process, from the other hand. The intermediary device, i.e. the THN device 220, may be located at the exit of the visited network 270 systems. For messages outgoing from the visited network 270 systems, the THN device 220 may add, remove or update content, in a way that will hide information about a network element that generated the message.
According to some examples of this technology, the information about the network element that generated the message is hidden because it may compromise the security data of the visited network 270 systems and put the visited network 270 systems under risk of attack. Not only the internal topology may be hidden, but also the exact number of network elements in the visited network 270 systems may be masquerade. Any information can be hidden on user description.
According to another aspect of this technology, messages incoming to the visited network 270 systems from the home network 260 systems, may be routed by the THN device 220 to the correct network element. Since internal topology hiding process is applied, the message cannot be routed to its destination without a proper resolution which is also part of this technology.
According to yet another aspect of this technology, the THN device 220 may comprise a memory coupled to a processor to execute stored programmed instructions in accordance with the examples illustrated and described herein and the memory may include: (i) long term storage 210; and (ii) short term storage 230 including a change list 235, although other types and numbers of programmed instructions, modules, and/or other data, such as a change list by way of example, may be stored.
The relation between the virtual identities and the real (i.e. original) identities of a current communication session is recorded in the change list 135 which is stored in short term storage 230 and the relation between the virtual identities and the real identities of a previous communication sessions is stored in the long term storage 210.
FIGS. 3A and 3B are examples of flow diagrams of activity of a Topology Hiding Node (THN) 315 device when a message is going out of a visited network, according to some examples of this technology. In these examples, the THN device 315 is the same in structure and operation as the THN device 180, except as illustrated and described with reference to the examples herein.
According to an aspect of this technology, when a UE enters a visited network 270 in FIG. 2 or when the UE moves between cells in the visited network 270 in FIG. 2, MME 310 in visited network 270 may send an update message request to HSS 330 in Home Public Land mobile (HPLM) network 260 in FIG. 2 (stage 335). A subscriber's identity, such as International Mobile Subscriber Identity (IMSI), may be retrieved from Long Term Storage (LTS) 320 (stage 345). The LTS 320 may track HSS 330 and check which IMSI of a UE it is handling.
According to another aspect of this technology, in case the UE just entered a new visited network 270 in FIG. 2 the IMSI will not exist in the THN device 315 at the exit of the visited network 270 in FIG. 2 (stage 350). As a result, the THN device 315 may allocate mutually exclusive virtual H-MME from a list of virtual H-MME, such as virtual H-MME-1 and virtual H-MME-2 and send it as origin host instead of revealing details on network elements in the visited network (stage 355).
The real identity of each system entity is represented by at least one virtual identity allocated from a group of at least two virtual identities, when communicating with the HPLM systems.
According to yet another aspect of this technology, in case UE did not enter a new visited network 170 in FIG. 1 and it is in transition from one cell in the visited network 270 in FIG. 2 to another cell in visited network 270 in FIG. 2 meaning, the THN device 220 may check if origin host is different from the one that is tracked in LTS 320, (stage 360). If origin host is different from the one that is tracked in LTS 320, then THN device 315 may set new origin host in IMSI record in LTS (stage 365) for example.
The previous discussion is not limited to origin-host, other identifiers or combination of identifiers can be used. Next, the THN device 315 may prepare a change list for the message request by using a record from LTS 320 (stage 370) and store the change list in STS 325 (stage 375). Next, the THN device 315 may apply the change list on the real request to hide the topology of the visited network 270 systems in FIG. 2 (stage 380). Next, the THN device 315 may send an update location request to HSS 330 (stage 385) and the HSS 330 may accept the update location request (stage 390).
FIG. 4 is an example of flow diagram of a second step of THN device 415 device activity when a message is going out of HSS 430, according to some examples of this technology. In these examples, the THN device 415 is the same in structure and operation as the THN device 180, except as illustrated and described with reference to the examples herein.
According to an aspect of this technology, HSS 430 may send an update location answer 435 to MME in a visited network. Before a message from HSS 430 is going to MME in a visited network it passes via THN device 415. The THN device 415 may check if the message is intermediate, coming from a UE that just entered a visited network or a message from a UE that is moving from one cell to another in a visited network (stage 440).
In case of a CLR (Cancel-Location-Request), verifying that the Cancellation type is UPDATE-PROCEDURE, and the UE is moving between cells in a visited network then, the THN device 415 may retrieve a change list for IMSI from Short Term Storage (STS) (stage 445). Next, the THN device 415 may update the change list in LTS 425 (stage 450) and optionally updating change list in STS (stage 455).
According to another aspect of this technology, in case the message is not intermediate i.e. the UE is entering a visited network, then, the THN device 415 may retrieve IMSI from LTS 420 (stage 460). Next, the THN device 415 may apply the change list on IMSI on the answer that the HSS sent (stage 465). Next, the THN device 415 may send answer to the MME (stage 470) to be accepted by the MME 410 (stage 475).
In the above description, an example is an example or implementation of this technology. The various appearances of “one example”, “an example” or “some examples” do not necessarily all refer to the same examples.
Although various features of this technology may be described in the context of a single example, the features may also be provided separately or in any suitable combination. Conversely, although this technology may be described herein in the context of separate examples for clarity, this technology may also be implemented in a single example.
Furthermore, it is to be understood that this technology can be carried out or practiced in various ways and that this technology can be implemented in examples other than the ones outlined in the description above.
This technology is not limited to those diagrams or to the corresponding descriptions. For example, flow need not move through each illustrated box or state, or in exactly the same order as illustrated and described.
Meanings of technical and scientific terms used herein are to be commonly understood as by one of ordinary skill in the art to which this technology belongs, unless otherwise defined.
Additionally, two or more computing systems or devices can be substituted for any one of the systems or devices in any example. Accordingly, principles and advantages of distributed processing, such as redundancy and replication also can be implemented, as desired, to increase the robustness and performance of the devices and systems of the examples. The examples may also be implemented on computer system(s) that extend across any suitable network using any suitable interface mechanisms and traffic technologies, including by way of example only teletraffic in any suitable form (e.g., voice and modem), wireless traffic media, wireless traffic networks, cellular traffic networks, G3 traffic networks, Public Switched Telephone Network (PSTNs), Packet Data Networks (PDNs), the Internet, intranets, and combinations thereof.
This technology also may be embodied as a non-transitory computer readable medium having instructions stored thereon for one or more aspects of the present technology as described and illustrated by way of the examples herein, which when executed by the processor, cause the processor to carry out the steps necessary to implement the methods of this technology as described and illustrated with the examples herein.
Having thus described the basic concept of the technology, it will be rather apparent to those skilled in the art that the foregoing detailed disclosure is intended to be presented by way of example only, and is not limiting. Various alterations, improvements, and modifications will occur and are intended to those skilled in the art, though not expressly stated herein. These alterations, improvements, and modifications are intended to be suggested hereby, and are within the spirit and scope of the technology. Additionally, the recited order of processing elements or sequences, or the use of numbers, letters, or other designations therefore, is not intended to limit the claimed processes to any order except as may be specified in the claims. Accordingly, the technology is limited only by the following claims and equivalents thereto.
recording a relation between the virtual identity and the real identity of a current communication session in a change list stored in a short term storage (STS), while the relation between the virtual identity and the real identity of a previous communication sessions is stored in a long term storage (LTS).
setting a new origin host in a real identity record in the LTS when the origin host is different from the one that is tracked in the LTS.
sending an update location request to a Home Subscriber Server (HSS).
updating the change list in the LTS.
5. The device of claim 4 further comprising updating the change list in the STS.
sending the answer to the Mobility Management Entity (MME).
recording, with the topology hiding device, a relation between the virtual identity and the real identity of a current communication session in a change list stored in a short term storage (STS), while the relation between the virtual identity and the real identity of a previous communication sessions is stored in a long term storage (LTS).
setting, with the topology hiding device, a new origin host in a real identity record in the LTS when the origin host is different from the one that is tracked in the LTS.
applying, with the topology hiding device, the change list on the request, and sending an update location request to a Home Subscriber Server (HSS).
updating, with the topology hiding device, the change list in the LTS.
11. The method of claim 10 further comprising updating, with the topology hiding device, the change list in the STS.
sending, with the topology hiding device, the answer to the Mobility Management Entity (MME).
applying the change list on a real request, and sending an update location request to a Home Subscriber Server (HSS).
17. The medium of claim 16 further comprising updating the change list in the STS.
"A Storage Architecture Guide," Second Edition, 2001, Auspex Systems, Inc., www.auspex.com, last accessed on Dec. 30, 2002.
"CSA Persistent File System Technology," A White Paper, Jan. 1, 1999, p. 1-3, http://www.cosoa.com/white-papers/pfs.php, Colorado Software Architecture, Inc.
"Distributed File System: A Logical View of Physical Storage: White Paper," 1999, Microsoft Corp., www.microsoft.com, , pp. 1-26, last accessed on Dec. 20, 2002.
"Distributed File System: A Logical View of Physical Storage: White Paper," 1999, Microsoft Corp., www.microsoft.com, <http://www.eu.microsoft.com/TechNet/prodtechnol/windows2000serv/maintain/DFS nt95>, pp. 1-26, last accessed on Dec. 20, 2002.
"NERSC Tutorials: I/O on the Cray T3E, 'Chapter 8, Disk Striping'," National Energy Research Scientific Computing Center (NERSC), http://hpcfnersc.gov, last accessed on Dec. 27, 2002.
"Scaling Next Generation Web Infrastructure with Content-Intelligent Switching: White Paper," Apr. 2000, p. 1-9 Alteon Web Systems, Inc.
"The AFS File System in Distributed Computing Environment," www.transarc.ibm.com/Library/whitepapers/AFS/afsoverview.html, last accessed on Dec. 20, 2002.
"VERITAS SANPoint Foundation Suite(tm) and SANPoint Foundation Suite(tm) HA: New Veritas Volume Management and File System Technology for Cluster Environments," Sep. 2001, VERITAS Software Corp.
"Windows Clustering Technologies-An Overview," Nov. 2001, Microsoft Corp., www.microsoft.com, last accessed on Dec. 30, 2002.
Aguilera, Marcos K. et al., "Improving recoverability in multi-tier storage systems," International Conference on Dependable Systems and Networks (DSN-2007), Jun. 2007, 10 pages, Edinburgh, Scotland.
Anderson, Darrell C. et al., "Interposed Request Routing for Scalable Network Storage," ACM Transactions on Computer Systems 20(1): (Feb. 2002), pp. 1-24.
Anonymous, "How DFS Works: Remote File Systems," Distributed File System (DFS) Technical Reference, retrieved from the Internet on Feb. 13, 2009:URL (Mar. 2003).
Anonymous, "How DFS Works: Remote File Systems," Distributed File System (DFS) Technical Reference, retrieved from the Internet on Feb. 13, 2009:URL<:http://technetmicrosoft.com/en-us/library/cc782417WS.10,printer).aspx> (Mar. 2003).
Apple, Inc., "Mac OS X Tiger Keynote Intro. Part 2," Jun. 2004, www.youtube.com , p. 1.
Apple, Inc., "Mac OS X Tiger Keynote Intro. Part 2," Jun. 2004, www.youtube.com <http://www.youtube.com/watch?v=zSBJwEmRJbY>, p. 1.
Apple, Inc., "Tiger Developer Overview Series: Working with Spotlight," Nov. 23, 2004, www.apple.com using www.archive.org, pp. 1-6.
Apple, Inc., "Tiger Developer Overview Series: Working with Spotlight," Nov. 23, 2004, www.apple.com using www.archive.org<http://web.archive.org/web/20041123005335/developer.apple.com/macosx/tiger/spotlight.html>, pp. 1-6.
Basney et al., "Credential Wallets: A Classification of Credential Repositories Highlighting MyProxy," TPRC 2003, Sep. 19-21, 2003, pp. 1-20.
Botzum, Keys, "Single Sign on-A Contrarian View," Open Group Website, , Aug. 6, 2001, pp. 1-8.
Botzum, Keys, "Single Sign on-A Contrarian View," Open Group Website, <http://www.opengroup.org/security/topics.htm>, Aug. 6, 2001, pp. 1-8.
Cabrera et al., "Swift: A Storage Architecture for Large Objects," In Proceedings of the-Eleventh IEEE Symposium on Mass Storage Systems, Oct. 1991, pp. 123-128.
Cabrera et al., "Swift: Using Distributed Disk Striping to Provide High I/O Data Rates," Fall 1991, pp. 405-436, vol. 4, No. 4, Computing Systems.
Cabrera et al., "Using Data Striping in a Local Area Network," 1992, technical report No. UCSC-CRL-92-09 of the Computer & Information Sciences Department of University of California at Santa Cruz.
Callaghan et al., "NFS Version 3 Protocol Specifications" (RFC 1813), Jun. 1995, The Internet Engineering Task Force (IETN), www.ietf.org, last accessed on Dec. 30, 2002.
Carns et al., "PVFS: A Parallel File System for Linux Clusters," in Proceedings of the Extreme Linux Track: 4th Annual Linux Showcase and Conference, Oct. 2000, pp. 317-327, Atlanta, Georgia, USENIX Association.
Cavale, M. R., "Introducing Microsoft Cluster Service (MSCS) in the Windows Server 2003", Microsoft Corporation, Nov. 2002.
Debnath, Biplob et al., "ChunkStash: Speeding up inline Storage Deduplication using Flash Memory," USENIX Annual Technical Conference, 2010, pp. 1-16, usenix.org.
English Translation of Notification of Reason(s) for Refusal for JP 2002-556371 (Dispatch Date: Jan. 22, 2007).
Fan et al., "Summary Cache: A Scalable Wide-Area Protocol", Computer Communications Review, Association Machinery, New York, USA, Oct. 1998, vol. 28, Web Cache Sharing for Computing No. 4, pp. 254-265.
Farley, M., "Building Storage Networks," Jan. 2000, McGraw Hill, ISBN 0072120509.
Gibson et al., "File Server Scaling with Network-Attached Secure Disks," in Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), Association for Computing Machinery, Inc., Jun. 15-18, 1997.
Gibson et al., "NASD Scalable Storage Systems," Jun. 1999, USENIX99, Extreme Linux Workshop, Monterey, California.
Harrison, C., May 19, 2008 response to Communication pursuant to Article 96(2) EPC dated Nov. 9, 2007 in corresponding European patent application No. 02718824.2.
Hartman, J., "The Zebra Striped Network File System," 1994, Ph.D. dissertation submitted in the Graduate Division of the University of California at Berkeley.
Haskin et al., "The Tiger Shark File System," 1996, in proceedings of IEEE, Spring COMPCON, Santa Clara, CA, www.research.ibm.com, last accessed on Dec. 30, 2002.
Hu, J., Final Office action dated Sep. 21, 2007 for related U.S. Appl. No. 10/336,784.
Hu, J., Office action dated Feb. 6, 2007 for related U.S. Appl. No. 10/336,784.
Hwang et al., "Designing SSI Clusters with Hierarchical Checkpointing and Single 1/0 Space," IEEE Concurrency, Jan.-Mar. 1999, pp. 60-69.
International Search Report for International Patent Application No. PCT /US02/00720, Jul. 8, 2004.
International Search Report for International Patent Application No. PCT/US 2008/083117 (Jun. 23, 2009).
International Search Report for International Patent Application No. PCT/US2008/060449 (Apr. 9, 2008).
International Search Report for International Patent Application No. PCT/US2008/064677 (Sep. 6, 2009).
International Search Report from International Application No. PCT/US03/41202, mailed Sep. 15, 2005.
Karamanolis, C. et al., "An Architecture for Scalable and Manageable File Services," HPL-2001-173, Jul. 26, 2001. p. 1-114.
Katsurashima, W. et al., "NAS Switch: A Novel CIFS Server Virtualization, Proceedings," 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003 (MSST 2003), Apr. 2003.
Kimball, C.E. et al., "Automated Client-Side Integration of Distributed Application Servers," 13Th LISA Conf., 1999, pp. 275-282 of the Proceedings.
Klayman, J., Jul. 18, 2007 e-mail to Japanese associate including instructions for response to office action dated Jan. 22, 2007 in corresponding Japanese patent application No. 2002-556371.
Klayman, J., Nov. 13, 2008 e-mail to Japanese associate including instructions for response to office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371.
Klayman, J., Response filed by Japanese associate to office action dated Jan. 22, 2007 in corresponding Japanese patent application No. 2002-556371.
Kohl et al., "The Kerberos Network Authentication Service (V5)," RFC 1510, Sep. 1993. (http://www.ietf.org/rfc/rfc1510.txt?number=1510).
Korkuzas, V., Communication pursuant to Article 96(2) EPC dated Sep. 11, 2007 in corresponding European patent application No. 02718824.2-2201.
Lelil, S., "Storage Technology News: AutoVirt adds tool to help data migration projects," Feb. 25, 2011, last accessed Mar. 17, 2011, .
Lelil, S., "Storage Technology News: AutoVirt adds tool to help data migration projects," Feb. 25, 2011, last accessed Mar. 17, 2011, <http://searchstorage.techtarget.com/news/article/0,289142,sid5-gci1527986,00.html>.
Long et al., "Swift/RAID: A distributed RAID System", Computing Systems, Summer 1994, vol. 7, pp. 333-359.
Noghani et al., "A Novel Approach to Reduce Latency on the Internet: 'Component-Based Download'," Proceedings of the Computing, Las Vegas, NV, Jun. 2000, pp. 1-6 on the Internet: Intl Conf. on Internet.
Norton et al., "CIFS Protocol Version CIFS-Spec 0.9," 2001, Storage Networking Industry Association (SNIA), www.snia.org, last accessed on Mar. 26, 2001.
Novotny et al., "An Online Credential Repository for the Grid: MyProxy," 2001, pp. 1-8.
Oracle Secure Backup Reference Release 10.1, B14236-01, Mar. 2006, pp. 1-456.
Ott D., et al., "A Mechanism for TCP-Friendly Transport-level Protocol Coordination", USENIX Annual Technical Conference, 2002, University of North Carolina at Chapel Hill, pp. 1-12.
Padmanabhan V., et al., "Using Predictive Prefetching to Improve World Wide Web Latency", SIGCOM, 1996, pp. 1-15.
Pashalidis et al., "A Taxonomy of Single Sign-On Systems," 2003, pp. 1-16, Royal Holloway, University of London, Egham Surray, TW20, 0EX, United Kingdom.
Pashalidis et al., "Impostor: A Single Sign-On System for Use from Untrusted Devices," Global Telecommunications Conference, 2004, GLOBECOM '04, IEEE, Issue Date: Nov. 29-Dec. 3, 2004 Royal Holloway, University of London.
Patterson et al., "A case for redundant arrays of inexpensive disks (RAID)", Chicago, Illinois, Jun. 1-3, 1998, in Proceedings of ACM SIGMOD conference on the Management of Data, pp. 109-116, Association for Computing Machinery, Inc., www.acm.org, last accessed on Dec. 20, 2002.
Pearson, P.K., "Fast Hashing of Variable-Length Text Strings," Comm. of the ACM, Jun. 1990, pp. 1-4, vol. 33, No. 6.
Peterson, M., "Introducing Storage Area Networks," Feb. 1998, InfoStor, www.infostor.com, last accessed on Dec. 20, 2002.
Preslan et al., "Scalability and Failure Recovery in a Linux Cluster File System," in Proceedings of the 4th Annual Linux Showcase & Conference, Atlanta, Georgia, Oct. 10-14, 2000, pp. 169-180 of the Proceedings, www.usenix.org, last accessed on Dec. 20, 2002.
Response filed Jul. 6, 2007 to Office action dated Feb. 6, 2007 for related U.S. Appl. No. 10/336,784.
Response filed Mar. 20, 2008 to Final Office action dated Sep. 21, 2007 for related U.S. Appl. No. 10/336,784.
Rodriguez et al., "Parallel-access for mirror sites in the Internet," InfoCom 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE Tel Aviv, Israel Mar. 26-30, 2000, Piscataway, NJ, USA, IEEE, US, Mar. 26, 2000 (Mar. 26, 2003), pp. 864-873, XP010376176 ISBN: 0-7803-5880-5 p. 867, col. 2, last paragraph-p. 868, col. 1, paragraph 1.
Rosen E., et al., "MPLS Label Stack Encoding", (RFC:3032) Network Working Group, Jan. 2001, pp. 1-22, (http://www.ietf.org/rfc/rfc3032.txt).
RSYNC, "Welcome to the RSYNC Web Pages," Retrieved from the Internet URL: http://samba.anu.edu.ut.rsync/. (Retrieved on Dec. 18, 2009).
Savage, et al., "AFRAID-A Frequently Redundant Array of Independent Disks," Jan. 22-26, 1996, pp. 1-13, USENIX Technical Conference, San Diego, California.
Soltis et al., "The Design and Performance of a Shared Disk File System for IRIX," Mar. 23-26, 1998, pp. 1-17, Sixth NASA Goddard Space Flight Center Conference on Mass Storage and Technologies in cooperation with the Fifteenth IEEE Symposium on Mass Storage Systems, University of Minnesota.
Soltis et al., "The Global File System," Sep. 17-19, 1996, in Proceedings of the Fifth NASA Goddard Space Flight Center Conference on Mass Storage Systems and Technologies, College Park, Maryland.
Sorenson, K.M., "Installation and Administration: Kimberlite Cluster Version 1.1.0, Rev. Dec. 2000," Mission Critical Linux, http://oss.missioncriticallinux.corn/kimberlite/kimberlite.pdf.
Stakutis, C., "Benefits of SAN-based file system sharing," Jul. 2000, pp. 1-4, InfoStor, www.infostor.com, last accessed on Dec. 30, 2002.
Thekkath et al., "Frangipani: A Scalable Distributed File System," in Proceedings of the 16th ACM Symposium on Operating Systems Principles, Oct. 1997, pp. 1-14, Association for Computing Machinery, Inc.
Tulloch, Mitch, "Microsoft Encyclopedia of Security," 2003, pp. 218, 300-301, Microsoft Press, Redmond, Washington.
Uesugi, H., English translation of office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371.
Uesugi, H., Jul. 15, 2008 letter from Japanese associate reporting office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371.
Uesugi, H., Nov. 26, 2008 amendment filed by Japanese associate in response to office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371.
Wang B., "Priority and Realtime Data Transfer Over the Best-Effort Internet", Dissertation Abstract, Sep. 2005, ScholarWorks@UMASS.
Wilkes, J., et al., "The HP AutoRAID Hierarchical Storage System," Feb. 1996, vol. 14, No. 1, ACM Transactions on Computer Systems.
Zayas, E., "AFS-3 Programmers Reference: Architectural Overview," Transarc Corp., version 1.0 of Sep. 2, 1991, doc. No. FS-00-D160.

References: application No. 02718824
 application No. 2002
 application No. 2002
 application No. 2002
 application No. 02718824
 application No. 2002
 application No. 2002
 application No. 2002