TWI223167B - Distributed virtual web cache implemented entirely in software - Google Patents

Abstract

A method and system are provided for optimizing the local caching of one or more data components available from a server node. Each of plural nodes connected to a local area network is provided with a locally physically present cache. Each of the caches of at least some of the plurality of nodes are linked together into a single virtual cache. A particular one of the nodes is designated as a repository node for persistently storing a particular data component and for providing a copy of the particular data component to other referencing nodes of the plurality of nodes which lack, but which desire to access, the particular data component. Designation of the particular node as the repository node is unchanged solely by providing a copy of the particular data component to one of the referencing nodes that desires to access the particular data component. The repository function of a node for a particular data component is relatively static. For instance, assume that a first referencing node obtains from the repository node a copy of the particular data component and performs a group of one or more access operations on the copy of the data component If another referencing node lacks a copy of, but desires to access, the particular data component, a copy of the particular data component is provided from the repository node to the other referencing node. One of the nodes may be designated as a monitor node for the particular data component. The monitor node responds to requests by each referencing node to identify the repository node of the particular data component by providing the identity of the particular node which serves as the repository node for the particular data component.

Description

1223167 Provisional application serial number of the amending country "Decentralized virtual implementation entirely in software" The application of this case is called the 1999 1999 settlement. The content of this application is incorporated herein as a reference to US Patent No. 6, 〇26, 474 It is related to the use of the globally addressable memory to divide the "" application in this case is the right of the 1999 patent mentioned in the case. No. 1 89112368 V. Description of the invention (1) Relevant applications: This application was filed on June 23 of the year based on the US 60 / 140,645, the name of the invention is the website cache memory. The provisional exam. In addition, the present invention is related to the name of the invention in this case, which is the cache memory of the client website. Obtained by the applicant. The aforementioned patents are related, and can be fully incorporated here. [Technical field to which the invention belongs] The present invention relates to computer systems accessing network nodes The system accesses the Internet ^ 4 pieces, which uses the starting data retrieved by other nodes to accelerate the speed of the electronic system to retrieve the data elements of the network node. [Previous technology] In terms of '" cache memory "Cache" is a memory that has a faster speed than the main memory in the electric contact system. One is often used to refer to a memory circuit with a higher speed, such as / state random ^ 2 = memory (SRAM) 'It is used in slower speed memory circuits, such as auxiliary memory of dynamic memory | DRAM (DRAM). However, " cache ^ 23167 amended the fifth case number 8910368___ invention description (2 ) Once used, ^ is often used to refer to any form of higher-speed memory, and it is used by a hard disk in the #i body area, if it? "All subsidize the memory and pass the low-speed communication chain; servo The hard drive of the device is also called " cache ". Hereafter + ^ Month is related to the operating principle of the memory of the 5th memory: a computer system in the program # local 贝 it 枓 access f to display its temporal reference scene (ΐειηρ 〇Ι ^ 1 工 S 4 ®. Υ ° ^ erence); that is, the computer system is often: Ξ;]; = instruction. Cache memory by storing some = ^ „: ;;;; ^ Fa1, fl ^ ^ Therefore, it will have a small amount of storage space 'also d, the body circuit as the cache memory of the computer system:' ,, this :: ϊ, cost, the number of computer systems accessed by them ^ days γ sharing, this situation is more practical in V juice, so this achieves the overall access time,-, the system can be copied in high-speed cache memory; share is; y computer: type instructions and data storage For the sake of comparison, only a small number of accesses are required. (Please note: The program refers to the access to the original backup data in the upper body, which is a display of the spatial reference site ^ 〇Callty 〇f referenCe) Characteristics. Above 牿 M: Advice I ·· Memory position £ ^

Page 8 I223l67 Case No. 89112368 V. Description of the Invention (3) The body also provides spatial reference site access efficiency and has a low interest. In this case, it is widely used in computer systems and networks for many purposes. Many general toilets are also sexually specific. Self-contained technology to achieve can meet both general and specific needs. In a dagger-based manner, a specific use of cache memory is to access the Internet on the Internet, the full jWorld Wide Web, or the Web. In order to access web pages, a computer The system usually performs web browsing ^ = network view is a program whose function can at least send instructions to message packets via a wide area network such as J =, such as a web server that identifies content of interest to the viewer, and from this web server === Interested content. The identification of the web server is to use the π universal addresser (universal resource 10cator) address or two ", called f'URLs. Universal resource addresser The address can be converted into a network server Internet Protocol (IP) address, and then other means of extracting the content can be used to achieve the above purpose. The so-called "content" is typically referred to as "web page," Or it can be displayed visually and listeningly by a web browser running on a computer. As for the web page, it is typically provided by the "hypertext markup language (html)" type, which includes files and stylized commands for presenting instructions to the web browser according to the capabilities of the computer system Visual and auditory information. Web pages may also contain embedded commands to grab other content information from a web server for display. These other contents are usually linked by a single universal resource locator (URL). Here, the data constituting a unit capable of retrieving content data is called a "trinket" (or

1223167 month

Case No. 8911236S Amendment 5. Description of the invention (4) Data element. Here, the data element will be identified as the smallest, atomically accessible unit of web content. However, this is only for the convenience of description. For those familiar with the technical field of the present invention, it should be understood that the present invention is applicable to other kinds of data elements and other applications. ^ This method of constructing a mixture of a plurality of data elements into a web page has many advantages. One of them is that a content provider (conntent pr0vide〇jr reuses these data elements in several web pages to Supply from the website: Ϊ! Deposit: I can understand that this presents an opportunity to use the temporal reference site characteristics (pr〇perty 〇f temP〇ral locality 〇f reference) when using the website cache memory . That is, the big 2 merchants :: The page browser package software is in the hard disk of the computer system that provides a cache memory application software. The data elements of the web pages (: fresh for display) The display of each extracted web page ... and time to time). This can speed up the re-l of this data element once, but the -time-time certain-data element formation is stored in the cache memory. Every time in the spy Ancestor-^ ',' part of the title page, it is hard to download the binary data: m :: medium: not re-access time from the network server is always longer than from the server It takes much faster to copy a component back up, so add: Download each data element of the data element on the Internet, and also provide a number = webpage. It can be reached on the date of expiration of the duplicate backup. So :: refers to the number of data elements to determine in the cache memory Contents :: The play browser can use this parameter ----- whether the copy backup has been

Page 1223167 "Play" six months, invalid, if it is invalid, it should not be used to display the web page. If the web browser determines that the copy backup of the data elements in the cache memory has expired, the cache Duplicate backups of data elements in memory should be discarded and a new data element downloaded from the Internet. In computer system networks such as a local area network (LAN), many computer systems often run web browsers Although these many computer systems can support individual direct connections to the Internet, in general, each local area network has one or more agents (prOxy SerVerS) to achieve all External data communication of computer systems. The ^ Router Browser application on each computer system is arranged to send all of its messages to the Internet '彳 exclusively to one or more proxy servers. Then, the proxy server The router sends the message to the Internet, and distributes the information it receives from the Internet to the appropriate computer system on the local network. Some businesses with web cache memory capabilities Proxy server and proxy server are application software including Microsoft Proxy Server (Microsoft Pyoxy ServerTM), which is established in Raymond, Washington, and sold by the Software Division A, as well as a new server (NeOserverTM). , Which is sold by Compaq Company, Houston, Texas. The server itself holds cache memory for accessing data components. A specific computer system attempts to access data components and this generation will cache j ΐ store (not expired) a duplicate backup, then this proxy server ▲ Yes, the duplicate backup of the self-memory body is transferred to that particular computer system. End U Website The feeder downloads the data element through the Internet, and the electric m ..... σ retrieves the data element at the speed of the car driver. Adopt-a kind of cache memory array slave agreement, page 11 1223167

Reached array routing pr0c0; CARp). : = Memory Array Access Protocol (CARp), when computer system two. ': To retrieve a specific card identified by the universal tribute source addresser (URL) = URL is hashed, and according to this hash function, = = Γ to find θ is transmitted to a plurality of proxy server A certain proxy feed = slave A can distribute the load of cache memory to several proxy servers in the local area network. Π

_Similarly, "there are several websites outside the local area network" cache engine, which can also be used to accelerate the transfer of data components. ~ Consider each local area network or computer system, which is usually Connect to the Internet via Internet Service Provider (Isp) and / or Network Access Provider (NAP) devices. These SPs and NAp own server-related devices So that they can send messages, even messages containing data elements, and these floods can be transmitted between computer systems and local networks, and between web servers. These ISP and NAP servers can also Connect or install, "cache memory engine", that is, cache memory, used to store 7L pieces of lean materials that are often retrieved. This allows Sp and NAp to send data elements to the computer system running the network / Liu Lan, so that the computer system does not need to retrieve these data elements from the web server each time they access them. These centralized cache servers and server software include:

CacheflowTM is sold by Cacheflow, Inc., SunnyVaie, California, USA; Traffic ServerTM, is sold by Inktomi, Inc., Foster City, California; DynaCacheTM, by Walthanl, Mass., USA Inf〇1 sold by ibria

1223167 on page 12 Case number 89112368 V. Description of the invention (7) for sale; NetcacheTM, which is sold by Network Appliance Company, Sunnyvale, California; and Cisco 5 00 Series Cache EngineTM, which is established in San California, California Sold by Cisco in Jose. These Internet Service Providers (ISp) and Network Access Providers (NAP) 's π cache memory engine may use the so-called "Web Cache Control Protocol (WCCP) π", This agreement will cause the computer system to send data element retrieval requests to the web server, and reissue to the cache memory engine provided in the ISp and NAP devices. Generally, ISPs or NAPs use their cache engine to transport data components (to the local area network and computer systems that they serve), rather than they transport data components from web servers located on any network. Come faster. To put it simply, in the latter case, the data components will cause more delay, because it must be transported through several private networks. There are other technologies available to operate the cache engine of I SP / NAP. See Geoff Huston, Web Caching, The Internet Protocol Journal (http: //www.ciSCCKc0m/warp/public/759/ipj-2-3-webcaching.html). These technologies include Harvest, Squid, and the Internet Caching Protocol (ICP). These technologies use one or more web proxy feeders as cache engines. Harvest and Squid provide a centralized cache memory solution. Regarding Internet Cache Memory Protocol (I CP) technology, if the proxy server does not have a valid copy backup of the specific data components required by the computer system, the proxy server sends to another

Page 13 1223167 __Case No. 89112368_ Year Month_Day Yougong 5. Description of the invention (8) The proxy server issues a query to determine whether the other proxy server has a duplicate backup of the specific data element. Generally speaking, there is a high-speed communication channel between the agents and servers, so using this technology to transport data components is still faster than obtaining the data components from a web server. Cache devices can even be used on a web server ’to speed up access to their web pages. An example of such a product is Novell ICSTM, which is a product of Noveoi located in San Jose, California.

The company's products are sold by many original equipment manufacturers such as cmpaq, De 1 1 in Austin, Texas, and IBM in Armonk, New York. This cache memory product makes the web server more efficient in retrieving data components, so it can also ship the data components to the required computer system more quickly. Another website cache memory service, called FreeflowTM, is provided by Akamai Technologies, based in Cambridge, Massachusetts. According to this service, the data elements forming the webpage are relocated to the server network maintained by FreefowTM. The web pages on the web server must be redesigned so that the universal resource locators (URLs) of the data components point to the server network of the FreeflowTM service. Like this', when a computer system running a web browser sends a request to a web server to retrieve data components, the data components are indeed retrieved from a server maintained by Free flowTM. When a computer system requests a certain piece of data, the Free flowTM service network will select a specific cache memory server to transport the data components. The specific cache memory server is very close to `` the request The computer system of data components, that is, the only way to transport data components most efficiently. ___ ^ National Patent No. 6,0 2 6, 4 7 4 proposes another kind of cache memory

Page 14 1223167 Amendment Case No. 89112368 V. Explanation of the invention (9) system. According to the patent document, each computer system in a plurality of computer systems, or a part of the storage space of a node (n 0 de) (disk, memory circuit, etc.), is arranged as a global address Use of globally addressable shared memory space. Each node is provided with a shared memory subsystem control program, which enables each node to access the shared memory space. Shared memory space is divided into many atomic units, such as 4K bytes per page. A specific node is designated to store pages permanently, that is, the specific point stores pages in the physical memory global address shared memory portion of the specific node. Another " negative female node is designated to track the consistency, ρ (Uentity) of the persistent storage nodes of each page. Each node maintains a page with a directory structure with =: domain address (gl0bal add⑽), which determines that = = P 4 ΐί 'and the responsible node is storing the assigned domain for a long time. Address-of-page nodes. "I0 is a well-known Internet location. Each instant broadcast on j 硌 is mapped to the pages that make up the file. The entry, record, and structure are used to firstly access the file for each node: Monthly address. So 'require the access point. Then, the node's responsible section is sent to the-strange long-term storage ;: The node will send the required information to obtain the letter of a certain known page fish.

The first and second of the sexual storage node on page 15 ;; :: set = fixed 页 page MM 8911 ^ RR V. Description of the invention (10) Amend the US patent No. 6,026,474 to enter the memory space of the cattle, so that each node can% = And: The cache memory of this shared browser application is used. The web pages installed on each site are not like the various technologies described previously. The cache memory is implemented on the server side of the θ station. : The fISP / NAP side or network is executed on the "client", that is, the memory retrieval technology is to grab memory. Compared with the second-stage cache memory technology, the 7 ^ 2 operator has a higher degree of autonomy to go to the feeder side; hope: you need to rely on the 1s saki side and / or the website 2) degree τ ί ί ί ί The data transmission speed between the client nodes in the local network is faster than that of the local network or the end nodes of the client nodes.

# 1 A / ^ m The client's cache memory solution is for ISP / NAP;:; order sound * _ Various solutions can be structured as an ISP / Apga / Ansi system. In fact, the cache memory solutions that can be used on the server side of the website and are connected to sigma can be used by the linker to provide an optimized solution; the purpose is, the solution 'its Faster average data component access time ^ 'US yli case No. 6, 〇26, 474 but the technology described on page 16 1223167 ___ 篆! Tiger 89112368 _ year month day _ correction __ V. Description of the invention (11) There are certain disadvantages. The most obvious is that the system of Patent No. 6, 02 6, 474, each time a file is accessed, the file must be permanently stored and "migrated" from one node to another. In other words, not only is node L being used as a permanent storage of a file, to provide a copy of the file and sent to the requesting node, but it is also necessary to delegate the responsibility and responsibility for the permanent storage of the file. Ask the node to take responsibility. This is not always the desired result. Especially considering that a responsible node has been designated to track a persistent storage node as a file, therefore, each time a permanent storage node is changed, it is generally inefficient: the purpose of the present invention at the time of the case, It is to overcome the lack of the above-mentioned conventional techniques. The purpose is connected to the fetch memory with one other method and one data element. It becomes a designation of a plurality of nodes as a storage of a specific data element, and it is changed for a desired access. Component, its — purpose can be systematic, the regional area network is at least one node earlier than υα, the complex point of the component will not borrow this particular [Summary of the Invention] According to the present invention, this-an embodiment, the present invention provides a node One or more optimizations that can be used. Each of the plurality of nodes is provided with a regional, physical cache, and each cache memory is chained. A specific node is designated with a specific data element and provides a lack of the specific data element. The specific node is regarded as a duplicate backup of the data element of the storage section, and the reference node is modified separately, that is, a data is achieved. Root 4 For nodes that serve as a path from the servo ^ cache, all of them go to a number of sections. The virtual cache memory stores the system backup for a long time to other reference nodes that wish to store it. The storage function of a point provided by a specific data element is phase 1223167 case number 89112368 V. Description of the invention (12) ___ It is static. For example, suppose a first reference node obtains a duplicate backup of a specific data element and performs a set of access operations that include one or more times on data elements: click-to-get. Such as black backup; 'It is missing, but wants to access the specific data element, = Section f for a copy of the specific data element to the other-husband and two save and click these' This will reduce the tracking of each resource. two points. The burden of sexual noise). Considering a typical node 2 =-the savings caused by poor sources are considerable. For each piece of processing, according to another embodiment, one of the nodes is designated as a monitoring node of the component.詨 g — 疋 $ is used as specific data. It is treated as specific data-from the "view" point of view, to provide a response from the specific node 1 node. Repository node requirements to identify special data elements According to the usual sentence gg specific data elements, just; reference nodes want to access-a missing cess). This parameter = line :: Hierarchical process (hWchlCal points out to the reference node, the second appropriate monitoring node (designated as the consistency of the pieces), acquisition ;; specifies the consistency of the desired data element. The * Test node, a copy of one of the appropriate storage nodes of a piece of file ...., and then save the point to get the desired data element. According to the description of the example, Yan Network Detection—or multiple messages. ^ = Point may Gradually increase the storage of information from regional surveillance nodes, such surveillance information, and identify various storage nodes, which are then designated and identified to identify storage nodes (the corresponding data elements). Except, or Chapter 1223167

Another option, 'ν · 7χ ® machine, points to a network with multiple nodes (for example, a multicast or broadcast message) to request confirmation of the proper monitoring of the festival, the appropriateness The monitoring node can identify a component for storing the missing items, or a group of data pieces which contain the & ordinary points. Storage section of text files [Embodiment] The technology of the present invention is used for a plurality of personal computers connected to a local area network in a website accessing the Internet. In addition, when the browser is able to execute the browser application software, 'Each node attempts to present a webpage, two domains, Kushiro remote, or the Internet, which are stored from a web server in Dingwang.' This web page is assumed to be composed of data elements ::: domain network, that is, files, sound data, still images, movies, pictures, ^ = application software, etc. However, those who are familiar with this artist 'ς =,: 可 他The application software is used to enable the plural nodes; to use :; monthly acquisition can be optimized. 彳 only 丨 Dinghua 1000 thousand first picture shows the network of the embodiment of the present invention 丨 network 3, wide area network 5 And the web server network 7 聿;: the corporate feeder network 7 can both be an Ethernet LAN. 2 :: and the web site is the Internet .... for example, a web server network example Na, and ^ line two or

P. 19 server. The enterprise network 3 includes a router ::, Huahua 1223167, case number 89112368 5. Description of the invention (14) t month day is nl2, nl4, nl6, nl8, n20, n22, ..., heart 6, ..., n3〇, n32, n34, n36, n38, n4G, n42 and n44, which can be personal computer networks and / or servers. The router "is used to serve router packets sent to or from the Internet 5. The hub or switch h2, ^ and" its role is to make repeated data communication between nodes n4 to π44, and A virtual bus_Uke environment was reached. The node n2sn44 can perform various processing functions, such as generating and transmitting packets to other nodes, receiving and processing packets' transmitted from other nodes, and processing data of received packets.

Generally speaking, the Internet 5 interconnects a plurality of private networks maintained by an Internet access provider (ISP) and an Internet service provider (ISP). , N, T3, T4, 0C_3, 0C-48, etc.) dedicated contract telephone line network lines to achieve network interconnection. Communication within the Internet is achieved using a layered communication protocol. These protocols include: Internet protocol (IP), Transmission Control Protocol (TCP), and Hypertext Transfer Protocol (Hypertext)

transfer protocol, http). It is worth mentioning that the Internet 5 can send messages (in the form of packets) requesting information, and send the requested information from the source node to the appropriate destination node. For example, a node may "visit website n" and issue a query to a specific web server to obtain the web page information i. The web server then sends the requested web page to the requesting node as a response. Because of the structure of the Internet, the details of the V & amp's are no longer described in detail. In other words, through the 1223167 case number 89112368 V. Description of the invention (15) The Internet 5 transmits data, For example, from node n 2 to node n 2 0, it is generally more efficient than transmitting data in local network 3 or 7, such as from node n10 to node n28, which has a much lower transmission efficiency (takes more time and uses more resources) , Width, etc.) ^

The first figure shows a more detailed internal architecture of nodes n2 to n44. Note that the structure example shown in the second figure has been adapted for the sake of discussion. For example, the node has a single bus (singU central processing unit (cpu) or processor 10, a high-speed memory 22, a master, a body 24, a disk memory 26, an input / output device or a network Interface cards (such as Ethernet interface cards) 18, an input device (such as a dock 16 such as a mouse, trackpad, trackball or joystick, etc.), and an output device (such as a graphics accelerator and monitor & expansion) Musical instruments, etc.) 14. The high-speed memory 22 contains the following: for the second version: the speed version two = static random access memory (SRAM) t, and also the type of local cache memory at the point Fortunately, the donkey 9 / | gan π a fly, relative to the main memory 24). The main it body 24, which can be a dynamic random access memory sequence dynamic random access memory (SDRAM), 'board', OR and the normal volatile work or storage of data, for the point-of-work node-like permanent storage. Processor disk memory to provide the work. For example, 'processor 10 executes according to this C: order and Instructions such as data movement can be stored in the private instructions of the memory 22 to 26.

The node is connected to the local area network; the interface card 18, which is connected to the data. It is worth mentioning that the network interface / packet mode sends the message layer address, the problem packet pointing to this node, and it can be distinguished that it has MAC

P.21 The input device 16 receives packets from the operator and those who do not. __Window ship bowel. _Z: --- For example, to visit various 1223167 j 891123fiS V. Description of the invention (16) Order of the Internet ^. The output device 14 is used to present visual and auditory information to an operator, that is, to present video and audio effects of a web page. As shown in the second figure, according to the present invention, a part of the memories 22 to 26 is sighed as a cache memory. As an example, (processor 丨 0, which executes suitable software according to the present invention) nodes ^ into nodes, at least f two nodes, and assign at least a part of its disk memory 26 to the cache j = body 100 (According to the present invention, the memories 22 and 24 can be used as cache memory memory once and twice as needed). This cache memory 丨 dl dlrect〇ry) ^^ (partltl〇n) ^ =: In case * network device program settings, used to store, ;; 'Recently accessed data components. Another way is to use this cache = :: 7 individual disk directories or partitions ... to store data elements Ϊ memory, which is higher than the legitimate storage of the limited storage of the hidden valley 1 t t ΐ资料 Among the data components, the main memory is "1" and has a relatively fast access rate; in this case, the "/ vehicle network 7" is formed by aggregation. Cryptography is the cache memory 100 ”of these nodes that are served by the website: a single virtual cache accessed by all nodes is formed into a set: points can be paired to form this common virtual cache n, each in a point The stored data elements are used for access. The "connection" of the cache memory in the other four nodes: According to this book, this type of connection is implemented by the complex communication program. I expect that the processor of the processor 10 executes the software program and it is clear that the following are the details of the relationship between Xu Xi, I 士, ν, and σ vine shell material ’. ° Self-dagger body, this point will be corrected below 1223167

Case No. 89112368, Description of the Invention (17) It is assumed that the processor of each node can execute various software programs to determine t㉟. For example, a node's processor 10 can perform web browsing. Application ’allows operators to access a variety of web pages, to retrieve :: display web pages. A node with this operation capability can be regarded as a browsing node. According to the present invention, the processing of a node can execute a software program to achieve one of the following three functions, namely: reference, or obtain a duplicate backup of the data element to provide to the browsing node & (b) as a storage of the data element Or persistent storage, as well as monitoring the consistency of those nodes as storage of data elements. = Each node that performs one of the three functions described above is considered as a reference node field (referencing node), a storage node (rep0sitory, "', and a monitor node. Note that a node may be It assumes the above-mentioned, one, two or all roles, that is, a node can be any combination of a reference node, a healthy node, and a monitoring node. The role of a node is a program that is executed according to its specific point in time, and At a specific point in time, its type changes at any time. For the sake of brevity, the following will not talk about what kind of processing the point processor 10 performs, but will replace it with "this node performs: can" 77 In addition, in the following 2 In these, these nodes will be described as delivery disk receiving packets, which contain packets of heart and / or data elements. However, such descriptions of achieving this specific mechanism will be largely omitted. People who come to the arts, You will learn how to use many circuits and techniques ... j. For example, each node uses its own product @ 1 to 1 in the destination processor 10, India 99 to 26, input / output device or network. Road Interface Card 1 8 is compatible with the use of the well-known 6 ^ 冓 it m package. In addition, according to the invention 'Ming, 1223167 ---------- 篆 89891 withdrawal ___ year month day amendment ^ invention description ^ each node is using transmission Control Protocol / Internet Protocol (TCP / IP) communication and data elements containing packets. However, this is just an example. As mentioned above, a reference node is used as a reference, or a specific protocol is obtained. Access to one of the data elements for copying and backing up. According to the present invention, a reference point uses a hierarchical access process to achieve the aforementioned functions. The process includes the following steps: (1) identifying a data element for monitoring (2) if possible, query the monitoring node to identify the storage node of a data element; and (3) if possible, retrieve the data element from the appropriate storage node. Only at the reference node in this hierarchical access process When a failure occurs, the reference node will retrieve data components from the Internet in a conventional manner. This point will be described in more detail below. To assist a reference node, it is best to increase it gradually. Build and maintain a monitoring table (moni tor table) to facilitate identification of monitoring nodes for specific data elements. Table 1 provides an example of such a monitoring table. Table 1 URL Group monitoring location www.uspto.gov.tw/web / menu / pats. htm; Pepper www. somehost. com / linkX Salt — www. mango, com / help / genhelp. html Snort www. somehost. com Garlic

Page 24 1223167 Amendment

_A Case No. 89112 Lang 8 V. Description of the Invention (19), a watch list is composed of a series of entries, each entry contains at least a pair of elements of different types. The form "URL Group", that is, the first element, is an identifier of a data element group. The reference node can use this element as an index, that is, the reference node can compare the "URL Group" element of the table entry with the universal resource locator (URL) of the data element to identify the corresponding comparison table entry. The form "monitoring position", that is, the second element, is used to identify a special monitoring node that the test node knows last. The special monitoring node is designated to identify, and its URL and the URL element of the registered item are successfully matched. The storage node of all the poor materials. For example, the reference node storing table 1, like the information display node "sn 〇r ^ (sniffing)" stored in its monitoring table, is identified by the "URL Group" element www.mango.com/help/genhelpehtmln A monitoring node of a data element; that is, a monitoring node is pointed out here, snort (sniffing) π is designated to identify a material having the "URL Group" element www.mango.com/help/genhelp.html " Component storage

"Somehost · com / 1 ink" compares to all the data elements with URL information • somehost · com / link ", such as URL storage points. However, the "U R L G r 〇 u p" element does not need to refer to each specific data element, but can replace it with the entire group of data elements. One way to distinguish the poor materials into groups is to distinguish them based on the universal resource address (URL). As you can see, each "url Group" entry contains less information than the URL entry of the data addressing table (data 10cat () r table); therefore, it will be compared to All data components of the same general URL information. That is, the first entry

WWW

WWW

Η Page 25 1223167

^ www.s〇mehost.c〇m / linkX / ad.glf, „t #, URL ㈣w.somehost.c〇1D / linkY / ad gif”. There are other methods for grouping n . The selection page of the data components is based on the "®". This will lead to the finding of such data at the same storage point. The monitoring table will be described in more detail. /, The construction, which will be described below, in addition, it is particularly important to mention : Watch list can be "area" or "remote" watch list. An area monitoring table contains: Among them: as: Surveillance camera is to monitor all URL groups of the node. A remote monitoring table contains $ a node, that is, all known nodes of the monitoring node, and for each monitoring node,

The table contains a list of all known URL groups that it monitors. _ Furthermore, each monitoring node gradually builds and maintains information in a ~~ data locator table R, and the monitoring node uses a storage node that greets special data elements. Table 2 provides information for addressing; identification is an example. , ~ A ||

ϋΕ Storage location ^ www. somehost. com / linkX // ad. gif Salt ~~ ^-www. somehost. com / logo, gif Garlic (garlic) ~ www. mangosoft. com / Snort (nasal breath) www . uspto. g〇v Snort (snorting) ^^,

Page 26 1223167 _a. "Repair" Case No. 89112368 V. Description of the invention (21) This element is used as the identifier of the data element to index the two entries in the data address table. Please note that it is more popular to use URLs to specify 7L special breeding materials in the Internet environment than to use the same method to specify a data element in a web page. Of course, 'this can be done with any suitable: identifiers instead. In addition, Table 1 uses "Snort", which is just for the sake of illustration. In fact, in the entry of the monitoring table, it is best to enter the node "snort" media access Control layer address (mac) / Internet Protocol (IP) address. The second element 'storage location' of 熟知 ni indicates the storage nodes (such as MAC address and IP address) that the monitoring node is familiar with, and its corresponding data elements, which are used by the same It is identified in the form's note item. The better choice is' monitoring node also keeps a count of the number of pieces in each group. The use and construction of the material address table will also be described in more detail below. Let's take two pictures, and now we will describe the processing flow according to the present invention. False Γ3: Click to display a web page. In the process of obtaining web page information, the print face is facing a command: in the web page, to retrieve Know the data elements identified by Γ. According to the present invention, the Liu Lan node asks for a specific Liu to extract the data elements. For example, the specific reference nodes that are taken by Cody = 1 & may be preset. For example, the reference macro I ^ may be-the designated Internet proxy server. For these referees, the #I f servo state can be set in most web browser applications such as Microsoft's "Internet Explorer (inter "net node" browser. Another option is to browse the node and the reference ..., j to be the same node. ____ ΗΐΙΒ 互 Ι page 27, description of the invention (22) Step S2 in the address is too round, refer to node execution-cache The fixed point of the memory determines the L / J catcat process), according to this process, the reference section interest: Π means: the one ?, the storage node is the designated storage sense I ::::,:; :: ;; -: Sub: The position of the point may fail to be set in two,; ,,,,,,). However, this also works: Send = Origin: When the data component is not accessed for the first time. In this case, a new point Go to appraisal and store the two parts, so you have n’t specified a monitor. Click “Save”. In step 33, if the reference is already identified, then you must refer to The storage reference node itself is identified as the storage Cf: SB4: to determine whether it is S8, the reference node determines whether it is' to the step material has expired, so it cannot be used while: ΪΓ line delete data W: memory error 'in step S10' reference section Ban Bo take note ::: S, go to step S11. If Κί body reading information Material components: such as; reference node = Department's cache memory and storage node to send the data back to the test: the second middle school does not perform 'in the second step': the situation after storage, then store, the second is ",. If s7 is in step S9, Yan does not perform a right-storage point, which is also a reference node, so in fact Newton Q2 = order a meaningful action. Shibuya S7 wants to access two: S4 Du reference node has decided to store The node is a reference node that is different from the copy and backup of the Beacon files (see 1223167, Emperor 89) 1 Tu Wu, the description of the invention (23) Λ said that the correction should not be: the material element. If so, try to be The identified storage nodes go to get the time / step S5, and the Lingkao node sends out a package message and everything. This can be done by referring to the reference node where the backup was made, and the required data element in the same path determines whether an error has occurred. It turns out that if the response message of the reference node package is sent to the reference node in step S6, it means that the storage node is sending out a requested data element, then in step ^ = Including; Act II 2 error occurred. Several backups have expired. If there are no errors: = the data element of the node provides the requested data element of the "then:" The execution is performed after step S6, at which point J is stored; the node of step 。. Therefore, the storage node is stored as one; 2. Another copy of the required data element is passed to it: ίΓ: ref =: The reference node detected an erroneous transmission: As described above, according to any of the following three reasons, Cheng Shi ’s armband will Reach step s11, that is, the execution of the formula =) In step S3, the reference node cannot identify the storage node of the data element. The test section ^ identified itself as a storage node, but in step S8 ==== memory fetch error, Therefore, in step sl10, it is required to delete the data element jc.) In step S6, the reference node identifies _ non-reference nodes as storage =. Any of the above-mentioned conditions show that:-a copy of the data element that is also @ 7 A backup is a copy of a 1 that does not exist in the virtual cache memory, that is, “No available”, non-expired data components. Page 29 1223167 Amendment ^ S_89U2368 V. Description of the invention (24) In any of its cache memories Body connection Becomes a node in the virtual cache memory). If so, the reference node must try to retrieve the data element from the Internet. Therefore, in step S11, the reference node sends a packet message via the Internet to the web server (a (Assessor using the URL of the data element) to request a copy of one of the data elements. At step §12, the test node decides whether an error occurred while trying to retrieve the data element via the Internet. An error like this, The reasons for this vary, and these reasons include: · errors in connecting the local area network to the Internet (routers or other devices), errors in web server equipment, etc. ^ detected at the reference node Such an error occurs, and then in step s3, the test node executes an invalid data writing process (abort data ordering, process). The invalid data writing process will be described in more detail later. As detailed The process of writing invalid data involves communication between the reference node and the monitoring node in order to inform the monitoring node. In the step, if the point is different from the reference node, then reply one, and do not accept the (not view is the handshake) n procedure. Assume that in step S12, you are trying to execute from the Internet reference node-write resource \ ^ Process), and if you need #, then step out & treat the incorrect message as a step. ^ Order the area cache 圮 愔 jealous- 丄 ,,; ^ The file is written to the reference node system 节点Decisiveness-Alas, goSof ts MedleyTM files can be stored in the support case No. 89112368 Description of the invention (25) Five means to modify the data of all common root data elements Someh.st.com data element ^ ( For example, everything is as mentioned above, when "storage section" is so efficient. Step S7 is executed. However, for example, when the information is given to the reference node, the point is forced to obtain a resource-like script from the Internet, then the reference section fails to address the storage node, or a copy of the file is copied; this is because it is backed up to the reference The reason for the node. Because the storage node cannot provide the data element (and the monitoring node, in any of these cases, the reference node designates itself as a data element and a data element is required) would be a meaningful action. Child clicks. Therefore, there is no step S7. Then look at the fourth figure. Here, in detail, step S20, the reference node determines? Addressing process of fetching memory. Store the required data components in the body. Take: You; Lang points to its local " cache memory (for example, the second description, the reference point will observe this image test section: the required data components. Another-a plan, if you click mr Liu Lan browser application software (that is, Liu Lan Festival S21, if you come to the second spray, execute it together. In the step body ΘH ~ that is, '', the data element is located in its local cache memory line Ordinary cache memory lookup: Click on the web browser application software to set = this setting: an internal variable " location " to indicate the reference

The point to return this value is:;:;: Save section · point. In step S22 ', it is determined by referring to J that the data element is not stored in the image: two sets. Otherwise 'If the reference is S23, a monitoring is performed and the second location is within the Ercolang point itself', then in the step process) (Caxin no 〇de 1〇C Coffee ^ mii 圆圆 国 _ |… II Shows a circle __ Page 31 1223167 _ Case No. 891123 Anti-Year Date: __ V. Description of the invention (26) locator process). These processes are described in detail below. After performing these processes, the internal variable "position" is set to indicate a hypothetical storage node for the designated storage data element. In step S22, this value is returned. The fifth figure shows a more detailed description of the monitoring node addressing process. In step S30 ', the reference node decides whether or not its own information is sufficient to indicate the consistency of the monitoring node, which is designated to identify the storage node storing the desired data element. In the later stage of processing, the reference node accesses its monitor table to determine whether the reference node has an entry, which is retrieved from url elements with the same URL group as the desired data element. If so, in step 331, the reference node sets an internal variable "monitoring" to make it equal to the monitoring position element of the index table entry, which is identified by URL group comparison in step S30. Then the 'reference node executes step S32 and sends it back' to monitor. This variable | If the reference node decides in step S30 that the designated monitoring node lacks consistency, it proceeds to step S33 to perform broadcast monitoring. Click location query process (broadcast monit () r locati⑽

Query process). In this process (the detailed description of these two parameters will be described later.) The local area network sends a query message asking for confirmation of monitoring. The monitoring node is for the desired data element type L group timp > bu # 考: Click to start an internal Timer (internal test section ^ account book β 6) and time counting. Next, in step C, refer to $ 卽 point to determine whether the internal language + day deafness cry more than the eyes. L 里 止 1 二 ', collection Response, query for broadcast has been corrected 1223167

_ Case No. 89112368, Inventory Note (27), whether there is any response received. If the action of the reference node has not been returned to step S 3 4. Go to 'If a response is received, then in step S36, the reference node decides whether or not the response is received, compared to the previous two: virtual, in other words, the reference node can use any standard to select the most recent Monitoring is on the spot. For example, the predetermined criterion may be a count of the total number of each data element, and each group is designated as a response monitoring node. That is, if one of the receiving nodes from the monitoring node indicates that the value of this time is greater than that of the data element previously received from the same monitoring node, the response value received recently will be used to replace the previously received response. The response was discarded. Another option is to use, '= as the # setting standard; * Shizi's monitoring node {response is the second, that is, the first response within the predetermined time. In this case, I will return to Yonglila 1 / r Fenben — dare to leave in the loop of steps S32 to S36 should be accepted, you can refer to the Lang point from the line of cattle H ^ when Niu Yi timed out at step S34, The reference node immediately executes; :: point: miaoju 837, and the reference node decides whether there is no response at all.士 a θ, 丄 set its internal variables " Yu :: ^ then go to step ⑽, refer to the section (note that ▲ step out to send a reserved response to the monitoring node to send this value back. The best of the two parameters, monitor Node) 'and the best monitoring node in the step is regarded as a table addition-entry and with element). The apparent position of the dish (mon x tor 1 oca t i on reference point is lack of information for identification of the required data element

Page 1223167

When monitoring a node, the reference node sends a broadcast or multicast message on the local area network. It is necessary to confirm the consistency of this monitoring node. According to the received response, the reference node adds an entry to its watch list so that the reference node has this information for future use. In this particular embodiment, each reference node is used when its monitoring table adds only one bite in response to a request sent by the reference node alone. That is to say: all: the response message is sent to the reference node # (a request message is sent to identify the monitoring node of the desired breeding element, the monitoring table is modified when the response message is sent. However, itnt listens to it (ο, 5 —) Respond to the message and modify them. The two LS two 1 = person 0 'even though other reference nodes do not want to save the pericardium now. Address response packet so that all parameters can receive this response. Then the reference node determines that receiving the response has failed, and the two storage nodes are the storage nodes. As already mentioned above, this may happen. : Identified monitoring nodes or no monitoring nodes have been designated with the setting 戋 ura # 于 ^ 卡 牛 之 欠 (because the data elements required by the: i = rv have not been accessed since the process was recently restarted). Like this monitoring :: This / node designation itself becomes the required data element :: that is, the two reference / monitoring nodes generate a new monitoring node for the desired data element in its monitoring table, which is a general order Feng Hong u ~ ', Like the entry Port contains the required data element

--- "URL) group as a universal resource addresser (URIJ page 34 1223167

_ Case No. 891〗 23fiS V. Description of the invention (29) 1 ~ Group 7G element 'and instructs the reference / monitoring node as the monitoring node. Then in step S40, the reference / monitoring node sets up an internal variable "monitoring" to indicate that the reference / monitoring node itself is used as the monitoring node for the desired data element; then, in step S32, this value is returned. The sixth figure illustrates the data addressing process (Data 1〇cat〇r prc) cess) The second step in step S 5 ′ 'The reference node decides whether to monitor the node (identified during the monitoring node's addressing process) is the reference node itself. If yes, = step ^ 1, The reference node (as a potential monitoring node) decides to have> storage nodes to identify the required data elements. After processing =, the reference / monitor node decides whether its data addressing table has an entry, its

=, General = The source locator (URL) group element is used as an index, and this URL = Wu Susong and the universal resource locator (um) of the desired component change in phase, then in step 2, refer to / The monitoring node establishes an internal 5-2 address, which is equal to the -indication of the storage location element, and the element is sent back to the point, which matches the mouth. Then in step s53, the reference / monitoring section Hao Hui returns the position values. ^ 7 If in step S51, the reference node (the storage node and point of the secondary component) (that is, the data address is missing to identify the required data address device), the entry matching table lacks a general resource specification. incorrect. This happens especially if the monitoring node's finger :: click to clear its data addressing table (re; J due !; 'includes: reference point) 1 In this way, the reference node refers to; or initialize the reference & view node and repository node both. 2 The monitoring / storage node as the required data element will be

Page 35 Material Addressing Table Entry. That is to say, refer to two-pieces, and generate new capital --------- ^ Solitary 'storage node will amend the required capital—Case No. 89112368 5. Description of the invention (3〇) ___ :::: Universal resource locator (L), inserted into a new universal resource locator (URL) element. ^ ^ Stop list For itself, insert an identifier as the storage location for the examination / storage node. The storage node is set to correspond to the new data: examination / monitoring / and the total count. Then in the step; two groups :: ·· ,, occupy the internal variable "position" of the internal variable as the view / storage step S53 returns to this unit. Go to the value "not found" 'and at step Suppose now at step 35, the reference point. If so, in step S56 ^ ,,, ^ • 疋 is not a monitoring node process (Sen "ata 10 = r. Query data addressing ^ ^ is executed. In step S56, moxibustion test Γ =: ΐ〇" 〇ηΐΐ〇Γ Process) The message points to the monitoring node (from the monitoring node out-packet. The time between the storage node request for identifying the required data element has expired. If not, then click on it. If it is not scheduled, you have not downloaded from the monitoring node. After receiving the response J :: c, the reference node decides that it is S57. If the response has been received, then the -person ordering step is set to "=" when the response is returned, so an internal variable "bit S53 is set and sent Return the position value. Do not store the node. The magic step 4 is assumed in step S57, the reference section is terminated. This means that the reference node has requested that the timing of the first day of the red flag has been terminated, and no monitoring rhyme has been received: save Checking the consistency of nodes ^ A is Hei Zhan's Huiyan n 丄 One test point is determined that there are no nodes now ^ In such a situation, see step S60w: " Monitoring of components __ 隐隐 _ --- ~ ^ Test site designation page 36 1223167 1223167 _ case number 89ΠMM V. Invention Explanation (31) refers to the revised month as the monitoring node of the data element. If so, the monitoring table inserts an entry, the sound-heart, > test / disc node is the monitoring node of its material element. The node body is the required resource locator (URL) group, the general resources of the components that it needs to be lean, and the reference to the reference; the locator group, and in step S54, the reference / κ ", The point of view is the point. Then the wrong storage node of the next piece. If so, designate itself as the required data element: for the desired data element, the production = step =? Reference / monitoring / storage away from the test / monitoring / storage node will The new lean material address table entry is required. Refer to (URL), insert the data to *; 'Universal resource locator (URL) element of the element. Reference / monitoring / entry general resource locator as storage See the position element for error. For the sake of its own sake, insert a reference to the new data addressing table entry > test / monitoring / storage node pair count. Then, in step S55, the table u continues to add data. The total number of internal variables " position " The i-view / storage node sets this value once. It is found, and sent in step S53. The eighth figure is explaining the invalid data palace A, wA; e process). In step s70, refer to data ", that is, the data will be received. If the test result is incorrect, the cache memory is removed in step S71, the reference node is determined, and the target data is discarded. Component monitoring node. If this is the case, it is also necessary to designate itself as the data = material address table entry, the data addressing step is 3, the reference node is deleted: point ', and it can be stored at the reference node in descending order: ^ The test node itself is also a storage pirate. The counter is decremented because the counting of the number of reference / κ breeding elements failed, and the counter stores the required data in the second storage node. _ Yes Continuously page 37 1223167

Increase. This failure is due to, for example, no nodes being available when retrieving data components from the Internet. In an alternative, if the other node is a monitoring node, a monitor invalidate message process is performed at step S72. After step S72 or step S73 is performed, at step S7 5, the reference node stops the execution of the process. Note that the process of writing invalid data (ab〇rt data write

Process) is executed in step S13 (third picture), after the following situations: (a) the reference node failed to address the storage node, so it is assumed that no node can be used as the storage node of the data element; (b) the reference node designation It itself acts as a storage node to store the desired data element and attempts to obtain the data element from the Internet; & (c) An error is detected as desired. The purpose of steps S72 and S73 in step two is to remove any designation that uses the reference node as a storage point. The ninth figure illustrates the delete data process. In step S76, the reference node deletes the universal resource locator (URL) of the desired data element from its internal flash memory. The next 5 points are at f Γ ”7 '. The reference point determines whether to also designate itself as a storage: point. If M ′ then some other monitoring nodes will currently refer to the reference node r η I reference point is discarding the copy of the data element If the result of the cache memory error is detected in step 8 of the second figure), the node invalid message process (mQnitc) i_invaii) is executed. Otherwise, the reference node must be discarded Copy backup

No. 89112368 V. Description of the invention (33) The point is deleted from its data addressing table. The node itself is regarded as the required data = ^ is used to identify the reference / monitoring point to delete (or overwrite the writer) storage point. The reference / monitoring is reduced, which is why it is referred to; = The number is also transferred one by one-after S79 or step S78, the point is m points. After performing the steps OK. 1. The tenth diagram of the execution of the reference node to stop the process is detailed explanation of κ Μ location nn. The process of querying the location of the foxtail point (monitor: line 2 test ::: the point of reference point transmission in the local network includes one percent) 1 Since Xixi requires identification of the consistency of the monitoring node, and the second query of the packet of the heart, the storage node of the other required data element: The point of view is designated by the source addresser (URL) message— The data file is owned by all the nodes of its common resources (: 2 special: multi-play group, that is, those who receive 2 2 = i depending on the reference node from the reference node to query the position of the query process. Also check the monitoring of the message packet at 50 The node executes step S82, and the monitoring node extracts the second step of the query message packet from the query message packet :: the universal resource locator (L7) of the data. At the later stage, the despise node searches its age and clicks. The table shows the general resource locator (URT, b)

Designated for the required data element: Mutual / Bull II :. If the monitoring node is a piece of software, in step S84, the monitoring node generates 1223161. V. Description of the invention (34) The response packet is transmitted to the test node, indicating its consistency and the total number of data elements. The monitoring node of the component can identify the storage node whose general resource address is the (URL) group. Otherwise, the monitoring node simply stops the execution of the process. The eleventh figure is the data query process (data 10cat quejry process) in S Brother Ming data. This process is performed in step s56 of the sixth figure. Reference :: L has identified a monitoring node, points (pretends) the consistency of the storage node that it is designated to authenticate, and sends out a check-node in the form of a packet. The query message requires consistency when used as needed, using -ΐ Ϊ: points. The data components required by the user are in the query. Rishou uses its general-purpose source addresser (URL)-the packet from the query message by the node Ί in step 5, & addresser (URL). Consistency of the storage node of the universal resource component at the step 卒 of the poor material. This can be reached as follows: 3 !: Dao_Beijing, one of the entries in the data addressing table, A reaches ^ · ▲ depending on the search, the muscle element is found by querying the "primary index", and if the monitoring node The URLs extracted by 取 4t sub-daggers are matched with each other. For example, the point of view is designated as the match of identification I. Then, in step S87, the monitoring node sets up a _fU storage node, and stores it at the entry of the matching data addressing table. Address storage: library, to indicate the storage node. We store the storage indicated by the address element. Therefore, the view node must have no information about the storage node. Therefore, the view must be: the point is incorrect information. Point. Special For example, if you look at the second; ^ until the remaining storage nodes are correctly identified .: Step] Fixed page 1223167 on page 40 V. Description of the invention (35) a S88, monitoring node establishment "storage, in step S89, monitoring I found it. What's more, the table) 10 cat URL URL (general resource) is used to determine the general resource of the new entry point δ and the new entry; the general element of the element is marked with a URL. Set the storage location of the monitoring node for the extraction of the source address ^ point (according to the received query message packet r j-marked by poor information). -Response seal: After ϊϊΓΓ has 8 to 589, the monitoring node generates and transmits. The visual node stops execution = two storage address library check = reference node. Then, monitor-vaHd'lt '; Hpr! Ee; Γ ^ ^ ^ ^ ^ The following two choices come from the basin C_eSS ρ This process will be performed because of two reasons: the storage point cannot be correctly identified. It is not a reference node, but a copy of its material components. Yu Yiyi's foot = caused the failure to provide the desired storage node-consistent information: J test node lacks any storage coffee). As a result, it is assumed that the reference Y5iVp is too high (/ step of the ten-graph). The monitoring node is located at its data address # < to store the map in step S89). However, the following table introduces an entry (the eleventh ^ required data element preparation of the V test test node to instruct the monitoring node to test; send-a message packet to the reference node identified as a data element :: =: In the addressing table, the first and second chats, monitor the node ::: = r. The situation (step S87 in the eleventh figure), but in the 'taste it: point-to-response, the 5th formula goes Contact this misplaced node 1223167

MM89Π2368 5. In the description of the invention (36) (step S5 of the third graph), the reference node detects step S6 of the 铓 graph). The reference node designates itself to store the third network to obtain the desired data element (step 8 in the third picture. And the Internet error occurs (step 812 in the third picture). Here the latter is like 1 = no error sent-message The packet is sent to the monitoring node to instruct the monitoring node to go to the wheat addressing table and enable the reference node to be identified as the data element j /, a poor (step S16 in the third figure). = The storage node is in step S 91, the monitoring node The universal resource locator (URL) of the secondary component is extracted from the received message packet. In step S92, the universal resource locator (URL) of the lean component output by Yu Man ## 贝 心 料 元, and the second time Compare the Universal Resource Locator (URL) element of any entry. If = matches successfully, the monitoring node stops executing the monitoring node invalid message process ... (monitor in val i date message process). Otherwise, it is at + S 9 3 ' The monitoring node decides whether the message envelope contains a delete entry. 'If YES, then in step S95, the monitoring node deletes the matching entry in the data addressing table and deletes it. The monitoring node also deletes the information it serves. General Resources The total number of URL (URL) groups is decremented by "1". On the other hand, if the monitoring node decides that the message does not contain a delete instruction in step S 9 3, the monitoring node sends a message in step S 9 4 The source of the packet is an indicator of the reference node to write over the storage location element at the entry of the retrieved form. The seventh figure is a diagram of the enterprise network 3 of the first figure according to another embodiment of the present invention. Explanation, in which the enterprise network (for example, a local area network) 3 is divided into several separate, non-overlapping pools or subsets each containing some nodes. As shown in the figure, the local area network 3 Contains sub-sets a, B and

Chapter 1223167

Case No. 89112368 V. Description of Invention (37) C. Subset A contains nodes n4, n6, n8, η18, π20, n22, n24, η26, η28, η30, and η30. Subset β contains nodes] 116, η34, η3β, η38, ηM, η42, and η44. Subset C contains nodes [11〇, η12 & η14. For each sub-set A, B, and C, a virtual cache memory is formed, that is, only the cache memories of the nodes of the same sub-set can be linked together. The virtual cache memory formed by this partitioning and separation link can be achieved in many ways. However, one method is to provide a single Transmission Control Protocol (Tcp) port (not shown) for each subset. Each node only accepts and processes (above the TCP layer) packets based on the TCP port number of its own subset. Otherwise, the present invention operates similarly to one of the sub-sets described above, but on a sub-set basis. This pooling (poo 11 ng) technology provides an additional advantage, that is, the load of the cache memory of the local network 3 is divided by the nodes of the local network 3. Next, the present invention described above is exemplified. It is considered that at a certain point in time, a data element is never accessed by any node n4 to any node of LAN 3. Suppose a browser node n8 wishes to retrieve a web page ', which in turn involves having to access the data element. It is also assumed that the browser node η 8 is a reference node. The reference node n 8 executes a cache locator process (step S2 in the third figure). The reference node n8 determines whether the universal resource locator (URL) of the data element is not stored in the cache memory of the node n8 (step 820 in the fourth figure). The reference node n8 executes a monitor node locator process (step S23 in the fourth figure). The reference node n8 determines the entry of its monitoring table lacking data elements (step S30 in the fifth figure). Reference node n8 performs broadcast monitor location query

Page 43 1223167 Amendment No. 89112368 V. Description of Invention (38)

Query) j Step S33 of the fifth graph). Each node that acts like a monitoring node (ie, nodes n6, nl0 to n44) receives messages and extracts a general resource addresser (URL) group of states and required components (step ^ of the tenth figure, S82) , But it is determined that it is not the monitoring node of the data element (step S83 of the tenth figure). The reference node 08 waits for a response (step s35 in the fifth figure) until the timer expires (step S34 in the fifth figure), but does not receive = f (step 537 in the fifth figure). Then 'reference node n8 is inserted at its ς = an entry to indicate that node n8 is the desired paste), and an instruction is returned: itself, that is, node n8, = two monitoring lang points (step S32 of the fifth figure) (Step S40). In the following process, the reference / monitoring node n8 identifies itself as y. Step S50 of the sixth figure), and determine that there is no corresponding entry in the desired data / location table (the second component of the sixth figure is the reference / monitoring node 118 in its m-address table, For the resource node; ::: To indicate that the node n8 itself is the data element, and the lean material count is increased by 1 (step S54 in the sixth figure). The autumn step ", ίΠΜέη8 is returned " not found " Position (the sixth picture of the stubborn / open six & the fourth picture of step S22). Since the reference / monitor = repository node n8 sent back "the position was not found" (the third picture of the step; the memory two Tth attempt : The Internet obtains the data element and it is expected that there is a "map, step su 'step S12, step S15). Without Wang Xiong, ... ,, account for invalid information" need to be sent. Data ϊ: Fake: node ii ni〇 want to access the same avoidable stored in node n8 fen ", 1 test point η1〇 also search for the monitoring node of the data element, none-up to step j ^ S33, send a broadcast message at reference node η10 here 1223167 Case number 89112368 V. Description of the invention (39) ^ One of the monitoring nodes for identifying data elements However, this time when step S83 (tenth picture) is performed, the monitoring node η8 is determined that it does have an entry for the reference node nl 0 to obtain the desired data element. Therefore, the monitoring node n8 sends a response message indicating that the data element There is already a monitoring node (step S84 in the tenth graph). The reference node nl0 receives this response (step S35 in the fifth graph) and reserves it (step S36). When the timer expires, step S34 in the graph), the reference node nl 〇 judge that it has actually received a response (step S37 in the fifth figure), and return the identifier of the monitoring node, * identifying the monitoring node n8 (step S38, step S32 in the fifth figure).夂 ^ t #, D ^ ^ # ^ View point n8 is the monitoring node of the lean component. ▲ Tu—determine that the monitoring node η8 is not itself (sixth, with reference to 1110% of the Lang point, human ... Sheng, Buya, Ditu step S50) and send two = ;; n8 to identify the storage node (step delete) . Surveillance 7: Two! Two Chu and extract the general data of the desired data element ==) (step 385 of the eleventh figure), identify the population of the desired data address table (tenth-step S86 of the figure) And return the storage point information to it (the steps in the eleventh figure are, for example, step _! 9. At this time, the node is stored as node n8. When the timer expires, step i in step i in Figure i), refer to node nl ° from The monitoring node n8 receives-: 22 two steps (8). The reference node 111 〇 returns the storage of the data element Γ = other: interest, that is, indicates that it is a storage node (the sixth figure has been found, and the second is to find the storage node (the step in the third figure is to point nlO itself (本身 rsolid + This is based on, ^ ^ No reference is required (refer to step Λ), the reference node n10 is issued-request I1H I plane ^ node n8 to obtain # material components (the step in the third figure is based on

1223167 j 89112 shape 8

V. Description of the invention (40) __ Assume that no error occurs (step 86 in the third graph) 'to the reference node Π10 (step in the third graph'). However, the normal pieces are returned to life ': eg, the storage node η8 Judging that the data element has expired. If the WAN of the first picture is sent by mistake, the website =: point η2, and the data element is re-refetched. A new version of the feeder n2 of = 7 is available. The result is The node is at the server point n8. However, if the server indicates that the storage node is valid for the test section, the storage node n8 returns data 2 ^, and some versions still do not need to re-retrieve data from the server n2. Sub-element version 1 Back: = ;; =. Copy of the pieces now assume that the reference node nl2 wants to access the same data: J The sequence of steps very similar to the above will be performed. The heaviest / then the pieces of material provided to the reference node nl2 are not Node η1 (), θ 疋, with point η8. In short, even if the rib J 疋 is stored at node nl, node η8 is still reserved as a storage element for the lean feed element to the reference node: 写入 element is written over '. Steps executed repeatedly; == Another-=, / When executing steps Storage node Eίϊΐ: Γ The copy backup of Λ is performed when step 86 is performed. Therefore, the corpse is loosened, and an error has been detected with reference to the Lang point η1 4. This is corroded at the Dokalang point η 1 4 obtained from the Internet First print step S12, step Sly * get / section (step S! 1, 100 of the second picture. Leave 1 4 # I \ u and store the tribute in the cache memory

No errors occurred. Reference node ΰΒ '__________! 223167

V. Explanation of the invention (41) The monitoring node invalid message (step S16) must be sent to the age point n, so the monitoring node n8 no longer determines that the node n8 is regarded as the second storage, and the second monitoring node 08 will identify the storage node nl4 as this. Storage of assets and documents. : Yes: Reference / storage node η " issues-substitute message for monitoring: .. ^ 8. The monitoring node extracts the data element from the message (step S91 in the second figure), obtains the entry of the matching table from its data addressing table ^ step S92 in the twelve figure), and determines that it has not been received—delete message two Step S93 in the figure). As such, the monitoring node ⑽ replaces the entry: a storage location element to indicate the storage node n 丨 4 (step S 9 4 in the twelfth figure). Now assume that node nl0 currently lacks a data element. When you want to access the data element again. Similar steps are performed. However, once, reference point nl 0 determines that its monitoring table has an entry that can identify the data element. That is, the point (step S30 in the fifth diagram) is called the monitoring node M. Therefore, the reference node 1) 10 returns the node as a monitoring node of the data element (step S31, step S32 in the fifth diagram). The extraction is similar to the previous one (note: the monitoring node n8 now recognizes the storage node nl4 as the storage node of the data, so the data element is taken from the storage node nl 4). Now suppose the node nl 〇 wants to access the same Data element, but node n8, cannot be used before (for example: fault, busy ', not installed, one or no power, etc.). Therefore, when the reference node nl0 sends a data address query to the monitoring node π8 (sixth figure (Step S56), before the timer expires (step S57 in the sixth figure), no response is received (step 358 in the sixth figure) ° So 'By following actions, refer to section η 1 0 specifies how the

Chapter 1223167

Monitoring nodes and storage nodes as data elements: (1) modify the monitoring table to indicate that the reference / monitoring / storage node nlG is a data element; the monitoring point (step S60 in the sixth figure), and ( 2) Add an entry to its data addressing table to indicate the reference / monitoring / storage node. 010 is the storage node of this data component, and for the reference / monitoring / storage section sni〇 as all the data of the monitoring point Increase the total number of components 丄 (γstep S 6 0 in the sixth figure). The reference node n 1 〇 returns the position " not found " (step S 5 5 v step S 5 3), so that the reference node n 1 〇 obtains the data item from the Internet (step S3, step 3 of the third figure) su 'step S12, step S5) ,. Note that "no node is invalid" will be executed (step S16 in the third figure), because the reference node nl0 does not know that a monitoring node ever existed 0. Now suppose node n8 can be used again. In this way, the data element has two monitoring nodes, namely node ⑽ and node nl0 (also note that the data element has two storage nodes, namely node nl4 and node nl0). Suppose now that the node wants to access data components. The reference node n16 lacks resources in its monitoring table to identify the monitoring node of the data element. As such, the node n16 sends a broadcast message requesting to identify the consistency of the monitoring node (step S33 in the fifth figure). This time, the reference node n16 receives more than one response (step S35 in the figure), that is, a response from the monitoring node n8 and a response from the monitoring node n10. The reference node η16 uses a predetermined standard, and the response of the other gate requires that the best monitoring node be selected from η 8 and η 10 (step S36 in the fifth figure). The rest of the access is similar to the above.

Page 48

Page 49

1223167 _Case No. 89112368_ Year Month and Day _ Zheng Brief Description of the Drawings The first figure shows a network used in the present invention. The second figure shows a node according to an embodiment of the invention. The third figure shows a processing flowchart according to one embodiment of the present invention. The fourth figure shows a flowchart of the cache locator process according to the embodiment of the present invention. The fifth figure shows the flowchart of the monitor node locator process according to the embodiment of the present invention. The sixth diagram shows a flowchart of the data locator process according to the embodiment of the present invention. The seventh diagram shows a part of the network of the first diagram, in which the plural nodes of the network part are divided into numbers according to the embodiment of the present invention. Node subsets. FIG. 8 is a flowchart of an abort data write process according to an embodiment of the present invention. The ninth figure shows a flowchart of a data deletion process (d e 1 e t e data process) according to an embodiment of the present invention. The tenth figure shows a flowchart of a monitor location query process according to an embodiment of the present invention. The eleventh figure shows a flowchart of a data locator query process according to an embodiment of the present invention. The twelfth figure shows a flowchart of a monitor invalidate message process according to an embodiment of the present invention. Symbol description of components 1 Network

Page 50 1223167 _Case No. 89112368_ Simple Modified Illustration 3 Enterprise Network 5 Internet 7 Web Server Network 10 Central Processing Unit 12 Single Bus 14 Output Device 16 Input Device 18 Network Interface Card 22 High-speed memory 24 Main memory 26 Disk memory 100 Cache memory A, B, C Sub-collection r 2, r 4 Router n8 Browse nodes n2, n4 'n6, n8, nl0, nl2, nl4, nl6, nl8, n20, n22, n24, n26, n28, n30, n32, n34, n36, n38, n40, n42, n44 nodes h2, h4, h6 hubs,

Page 51

Claims (1)

1223167 Λ_ Modified Yuelian 1 891123R8 6. Scope of patent application 1. A method of optimizing the memory from the node of the server node for the use of caching of 70 pieces of shellfish for 2 weeks, including the following steps: π] ^ Each node of a plurality of nodes connected to the local area network ^ 1. Cache memory for the existence of a local entity; Click to provide the cache memory of at least some nodes of this complex node h And become a single virtual cache memory; and the hidden body and C delimit a specific one of these nodes ^ ^ ^ permanently store a specific caution button-downgrade from F々 click to use 即 I back up to the plural A reference node of a 4 7L piece of data element; ,, lack of kernel-to access the specific where a specific node is designated as the storage node, a copy backup of the data element is provided to this particular type of access ^ a reference Nodes. / V + file 2. If the method in the scope of the patent application is applied, it includes the following steps. U) If the data element to be accessed by a reference node is not a valid copy backup exists in virtual cache, select Obtaining a copy backup of the data element from the servo node, one of which uses virtual cache to access the copy backup of the data element, which takes less time than the copy backup of the sand point access data element. Expansion means 3, according to the method of the scope of the patent application, No. 1 and the following steps: (d) —The first reference node is restored from the storage node ... ^ μ * 制 # 于 · 于Click-to-get—a copy of a specific data component, 1223167 _ Case No. 89112368 _ revised month of the year _ 6. The scope of the patent application (e) copies and backs up the data element at the first reference node to perform a set of one or more access operations; and (f) at step (D) After that, a duplicate backup of a specific data element is provided from the storage node to a reference node that wants to access but lacks the specific data element. 4. If the method of item 1 of the scope of patent application is applied, it further includes the following steps: (d) designating a node as a monitoring node of a specific data element, the monitoring node provides consistency between the specific node and the storage node of the specific data element, and responds to the storage node identification of the specific data element proposed by each reference node Claim. 5. If the method of claim 4 of the patent application scope further includes the following steps: (e) at least one first reference node, gradually increasing the information obtained by detecting one or more messages from the local area network, each of which A detected message to identify a particular node as a monitoring node, and the monitoring node is designated to identify a storage node designated to store a corresponding data element; and (f) At least in the first reference node, the information is accessed in an attempt to determine the consistency of a storage node designated to store a specific data element, and the specific data element is the first reference node that wants to go Accessor. 6. The method of claim 5 in the patent application scope, wherein at least the first reference section Page 53 1223167 Case number 89112368 Sixth, the scope of patent application __ points can gradually increase the storage of messages from the local area network, and these messages are directed to the first node > funds from the heart detection ... other nodes than points. 7. According to the method of the scope of the patent application, the method step 5 stores the information from the local area network ^ 'wherein the first reference node message-by-message is only the information detected by the first reference node w, and these If the scope of the patent application is ~, then (d) when you want to access it for the first time-and then include the following steps ... 126 ~ the consistency of the storage element is designated as the storage / child node consistency And—monitor the node to obtain the first = μ at the first—reference node, a duplicate backup of 7L pieces. Μ a storage node, which obtained the first and the first patent application scope of the paint network ^ less-the first reference node, ', Λ includes the following steps: Information obtained by using multiple messages ^ depending on the node is ; ί two specific nodes and will be: the health festival section that Guangmu has just arrived-is specified; = see two: and the supervisor (and the decision of the corresponding data element of Taipa) at least in The first inflammation of the # sexually designated health-specific? Data _, take this information for the purpose of the enterprise, but the 4th-the reference node wants to access Page 54 1223167 _ case number 89112368 _ year month day __ Sixth, the scope of patent applications. 10. The method according to item 9 of the scope of patent application, wherein at least the first reference node can gradually increase the information obtained from the area network for message detection, and the information is directed outside the first reference node. Other nodes. 11. The method according to item 9 of the scope of patent application, wherein the first reference node gradually stores information obtained by detecting the information from the local area network, and the information is only directed to the first reference node. 1 2. The method according to item 1 of the scope of patent application, further comprising the step of designating each monitoring node to store a group of data elements having a common universal resource addresser (URL) information. 1 3. The method according to item 11 of the patent application scope further includes the step of designating a plurality of monitoring nodes to give a subset of a set of data elements according to a subdivision of a common resource locator (URL) information. 14. The method according to item 9 of the scope of patent application, further comprising the following steps: (f) sending a request from the first reference node to the identified monitoring node to identify the storage node of the data element. 15. The method according to item 14 of the scope of patent application, further comprising the following steps: (g) sending a specified data element from the identified monitoring node Page 55! 223167 _Case No. 891123fiR Sixth, the message of consistency of the patent application storage node 'to the first-(i), (h) The request from the first reference node to: secondary examination points; to The duplicate preparation (1) of the storage node identified by the message (1) is from the identified storage node, and a backup is made. The 16-point nature of the data element is the method described in item 14 of the scope of patent application. U) At the identified monitoring node, ^ one includes ^ the following steps: receiving a storage of an identification data element a specific Reference section (h) If the monitoring node lacks a data element: Yong Yong, and the monitoring node designates a specific storage node that is consistent with the storage node of Fanfan ~. ^ Points, as the required capital 17, such as the method of applying for the scope of the patent No. 16, (i) if a specific reference node to obtain =-column I steps: If the copy fails, the specific reference node issues a self-promotion The preparation of the view node is repeated to cancel the designation of the specific reference node == the second break identified by the monitor node. * 、, accounting for the storage of S as a shell material component 18: ==: "quote" method, the second point of the shirt point & the first reference point is only stored in the first test a reference Lang Send a message to the child node of the local plural node in the local network, request :: middle, less than all, or "quote", which is designated to identify the data. —89112368 Car month VI. Patent application ^ ^ ~ ± 一 ·-Consistency of monitoring node of cattle storage node 19 > Method of receiving item 18 'and including the following steps: Node response sent to the local network 2. Requires confirmation of the Λ heart of ± 1 ±, unable to correctly identify the storage node, and the district test * attempts to check a primary lean component from the first test node through the wide area network, (h); 丨The cache memory; and the local consistency of the test point) The first reference node designates itself as a special feature. For the storage of the sturdy parts, 20, · The method of applying for the scope of the patent, and then () ) If the first reference section includes the following steps: Confirm the storage of H-consistent P Issued from any monitoring node for the purpose of Jm point and cannot identify a specific data element, a storage node of a data element that contains and is used as a data element L) information, and the same as the general resource locator. In the method of item 8, each of the deer's multiple monitoring nodes includes the following steps: · The heart and dish nodes are indeed based on the first reference node,-the wrong reason indicates that the information returned by each individual Component monitoring Page 57 1223167 Case No. 89112368 Amendment VI. The scope of patent application depends on the node and responds to the first reference node that sends the message; and (h) The first reference node selects the best responding The monitoring node is regarded as the monitoring node of the data element. 2 2. If the method of the scope of patent application No. 21, further includes the following steps: (i) within a specific period after the first reference node sends a message, in the first reference The node collects a response to every message sent by the monitoring node; and (j) Select the best monitoring node from the collected information according to a predefined criterion. 23. The method according to item 22 of the scope of patent application, wherein the best monitoring node selected by the first reference node is the one that can identify the maximum number of data elements that have common universal resource locator (URL) information and are the first Who the reference node wants to retrieve. 24. The method according to item 22 of the scope of patent application, wherein the best monitoring node selected by the first reference node is that the information received by the first reference node is received by the first reference node before other messages from other responding monitoring nodes. Monitoring nodes. 25. If the method of item 1 of the patent application scope further includes the following steps: (d) designating a plurality of nodes as storage nodes for a plurality of data elements; and Page 58-Case No. Ml 19? Amendment VI. Patent application n S ^ Maoyue (e) 4th, a plurality of nodes, each monitoring node, #: 5 is a monitoring summary of a plurality of data elements. The consistency of a data element, or a storage node provided to a specific, designated storage node, is that the data element contains the desired i of the plurality of data elements and responds to the reference node's issue and identification. The storage node 2 of the data element is a request to be accessed by the corresponding temple node. 2 6. If there is a patent application method, the method includes the following steps: When there is no reference node in the plurality of data elements, but it is lacking, it is decided to use two. The copy and backup storage node of a specific data element is not currently right = J stores a specific point of the specific data element, in a period longer than the specific storage data element, and then the time period of the first-reference section is longer. / Reproduced by a data element capable of providing a specific data element: 'that is, fetching from the -server node the multiple times φ, 丨 — a reference node that this particular (g) will operate on; and a shell of 70 pieces Copy the backup and store it in the _hth complex number, depending on a specific monitoring node in the node. The reference point is regarded as the storage section of the specific data element: "The 27. The item (0 divides a plurality of nodes into the following steps: a number of sub-sets without a point; a number of non-overlapping, non-empty e) perform step (b) on the parent node of each sub-set to form the 59th Page 1223167 _Case No. 89112368 6. The scope of patent application is a plurality of virtual cache memories. The memory and its reason are: only a subset of the virtual cache can be linked together to form ^. The: collection Cache memory (f) of a given point specifies a plurality of storage names M — u — Zhong Miao Liu 々 A 即 points' parent storage nodes are the storage of specific data elements 糸 Λ- tol te / L »L 'and * for the same thousand rally " ίΛ 甘 / 1 point k for other references of specific data elements ^ ^ X ^ D W copying backups' while the mother goes to want to access but lacks The long 4 test point is a copy of the data backup of the respective data elements in the r machine, which specifies the storage node, which does not add a point, the backup is required to access the I II ~ /,, and the poor Material elements are removed ^ Take the individual reference points of the same child of the special data element to make separate changes.杲 σ 的 2 8. If the method of applying for a patent for a patent (范 27) method, including the following steps: 夂 者 # 点 沾, /, a copy of the data element of the temple to a specific backup During the Cangkao point-of-click process, the ^% ▲ domain network sent a message; one of the plurality of nodes, the zone (h) and the reference rib κ 6 points, and the reference node is not a different set of sub-sets. This message should be ignored for each section of the collection. Every node in the virtual cache 2 9 If the patent patent application is cleared, (d) is one: the method of cutting out the item in item 1, and then includes the following steps. The data n is: point, the reference node obtains the special (e) / 1 from the storage node. At the point of execution, the node seeks to retrieve one or more data elements that contain specific data from a particular application. Page 60 Correction SS_ ^ 9j_12368 VI. Scope of patent application 30. A system that adapts the table from the server Lu Jiyi body to the local area network is designated as a storage node, but it lacks data components and provides a point. , Want to access and a plurality of cache memory entities to form a node to copy a reference node to provide a single area of memory is keyed in which the specified specific data element P point is available for use The area of the data element 'includes: a plurality of nodes, the plurality of nodes including = special nodes, which permanently store a copy of a specific data element backup to a plurality of other reference sections of the specific data element: that is, ^ contains Each node of the plurality of nodes has its existing cache memory, at least some of which are cached into a single virtual cache memory, as storage nodes, and will not provide a backup to those who want to access the specific data element. Independence changes. '3 as in the patent application system No. 30 system, in which a plurality of nodes are repackaged M It Z to selectively obtain data elements from the server node-when copying backup copies of poor materials, it can be downloaded from the server The node obtains the duplicate copy of the bull: Although it takes less time to obtain from the virtual cache memory, the: ^ server node takes less time. Than 32, such as the system of the 31st patent scope, where multiple nodes are repackaged Page 61 1223167 Case No. 891123BS Sixth, the scope of the patent application is to amend a first reference node, which can make a copy of your files and back up the specific resources; 卽: Obtain: the specific data tuple contains one or more Access operation ·, 'Implementation of copy backup execution — Lost-point ~ 3: Take: Missing copy backup of the specific data element, but must provide specific: $ for the reference of the specific data element After the node. 'Fan Niu's copy is backed up to the first 33, such as the scope of the patent application, including the 31st item of the system', where a plurality of nodes are then assigned to a specific data element, each reference node sent to identify a specific time: _ 印At this point, the monitoring node asks to provide the specific node and the specific secondary storage node's requirements to respond to it. The consistency of the storage nodes of the component 34, such as the scope of patent application 33: system, system, wherein the plurality of nodes include a first reference node that gradually stores information from the local area network, which, or Multiple messages to get other-specific nodes as-monitoring messages are used to identify the storage node Λ that stores the corresponding data element. That is, the point is designated to identify-some information in order to try to identify a specific ==: reference Nodes also access and the specific data element is the storage node of the first-lean component, the reference node wants to access. 1223167 _New 89112 details VI, patent application scope 35, such as the patent application scope item 34 system, its nodes can be gradually increased from the local area network ^ from; ^ ~ 苐 ~ reference information These messages are directed to the-reference Node two; ::? Arrivals 』Hachitaro. 36. If the application for patent No. 34 is related to paper or paper, can the information be sought? Increasingly stores messages from the local area network; the reference nodes and these messages only point to the first reference node. The capital 37 in 1 丨 includes a plurality of nodes including a system-first storage node such as the 30th in the scope of patent application, which is designated to owe a first monitoring node and is referred to as the first shell material element; The reference section of the component. Point and mark the section to look at the 2nd information-the first-reference node, which wants to access Qiaofu :; and the first monitoring node obtains the first storage = first_be The component can be identified from the first node or the first reference node from the first storage node. · The second preparation of the first data element 2: such as the system of the 30th scope of the patent application, in which a plurality of node packages ~ / > day ^ ~ a first reference bar of information from the local network, , Or even a message, and a specific node is continued as-for each detected message in the loss μ ^, the point of view, the monitoring node is designated to 1223167 Amendment No. 89112368 Sixth, the scope of the patent application stores some information about the specific information, and for this specific information 39, if you apply for a special node, you can gradually increase the information, and if such information 40, you can gradually increase the number of The information is only the storage node of the component. What I am trying to identify is that the specific node also accesses the component. This is the storage node of the 2 2 3 pieces. Refer to the point where you want to access. The red reference of item 38 of the scope of interest is added to store at least the first reference information in E :, /, and the data obtained by pointing to the first reference point > other nodes than the test point. The system of item 38 of the profit range stores the information obtained from the f a _ co-operation of the first reference node _ & $: 2. The information obtained from the detection of the road information is sent to the first reference node. 41. If the scope of the patent application is 30th, the system of “M, M, Day,” further includes one or more monitoring points, and the parent-monitoring node is a 7-element blessing element. Leather buckle to a set of resources with a common URL and information; t it: the system of patent enclosing item 40, and then including a plurality of monitoring sections and other designated materials (1vlslQn)), and the other I3 as t 凊The system of item 38 of the patent, in which the # -reference node ί sends a request to the identified monitoring node to identify the storage point of the data element. τ On page 64-a case /, the scope of the patent application ^, if the application node is in the same storage node as the storage node and from the identified =, if the application node is in the slave node Requirement, storage of Lang point uniform material components The profit range is a reference; the storage of a profit range is issued, and the identified ’is also a node. f4 item 3 system, in which the identified surveillance point sends a message to indicate the storage of the data element, where the first reference node is requesting a copy of a data element from the message identification f, although the point receives the Copy backup of data components. Item 43. The system in which the identified monitoring reference node receives to identify the storage of the data element. If other monitoring nodes lack the storage of the data element, the specific reference node is designated as the required asset. In the storage section 47 of the information element sent by the video node to obtain data, if the patent application is also issued on the local network, the information of the sub-collection of the sub-collection cannot be identified. The system designated to identify the data range of item 4 and 5, in which the specific When the component backup fails, it is used to cancel the designation of the specific reference node point. The system of the scope item 38, wherein the first output points to a message containing less than all or OR, and when the first reference node only uses the monitoring node of the lean component, the consistency of the storage node of the requested component is requested. The reference section identified is used as the reference node. All the nodes are stored. It is recognized as a 48, as in the application of the patent scope of item 47. Among them, if the first reference node Page 65 Λ Day--New York 89m 6. The scope of the patent application is in response to the transmission of the local network's ^ ~ ^: domain, method to correctly identify the storage node;; 5: the consistency of the node is signaled by the wide area network from a A reference node that is connected to the local area network tries to pass the data element, and then fetches the data node and the storage node of the desired data. 'Ti Li 4th' itself is the specific data element 4 9 As stated in the scope of patent application No. 48 top, there is no monitoring insert #, 二 ,,, where, if the first reference node is from 1, # 皿That is to point out that the storage node M ^., · Information, which leads to the identification of the consistency of the storage node ^ 2 is required to confirm the consistency of the monitoring node: 2: from the J network; Designate itself as a data element, or a storage node containing ::: a specific test section containing data elements with common url information. The system includes a patent correction system as described in the above, wherein a plurality of nodes include a plurality of i-view nodes' and each monitoring node is responded with a message to indicate a corresponding response supervisor. The monitoring node of the raw material element specified by the reference node of the basin, and the first reference node is also selecting the monitoring node that responds best, and the monitoring node of the component. Tian Zuozi 51. If the system of the scope of patent application No. 50, where the _ reference also collects from the response monitoring section = issued within a specific time after the message is sent. Page 66 1223167 _Case No. 89112368_ Year Month Amendment_ VI. For each message in the scope of patent application, and select the best monitoring node from the collected messages according to a predetermined standard. 52. The system according to item 51 of the scope of patent application, wherein the best monitoring node selected by the first reference node is the one that can identify the largest number of data elements. They have common URL information and the first reference node wants to retrieve it. To take. 5 3. According to the system of claim 51 in the scope of patent application, the best monitoring node selected by the first reference node is that the other reference node's message is received by the first reference node before other messages sent by the responding monitoring node. Monitoring nodes. 54. If the system for applying for item 30 of the patent scope, the plurality of nodes include: A plurality of storage nodes designated to store a plurality of data elements; and a plurality of monitoring nodes designated as a plurality of data elements, each monitoring node providing a specific storage node as a desired data element, or a group The data element contains the consistency of a storage node of the desired data element, and responds to the request from the reference node to identify the storage node of one of the plurality of data elements that the reference node wants to access. 55. If the system of claim 54 is applied for, the plurality of nodes includes: a first reference node that wants to access but lacks the plurality of nodes Page 67--Serial No. 89112368 VI. Scope of patent application-poor = a specific piece of information in the component j: decided to be designated to store i.e., ..., and there is no data door to store the content ^ than that specific storage Nodes can prepare f-points from a complex of one = for a longer time interval, and use the extracted and stored in the first reference node, ί :! One of the multiple monitoring nodes in the plurality of monitoring nodes as a specific The 6th element of the data element belongs to the 30th of the patent scope. The non-overlapping and non-intermediate net set is composed of several virtual versions: several virtual cache memories, = memory, where each virtual The cache of the nodes of the I set is recorded from a special storage node, each storage node ~ ###, and a duplicate backup of the same: i ::! The designation of the storage points of the respective data elements will not be changed individually for those who want to access the "solid reference point." A copy of the correction copy will be backed up if the first reference to the specific data element A specific storage of 70 pieces, then the first reference node, the elapsed time server node that provides the specific data component retrieves the specific data, the specific data component, copies the backup, stores the specific monitoring node, and designates the first storage node. It also includes: the nodes of the nodeless sub-collection, which are cut off; including each sub-collection, which has a virtual cache memory, the reason is: only the memory body is linked to form a storage node system, which is designated It is used to store each child, and other reference nodes are provided. Each reference node is a node that wants to save a duplicate backup. T provides a specific data element. 1223167 _ Case No. 89112368 _ revised month of the year _ 6, the scope of the patent application 5 7, according to the scope of the patent application of the 56th system, where one of a plurality of nodes, a copy of a specific data element to provide a backup copy to In the process of a specific reference node, a message is sent on the local area network; and each node in the subset different from the subset to which the reference node belongs, and each node in the virtual cache memory different from the reference node, Should ignore this message. 58. The system according to item 30 of the scope of patent application, wherein the plurality of nodes include: a browsing node that executes a browser application program to retrieve one or more data elements containing specific data elements from other nodes; And a reference node, which obtains the specific data element from the storage node for a browsing node. Page 69