CN101399688A - Publishing method and device for distributed region lookup zone - Google Patents

Publishing method and device for distributed region lookup zone Download PDF

Info

Publication number
CN101399688A
CN101399688A CN 200710162705 CN200710162705A CN101399688A CN 101399688 A CN101399688 A CN 101399688A CN 200710162705 CN200710162705 CN 200710162705 CN 200710162705 A CN200710162705 A CN 200710162705A CN 101399688 A CN101399688 A CN 101399688A
Authority
CN
China
Prior art keywords
node
distributed
find
lookup
area
Prior art date
Application number
CN 200710162705
Other languages
Chinese (zh)
Inventor
管红光
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN 200710162705 priority Critical patent/CN101399688A/en
Publication of CN101399688A publication Critical patent/CN101399688A/en

Links

Abstract

The invention discloses an issue method of a distribution-typed region searching range, which comprises the steps as follows: according to the upper limit of the distribution-typed region searching range and the node identification of the node, nodes to be issued are selected in the distribution-typed region searching network; the distribution-typed region searching range is issued to the nodes to be issued; the distribution-typed region searching range is issued to the neighborhood nodes of the nodes to be issued. The invention also discloses a searching method used for the distribution-typed region, a distribution-typed region searching network and a node. The distribution-typed region searching range carries out the distribution-typed issuance by continuous section on the distribution-typed region searching network, and compares the searching value with the range value in the nodes reached by a final route during the searching process, and achieves the object that the distribution-typed region searching on the distribution-typed region searching network is carried out without saving the content information of the share resource of the nodes by a content server; therefore, the system expense is reduced, and the reliability and the safety of the system are improved.

Description

一种分布式区域查找区间的发布方法及装置技术领域本发明涉及网络技术领域,特别是涉及一种分布式区域查找区间的发布方法及装置。 A distributed area to find the section issuing method and apparatus TECHNICAL FIELD The present invention relates to network technologies, and particularly to a method and apparatus for distributed publishing area Search section. 背景技术随着网络技术的迅速发展,互联网系统的P2P (Peer-to-Peer,对等计算) 模式得到广泛的应用。 BACKGROUND With the rapid development of network technology, P2P Internet system (Peer-to-Peer, peer computing) model has been widely used. 在对等计算系统中,需要实现区域查找的功能。 In the peer computing systems, the need to achieve functional areas to find. 区域查找是指对于一个给定的值,找到系统中所有覆盖该给定值的区间。 Means for area to find a given value, the system section to find a given value of all the overlay. 例如在VOD (Video On Demand,点播)中,给定点播的时间点5分钟,则在所有发布了的资源中,查找覆盖了5分钟的区间。 For example, in VOD (Video On Demand, VOD), on-demand to the point of time given for 5 minutes, then released all resources, find cover a five-minute intervals. 目前, 一般采用目录集中式方法进行分布式区域查找。 At present, the commonly used method for distributed directory centralized area to find. 该方法是指网络中的所有活动节点都把自己共享资源的目录信息发布到目录服务器上,查找时,在目录服务器里进行数据库查找,从而发现所需要的区间。 This method means that all active nodes in the network see themselves published shared resource directory information to the directory server, when looking for, look in the directory server database in order to find the desired interval. 采用该方法时,目录服务器保存着网络中所有活动节点的共享资源的目录信息。 When using this method, the directory server holds directory information network shared resources all active nodes. 当需要查询某个文件时,用户节点向目录服务器发出文件查询请求,目录服务器进行相应的检索和查询后,返回符合查询要求的目的节点信息。 When the need to query a file, the user node sends a query request file, directory server to the appropriate search and query the directory server, the query returns in line with the requirements of the destination node information. 用户节点接收到应答后,根据目的节点信息,和目的节点建立连接,并开始文件传输。 After the user node receives the response, according to the destination node information, and the destination node to establish a connection, and starts the file transfer. 以用户节点从网络中获取一个音乐文件的过程为例,网络中的目录服务器保存着网络中所有活动节点上传的音乐文件索引和存放位置的信息。 User node acquires a music file from the network process, for example, the network directory server maintains information indexing and storage location of the music files of all active nodes in the network upload. 当该用户节点需要获取一个音乐文件时,首先连接到目录服务器,在目录服务器进行检索,并由目录服务器返回存有该音乐文件的目的节点的信息,然后该用户节点直接连到目的节点获取该音乐文件。 When the user node needs to obtain a music file, first connect to the directory server, retrieve the catalog server, directory server returns the information of the destination nodes on which the music file, then the user is directly connected node to the destination node to acquire the music files. 在实现本发明过程中,发明人发现现有技术中至少存在如下问题:当采用目录集中式方法进行分布式区域查找时,需要目录服务器存放网络中所有活动节点的共享资源的目录信息,容易造成单点故障,如果目录服务器瘫痪, In implementing the present invention, the inventor finds at least the following problems in the prior art: When using a distributed directory area to find the centralized approach, requires the directory server to store information in the network directory shared resources all active nodes, likely to cause single point of failure, if the directory server to its knees,

则会造成整个系统崩溃,可靠性和安全性较低。 It will cause the entire system to crash, reliability and less secure. 而且由于节点的随意加入和离开,需要不断的更新目录信息,造成目录服务器的开销很大。 And because the random nodes join and leave, need to constantly update the directory information, resulting in great cost directory server. 发明内容本发明实施例要解决的问题是提供一种分布式区域查找区间的发布方法及装置,在无需目录服务器保存节点的共享资源的目录信息的情况下,能够进行分布式区域查找。 The present invention to solve the problem of example embodiments provide a distributed area to find the release method and device range, in the case of shared resources directory information without having to save the directory server nodes can be distributed area to find. 为达到上述目的,本发明实施例的技术方案提供了一种分布式区域查找区间的发布方法,包括以下步骤:根据分布式区域查找区间的上限和节点的节点标识,在分布式区域查找网络中选择待发布节点;向所述待发布节点发布所述分布式区域查找区间;向所述待发布节点的邻居节点发布所述分布式区域查找区间。 To achieve the above object, the technical solutions of the embodiments of the present invention provides a distributed area to find the interval distribution method, comprising the steps of: identifying a node to find the node intervals and the upper distributed according to areas, distributed in regions lookup network select the node to be released; to be issued to the node issuing the distributed area to find the range; to be released to the neighbors of the node issuing the distributed area to find the range. 本发明实施例的技术方案还提供了一种分布式区域的查找方法,包括以下步骤:根据查找值和节点的节点标识,在分布式区域查找网络中获取待查找节点;根据所述查找值和所述待查找节点保存的分布式区域查找区间的上限,获取覆盖所述查找值的区间。 Technical solutions of the embodiments of the present invention further provides a method of finding a distributed region, comprising the steps of: a node identifier of the node and find a value, acquired lookup network node in a distributed area to be searched; according to the lookup value, and the storage node to be searched to find the maximum range of the distributed area, acquiring section covering the lookup value. 本发明实施例的技术方案还提供了一种分布式区域查找网络,所述网络中节点的最小节点标识到最大节点标识之间的范围,对应由业务特性决定的待查找区域的最大范围。 Technical solutions of the embodiments of the present invention also provides a distributed area to find the network, the network node of the smallest node identification range between the maximum node identifier, to find the maximum range of the region should be determined traffic characteristics. 本发明实施例的技术方案还提供了一种节点,包括待发布节点选择单元和发布单元;所述待发布节点选择单元,用于根据分布式区域查找区间的上限和节点的节点标识,在分布式区域查找网络中选择待发布节点,并将选择结果发送到所述发布单元;所述发布单元,用于向所述分布式区域查找网络中的节点发布所述分布式区域查找区间。 Technical solutions of the embodiments of the present invention further provides a node, the node comprising a selecting unit to be distributed and issuing unit; to be distributed node selecting unit for finding node identification and the node of the upper section of a distributed region, the distribution type regions lookup network publishing node to be selected, and the selection result is sent to the issuing unit; the issuing unit configured to locate the region distributed in the distribution network node distributed lookup segment region. 上述技术方案中的一个实施例具有如下优点:本发明实施例通过将分布式区域查找区间在分布式区域查找网络上进行连续分段的分布式发布, 查找时在最终路由到的节点里进行查找值和区间值的比较,实现了在无需目录服务器保存节点的共享资源的目录信息的情况下,进行在分布式区域查找网络上的分布式区域查找,减小了系统开销,提高了系统的可靠性和安全性。 One embodiment, the above technical solutions have the following advantages: the distributed embodiment by the area to find the interval to find continuous release segments distributed on the network in a distributed area, while looking at the final route to the node in the embodiment of the present invention to find comparison value and range of values, realized in the case of shared resources directory information without having to save the directory server node, look in the area of ​​distributed areas distributed on the network to find, reduce system overhead and improve system reliability and security. 附图说明图1是本发明实施例的一种分布式区域查找网络的结构示意图; 图2是本发明实施例的一种分布式区域查找区间的发布方法的流程图; 图3是本发明实施例的一种分布式区域查找区间的发布方法示意图; 图4是本发明实施例的另一种分布式区域查找区间的发布方法示意图; 图5是本发明实施例的一种分布式区域查找网络加入节点后的结构示意图;图6是本发明实施例的一种分布式区域查找网络离开节点后的结构示意图;图7是本发明实施例的一种分布式区域的查找方法的示意图; 图8是本发明实施例的一种节点的结构示意图。 BRIEF DESCRIPTION OF DRAWINGS FIG. 1 is a region of a distributed embodiment of the present invention to find a structural diagram of a network; FIG. 2 is a flowchart of a distributed embodiment of the present invention, regions lookup interval distribution method; FIG. 3 is an embodiment of the present invention Examples of a distributed area distribution method to find a schematic section; FIG. 4 is a schematic diagram of another embodiment of a distributed embodiment of the present invention, regions lookup interval distribution method; FIG. 5 is a distributed embodiment of the present invention regions lookup network after addition of a schematic structural diagram of a node; FIG. 6 is a schematic view of a distributed structure of the embodiment of the present invention, regions lookup network departure node; FIG. 7 is a schematic diagram of a distributed regions lookup method according to embodiments of the present invention; FIG. 8 It is a block diagram of a node according to an embodiment of the present invention. 具体实施方式下面结合附图和实施例,对本发明的具体实施方式作进一步详细描述: 本发明实施例的分布式区域查找网络可以是类Chord环、Pastry、 CAN、 Tapestry等结构化P2P网络,该网络中节点的最小节点标识到最大节点标识之间的范围对应由业务特性决定的待查找区域的最大范围(例如在VOD中,其业务特性为电影的长度为7200秒,则在与该电影对应的分布式区域查找网络中,节点标识最小的节点的节点标识为0,节点标识最大的节点的节点标识为7200),且所述网络采用结构化对等网络的路由机制。 DETAILED DESCRIPTION The following embodiments and the accompanying drawings, specific embodiments of the present invention will be described in further detail: a distributed embodiment of the present invention regions lookup network may be a class structure of a Chord ring, Pastry, CAN, Tapestry, etc. P2P network, the the lowest node identification to the network node area to be searched node identification range between the most traffic characteristics shall be determined on the maximum range (e.g. in the VOD, as the length of the film which service features 7200 seconds, corresponding to the film distributed regions lookup network, the node identifier of a node identifier of a node 0, a node identification node with the largest node ID of 7200), and uses the network routing mechanism structured P2P network. 以类Chord环网络为分布式区域查找网络为例,本发明实施例的一种分布式区域查找网络如图l所示,包括6个节点:节点标识为0的节点0、节点标识为3的节点3、节点标识为7的节点7、节点标识为13的节点13、节点标识为20的节点20和节点标识为50的节点50。 In the Chord ring type network regions lookup network for distributed, for example, a distributed embodiment of the present invention, the region shown in Figure l lookup network, including six nodes: node identification of the node 00, the node identifier of 3 node 3, node 7, node 7 is identified, the node 13 is identified as node 13, the node identifier of the node 20 and node 20 to node 50 identifying 50. 该网络中节点保存的分布式区域查找区间的上限小于或等于所述节点的节点标识,且大于所述节点的前续节点的节点标识。 The network node maintains a distributed area to find the maximum range is less than or equal to the node identifier of the node, and larger than the node identifier of the node before the renewal node. 其中节点3保存着A资源的分布式区域查找区间A[l〜35],节点7保存着A资源的分布式区域查找区间A (3〜35],节点13保存着A资源的分布式区域查找区间A (7〜35],节点20保存着A资源的分布式区域查找区间A ( 13~35],节点50保存着A资源的分布式区域查找区间A ( 20〜35]。如果有节点加入该分布式区域查找网络,则待加入节点保存的分布式区域查找区间为该待加入节点加入前该待加入节点的后继节点保存的查找区间上限小于或等于该待加入节点的节点标识的查找区间;该待加入节点的后继节点在该待加入节点加入后保存的分布式区域查找区间为上限为该待加入节点的节点标识的左开右闭区间。以节点标识为5的节点5加入该分布式区域查找网络为例,节点5的后继节点为节点7。节点5加入后,节点5保存着A 资源的分布式区域查找区间A ( 3〜35],节点7保存着A资源的分布式区 3 wherein the nodes holds A distributed resource regions lookup interval A [l~35], 7 holds node A distributed resource regions lookup segment A (3~35], 13 holds node A distributed resource regions lookup section a (7~35], node 20 holds the distributed resource regions lookup a section a (13 ~ 35], node 50 holds the distributed resource regions lookup a section a (20~35]. If a node joins lookup to find the upper range interval stored in the distributed region lookup network, saving the added node to be distributed before that area to find the interval to be added to the node is added to the node to be added is less than or equal to the successor nodes to be added to the node identifier of the node ; left successor nodes to be added to the node after the node is added to be added to the distributed storage area to find the range of the upper limit for the node to be added to the right of the opening and closing of the node identification section identifies the node to node 5 5 added to the profile. type regions lookup network, for example, the successor node succeeding node to node 5 7 5 added node, node 5 holds the distributed resource regions lookup a section a (3~35], 7 holds node a distributed resource region 域查找区间A (5〜35]。如果有节点离开该分布式区域查找网络,则4寺离开节点的后继节点保存的分布式区域查找区间为该待离开节点保存的查找区间。以节点7离开该分布式区域查找网络为例,节点7离开后,节点13保存着A资源的分布式区域查找区间A (3~35]。本实施例通过在分布式区域查找网络上,连续分段地保存分布式区域查找区间,使得在查找时可以在最终路由到的节点里进行查找值和区间值的比较,实现了在无需目录服务器保存节点的共享资源的目录信息的情况下,进行在分布式区域查找网络上的分布式区域查找,减小了系统开销, 提高了系统的可靠性和安全性。本发明实施例的一种分布式区域查找区间的发布方法的流程如图2所示, 本实施例中假设节点50将B资源的分布式区域查找区间B[2, 15]发布到图1 所示的分布式区域查找网络。参照图2,本 Domain lookup segment A (5~35]. If there is a node leaves the network distributed lookup region, leaving the temple 4 stored successor node for a distributed area to find the interval to be stored in the node to leave the lookup segment. 7 away from the node the distributed network as an example to find the region, after leaving node 7, node 13 holds the distributed resource regions lookup a section a (3 ~ 35]. in this embodiment, the network lookup continuously stored in the distributed region sectionally distributed area to find the range that can be compared to find the value and range of values ​​in the final routed to nodes in when looking to achieve in the case of shared resources directory information without having to save the directory server nodes in a distributed area Find the area network for distributed, system overhead is reduced, improving the reliability and security of the system. an embodiment of the distributed area to find a flow distribution method section of the present invention embodiment shown in Figure 2, the present embodiment the example assumes that node 50 to find the distributed resource region B B interval [2, 15] releases distribution area shown in FIG. 1 to find the network. Referring to FIG. 2, the present 实施例包4舌以下步骤:步骤s201,根据分布式区域查找区间的上限和节点的节点标识,在分布式区域查找网络中选择待发布节点。如杲所述分布式区域查找网络中的节点的节点标识大于或等于所述B资源的分布式区域查找区间的上限,且所述节点的前续节点的节点标识小于所述B资源的分布式区域查找区间的上限,则 The procedure of Example 4 Tongue embodiment the package: the step S201, according to the node region identifier to find the maximum range of distributed nodes and, lookup network publishing node to be selected in a distributed area as the distributed region Gao find a node in the network. node B identity greater than or equal distributed resource region to find the maximum range, and the node identifier continued node B is smaller than the distributed resource region to find the maximum range, then

所述节点为待发布节点。 The node is the node to be distributed. 由于本实施例中所述B资源的分布式区域查找区间为B[2, 15],其上限为2,而节点标识3大于2,且节点标识0小于2,所以选择节点3为待发布节点。 Since the present embodiment, the distributed resource region B B lookup interval [2, 15], an upper limit of 2, 3 is greater than 2 and the node identifier, the node identifier 0 and less than 2, the node 3 is selected to be distributed node . 步骤s202,向待发布节点发布分布式区域查找区间。 Step s202, release distributed to the area to find the range to be distributed node. 即节点50将所述B 资源的分布式区域查找区间B[2, 15]发布到节点标识为3的节点。 I.e. the Node B 50 to the distributed resource region to find the interval B [2, 15] to publish a node identification of the node 3. 步骤s203,判断是否继续发布所述分布式区域查找区间,如果是,则转步骤s204,否则结束。 Step s203, determine whether to continue publishing the distributed area to find the range, and if so, go to process s204, otherwise ends. 其判断过程为:如果所述^f寺发布节点的节点标识小于所述分布式区域查找区间的下限,则继续发布所述分布式区域查找区间。 Which process is determined as follows: if the publisher node ^ f Temple identifier is smaller than the lower limit of the distributed area to find the range, the release continued to find regions distributed interval. 本实施例中由于所述B资源的分布式区域查找区间的下限为15,而节点3的节点标识3小于15,所以继续发布所述分布式区域查找区间B[2, 15]。 Examples lookup segment due to the distributed resource region to the lower limit of the present embodiment B 15, the identity of the node 3 is less than 15 3, the continued release of the distributed area Search section B [2, 15]. 步骤s204,向所述待发布节点的后继节点发布所述分布式区域查找区间, 并转步骤s203。 Step S204, the publishing node of the distributed area to be distributed to the successor node lookup segment, and go to step s203. 其发布方法分为两种方式:一种方式为:首先区间发布节点从待发布节点获取所述待发布节点的后继节点的地址,然后区间发布节点根据所述待发布节点的后继节点的地址, 将大于所述待发布节点的节点标识的值发布到所述待发布节点的后继节点。 Its release method is divided into two ways: one way: First, the node address acquiring section publishing node to be distributed from the node of the subsequent node to be released, and then release the address range to be the successor node of node according to the publishing node, value of the node ID will be greater than the publishing node to the subsequent node of the publishing node to be distributed. 以向节点7发布为例,节点3将节点7的地址发送到节点50,节点50根据节点7的地址,将大于3的值发布到节点7,即将B资源的分布式区域查找区间B (3〜15]发布到节点7。采用该方式,节点50将区间B[2, 15]发布到该分布式区域查找网络的过程如图3所示。发布完成后,节点3保存着B资源的分布式区域查找区间B[2~15],节点7保存着B资源的分布式区域查找区间B(3~15],节点13保存着B资源的分布式区域查找区间B (7〜15],节点20 保存着B资源的分布式区域查找区间B ( 13~15]。另一种方式为:待发布节点将大于所述待发布节点的节点标识的值发布到所述待发布节点的后继节点。以向节点7发布为例,节点3将大于3的值发布到节点7,即将B资源的分布式区域查找区间B (3~15]发布到节点7。 采用该方式,节点50将区间B[2, 15]发布到该分布式区域查找网络的过程如图4所示。发布完成后,节 Example 7 In the publishing node, the address of the node 3 to node 7 to node 50, node 50 node address 7, the release value greater than 3 to node 7, i.e. the distributed resource region B lookup section B (3 ~ 15] published to node 7. in this manner, node 50 will range B [2, 15] to publish the distributed network of regions lookup process shown in Figure 3. after completion of release, node 3 B holds resource distribution formula area Search section B [2 ~ 15], the node B 7 holds the distributed resource regions lookup section B (3 ~ 15], the node B 13 holds the distributed resource regions lookup segment B (7~15], node B 20 holds the distributed resource regions lookup segment B (13 ~ 15] another way: publishing node will be greater than the value of the node to be identified by the publishing node to the subsequent node of the publishing node to be distributed. Example 7 in the publishing node, the node 3 will release value greater than 3 to node 7, i.e. the distributed resource region B lookup section B (3 ~ 15] published to node 7. in this manner, the node B 50 to the interval [ 2, 15] to publish the distributed network of regions lookup process shown in Figure 4. after the completion of release, section 3保存着B资源的分布式区域查找区间B[2~15], 节点7保存着B资源的分布式区域查找区间B (3〜15],节点13保存着B资 B 3 holds the distributed resource region to find the interval B [2 ~ 15], the node B 7 holds the distributed resource regions lookup segment B (3~15], the node B 13 holds funding

源的分布式区域查找区间B (7~15],节点20保存着B资源的分布式区域查找区间B (13~15]。如果有节点加入分布式区域查找网络,则待加入节点的后继节点将分布式区域查找区间上限小于或等于待加入节点的节点标识的分布式区域查找区间发布到所述待加入节点,且所述后继节点的分布式区域查找区间修改为上限为所述待加入节点的节点标识的左开右闭区间。当采用图1所示的分布式区域查找网络时,以节点标识为5的节点5加入该分布式区域查找网络为例, 节点7将A资源的分布式区域查找区间A (3~35]发布到节点5,且节点7 的A资源的分布式区域查找区间修改为上限为5的左开右闭区间,即节点7 保存的A资源的分布式区域查找区间变为A ( 5〜35]。节点5加入该分布式区域查找网络后,该网络的结构如图5所示。其中节点3保存着A资源的分布式区域查找区间A[l~35],节点5保 Distributed source regions lookup section B (7 ~ 15], the node B 20 holds the distributed resource regions lookup segment B (13 ~ 15]. If the area to find a node joins the distributed network, the node to be added to the successor node distributed node identification area to find the area of ​​distributed nodes to be added is equal to or less than the range limit of the lookup node to be added to the release section, and the region successor nodes distributed lookup segment to be modified to an upper limit of the added node left and right node identifier opening and closing section when the distributed regions lookup network shown in Figure 1, the node is identified as node 5 5 added to the distributed network area to find, for example, 7 a distributed resource node Find section area a (3 ~ 35] published to node 5 and node 7. a distributed resource regions lookup segment modified to limit the right to the left of the opening and closing sections 5, 7, node a resource distributed storage regions lookup after the interval becomes a (5~35]. 5 node is added to the distributed network area to find the structure of the network is shown in FIG. 3 which holds the distributed resource region a node searches interval a [l ~ 35] , node 5 Paul 存着A资源的分布式区域查找区间A(3~35],节点7保存着A资源的分布式区域查找区间A (5~35],节点13保存着A资源的分布式区域查找区间A ( 7~35],节点20保存着A资源的分布式区域查找区间A ( 13〜35],节点50保存着A资源的分布式区域查找区间A(20〜35]。如果有节点离开分布式区域查找网络,则待离开节点将保存的分布式区域查找区间发布到所述待离开节点的后继节点。当采用图1所示的分布式区域查找网络时,以节点7离开该分布式区域查找网络为例,节点7将保存的A 资源的分布式区域查找区间A (3〜35]发布到节点13。节点7离开该分布式区域查找网络后,该网络的结构如图6所示。其中节点3保存着A资源的分布式区域查找区间A[l〜35],节点13保存着A资源的分布式区域查找区间A (3〜35],节点20保存着A资源的分布式区域查找区间A ( 13~35],节点50 保存着A资源的分布式区域查 Retain a distributed resource regions lookup A section A (3 ~ 35], 7 holds node A distributed resource regions lookup segment A (5 ~ 35], the node 13 holds the distributed resource regions lookup A section A ( 7 to 35], the node 20 holds the distributed resource regions lookup a section a (13~35], node 50 holds the distributed resource regions lookup a section a (20~35]. If there is a distributed node leaves the region lookup network, the node will be stored in the distributed departure area to find the successor node of the departing node to be published to the interval when the distributed region shown in FIG. 1 to find the network, the node 7 away from the area to find the distributed network after, for example, node 7 distributed resource region a stored lookup segment a (3~35] posted to the node 13. the node 7 leave the area to find the distributed network, the network structure shown in Fig. node wherein 3 holds a distributed resource regions lookup interval a [l~35], 13 holds node a distributed resource regions lookup segment a (3~35], 20 holds the node a distributed resource regions lookup segment a (13 to 35], a resource node 50 holds a distributed search area 区间A (20~35]。本实施例通过将分布式区域查找区间在分布式区域查找网络上进行连续分段的分布式发布,使得在查找时可以在最终路由到的节点里进行查找值和区间值的比较,实现了在无需目录服务器保存节点的共享资源的目录信息的情况下,进行在分布式区域查找网络上的分布式区域查找,减小了系统开销,提高了系统的可靠性和安全性。本发明实施例的一种分布式区域的查找方法如图7所示,本实施例中假设节点0需要在图1所示的分布式区域查找网络中查找A资源的值5。 Section A (20 ~ 35]. In this embodiment, the distributed regions lookup segment look continuous release segments distributed on the network in a distributed area, making it possible to find the value in the final route to the node and when looking in comparison interval values, realized in the case of shared resources directory information without having to save the directory server node, look in the area of ​​distributed areas distributed on the network to find, reduces system cost and improve system reliability and security, distributed regions lookup method of the embodiment of the present invention is shown in Figure 7, this embodiment is assumed that the node a 0 resources need to look to find the value of the distributed network region 5 shown in Figure 1 of the present embodiment. 参照图7,本实施例的查找过程为:首先根据查找值和节点的节点标识,在分布式区域查找网络中获取待查找节点,如果所述查找值小于或等于节点的节点标识,且到所述节点的节点标识的距离最小,则所述节点为待查找节点;然后根据所述查找值和所述待查找节点保存的分布式区域查找区间的上限,获取覆盖所述查找值的区间,如果所述查找值大于所述待查找节点保存的分布式区域查找区间的上限,则所述查找区间为所述覆盖查找值的区间。 Referring to FIG. 7, the search process according to the present embodiment as follows: The first node identification and the lookup value nodes, looking up in a distributed LAN lookup node to be acquired, if the node to find a node identification value or less, and to the node ID from a minimum of said nodes, said node is a node to be searched; then, according to the lookup value and the storage node to be searched to find the maximum range distributed area, acquiring section covering the lookup value, if Find the stored value is greater than the node to be searched to find the maximum range distributed region, then the lookup is a section of the cover section lookup values. 本实施例中,根据Chord的路由,查找值5路由到节点7,由于查找值5小于节点标识7,且查找值5到节点标识7的距离最小,进一步查找值5大于该节点保存的区间A (3〜35]的上限3,因此区间(3〜35]覆盖了查找值5,发布该区间的节点50可以为节点0 4是供服务。本实施例中该分布式区域查找网络的路由采用Chord的路由机制,其路由过程可以为:该分布式区域查找网络中的节点保存着该节点的successor(后继节点,顺时针方向上该节点后面的相邻节点)和predecessor (前续节点, 顺时针方向上该节点前面的相邻节点)的信息,当某个节点比如节点0要查找A资源的值5的信息时,节点0首先要找到负责管理A资源的值5的节点。 首先节点0询问节点0的successor,即节点3;如果节点3不负责管理A资源的值5,则节点3询问自己的successor,即节点7。该操:作反复进行,直至找到负责管理A资源的 In this embodiment, the routing of Chord, the lookup value 5 is routed to node 7, since the lookup value 5 is smaller than the node identifier 7, and the lookup value from 5 to node identification 7 is minimal, further lookup value greater than 5 stored in the node section A (3~35] the upper limit of 3, so the interval (3~35] 5 covering the lookup value, the section 50 of the publishing node may be a node 04 is available for service area of ​​the distributed routing lookup network embodiment of the present embodiment uses Chord routing mechanism, which may be a routing process: the distributed nodes in the network to find the region holds the successor node (the successor node, the node behind the adjacent node in the clockwise direction) and predecessor (before the renewal node, cis the front of the adjacent node node-clockwise direction) of information, when the information such as a node to node 0 find a resource value of 5, to find the first node 0 node is responsible for managing resources a value of 5 first node 0 interrogating node successor 0, ie node 3; if the value of the node 3 is not responsible for managing the resources of 5 a, the node 3 to ask his successor, namely node 7. the operation: for repeated until a is responsible for managing resources found 5的节点。本实施例通过在连续分段地保存着分布式区域查找区间的分布式区域查找网络上,进行分布式区域的查找,使得在查找时可以在最终路由到的节点里进行查找值和区间值的比较,实现了在无需目录服务器保存节点的共享资源的目录信息的情况下,进行在分布式区域查找网络上的分布式区域查找,减小了系统开销,提高了系统的可靠性和安全性。本发明实施例的一种节点的结构示意图如图8所示,包括待发布节点选择单元81、判断单元82和发布单元83;其中发布单元83分别与待发布节点 Node 5. In this embodiment, the lookup segment preserved continuously distributed area to find area sections distributed over a network, to find areas distributed such that the final lookup value may be routed to the node when looking in and comparison interval values ​​to achieve reliability in the case of shared resources directory information without having to save the directory server node, look in the area of ​​distributed areas distributed on the network to find, reduce system overhead and improve the system of . structure of a security node and embodiments of the present invention is schematically shown in FIG 8, a node comprising a selecting unit 81 to be released, determination unit 82, and issuing unit 83; wherein the issuing unit 83 are to be publishing node

选择单元81和判断单元82连接。 Selecting unit 81 and determination unit 82 are connected. 待发布节点选择单元81用于根据分布式区域查找区间的上限和节点的节点标识,在分布式区域查找网络中选择待发布节点,并将选择结果发送到发布单元83;判断单元82用于判断是否继续发布分布式区域查找区间,并将判断结果发送到发布单元83;发布单元83用于向分布式区域查找网络中的节点发布分布式区域查找区间。 Publishing node selection unit 81 to be used to find the node identification and the node of the upper section of a distributed area to be selected lookup network publishing node in a distributed area, and supplies the selected result to the issuing unit 83; determining means 82 for determining distributed area to find whether to release interval, and transmits the determination result to the issuing unit 83; release unit 83 is used to find a node in a network of distributed publish regions lookup segment to the distributed region. 本实施例通过将分布式区域查找区间连续分段地发布到分布式区域查找网络中的节点上,使得在查找时可以在最终路由到的节点里进行查找值和区间值的比较,实现了在无需目录服务器保存节点的共享资源的目录信息的情况下,进行在分布式区域查找网络上的分布式区域查找,减小了系统开销,提高了系统的可靠性和安全性。 In this embodiment, the distributed regions lookup segment interval continuously publish to the distributed area to find the node in the network, so that the values ​​can be compared to find the value in the final interval and routed to the node when looking inside, realized in without directory information shared resources directory server saves node, look in the area of ​​distributed areas distributed on the network to find, reduces system cost and improve reliability and safety of the system. 通过以上的实施方式的描述,本领域的技术人员可以清楚地了解到本发明可借助软件加必需的通用硬件平台的方式来实现,当然也可以通过硬件, 但很多情况下前者是更佳的实施方式。 By the above described embodiments, those skilled in the art may clearly understand that the present invention may be implemented by software plus a necessary universal hardware platform, also be implemented by hardware, but in most cases the former is a better embodiment the way. 基于这样的理解,本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来, 该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)执行本发明各个实施例所述的方法。 Based on such understanding, the technical solutions of the present invention in essence or the part contributing to the prior art may be embodied in a software product, which computer software product is stored in a storage medium and includes several instructions to enable a a computer device (may be a personal computer, a server, or network device) to execute the methods according to embodiments of the present invention. 以上所述仅是本发明的实施方式,应当指出,对于本技术领域的普通技术人员来说,在不脱离本发明原理的前提下,还可以做出若干改进和润饰, 这些改进和润饰也应视为本发明的保护范围。 The above are only embodiments of the present invention, it should be noted that those of ordinary skill in the art, in the present invention without departing from the principles of the premise, can make various improvements and modifications, improvements and modifications should also be the protection scope of the present invention.

Claims (16)

1、一种分布式区域查找区间的发布方法,其特征在于,包括以下步骤:根据分布式区域查找区间的上限和节点的节点标识,在分布式区域查找网络中选择待发布节点;向所述待发布节点发布所述分布式区域查找区间;向所述待发布节点的邻居节点发布所述分布式区域查找区间。 1, a distributed area to find the interval distribution method, characterized by comprising the following steps: Find the node identifier of the node interval and the upper limit of a distributed area, lookup network publishing node to be selected in the distributed region; to the pending publication distributed node release the area to find the range; to be released to the neighbors of the node issuing the distributed area to find the range.
2、 如权利要求1所述分布式区域查找区间的发布方法,其特征在于,所述选择待发布节点具体包括:如果所述节点的节点标识大于或等于所述分布式区域查找区间的上限, 且所述节点的前续节点的节点标识小于所述分布式区域查找区间的上限,则所述节点为待发布节点。 2, the distributed region as claimed in claim 1 to find the distribution method section, characterized in that the selection be distributed node comprises: if the node identification of the node is greater than or equal to find the maximum range of the distributed area, continued node and the node identifier of the node is smaller than the area of ​​distributed find the maximum range, then the node is the node to be distributed.
3、 如权利要求1所述分布式区域查找区间的发布方法,其特征在于,在所述向待发布节点的邻居节点发布分布式区域查找区间之前,还包括:判断所述待发布节点的节点标识是否小于所述分布式区域查找区间的下限,如果是,则继续发布所述分布式区域查找区间。 3, the distributed region as claimed in claim 1 to find the distribution method section, wherein, prior to release distributed area to find the interval to be distributed to the neighbors of the node, further comprising: determining the node to be a publishing node identity is less than the lower limit of the distributed area to find the range, and if so, to continue to publish the distributed area to find the range.
4、 如权利要求1或3所述分布式区域查找区间的发布方法,其特征在于, 所述向待发布节点的邻居节点发布分布式区域查找区间,具体包括:区间发布节点从所述待发布节点获取所述待发布节点的邻居节点的地址;区间发布节点根据所述待发布节点的邻居节点的地址,将大于所述待发布节点的节点标识的值发布到所述待发布节点的邻居节点。 4, according to claim 1 or claim 3 distributed regions lookup distribution method section, wherein said release region distributed lookup segment to be distributed to the neighbors of the node, comprises: interval from the publishing node to be released obtaining a neighbor node of the node to be distributed node address; neighbor node address range value of publishing node according to the node to be distributed, will be larger than the node identifier of the node to be distributed to publishing neighbor node of the node to be distributed .
5、 如权利要求1或3所述分布式区域查找区间的发布方法,其特征在于, 所述向待发布节点的邻居节点发布分布式区域查找区间,具体包括:所述待发布节点将大于所述待发布节点的节点标识的值发布到所述待发布节点的邻居节点。 5, according to claim 1 or claim 3 distributed regions lookup distribution method section, wherein said release region distributed lookup segment to be distributed to the neighbors of the node, comprises: the publishing node will be greater than the value of said node identifier to be distributed to publishing node neighbor node of the node to be distributed.
6、 如权利要求1所述分布式区域查找区间的发布方法,其特征在于,如果有节点加入所述分布式区域查找网络,则待加入节点的邻居节点将分布式区域查找区间上限小于或等于待加入节点的节点标识的分布式区域查找区间发布到所述待加入节点,且所述邻居节点的分布式区域查找区间修改为上限为所述待加入节点的节点标识的左开右闭区间。 6, a distributed area as claimed in claim find the distribution method section, wherein, if a node joins the distributed network regions lookup, then the neighbor node is added to be distributed area to find the node intervals equal to or less than the upper limit distributed node identification area to be added to nodes to find the interval to be added publishing node and the neighboring nodes distributed region modified to find upper limit of the range to be added to the left node of the node identification and right opening and closing section.
7、 如权利要求1所述分布式区域查找区间的发布方法,其特征在于,如果有节点离开所述分布式区域查找网络,则待离开节点将保存的分布式区域查找区间发布到所述待离开节点的邻居节点。 7, as claimed in the claim 1 distributed lookup region distribution method section, wherein, if a node to leave the area to find the distributed network, the node will be stored away from the area to be distributed to find the interval to be published left neighbors nodes.
8、 一种分布式区域的查找方法,其特征在于,包括以下步骤: 根据查找值和节点的节点标识,在分布式区域查找网络中获取待查找节点;根据所述查找值和所述待查找节点保存的分布式区域查找区间的上限, 获取覆盖所述查找值的区间。 8, a distributed area search method, characterized by comprising the steps of: a node identifier and the lookup value nodes, looking up in a distributed LAN node to be searched acquired; according to the lookup value to be searched and the the nodes of a distributed storage area to find the maximum range, acquiring section covering the lookup value.
9、 如权利要求8所述分布式区域的查找方法,其特征在于,所述获取待查找节点的过程具体包括:如果所述查找值小于或等于节点的节点标识,且到所述节点的节点标识的距离最小,则所述节点为待查找节点。 9, the search method as claimed in claim 8 distributed region, wherein the process of obtaining the node to be searched comprises: if the value is less than or equal to the lookup node identifier of the node, and the node to node identifying a minimum distance, then the node is the node to be searched.
10、 如权利要求8或9所述分布式区域的查找方法,其特征在于,所述获取覆盖查找值的区间具体包括:如果所述查找值大于所述待查找节点保存的分布式区域查找区间的上限,则所述查找区间为所述覆盖查找值的区间。 10. The method of claim 8 or 9 find distributed region, characterized in that said covering lookup value acquiring section comprises: if the lookup value is greater than the storage node to be searched to find regions distributed interval the upper limit of the lookup segment is the covering segment lookup values.
11、 一种分布式区域查找网络,其特征在于,所述网络中节点的最小节点标识到最大节点标识之间的范围,对应由业务特性决定的待查找区域的最大范围。 11, a distributed area to find the network, characterized in that the lowest node in the network node identifier to the range between the maximum node identifier, to find the maximum range of the region should be determined traffic characteristics.
12、 如权利要求11所述分布式区域查找网络,其特征在于,所述网络中节点保存的分布式区域查找区间的上限小于或等于所述节点的节点标识,且大于所述节点的前续节点的节点标识。 Continued 12, 11 as claimed in the claim area distributed lookup network, wherein the network nodes stored in a distributed area to find the maximum range is less than or equal to the node identifier of the node, and the node is greater than node identification.
13、 如权利要求11或12所述分布式区域查找网络,其特征在于,如果有节点加入所述分布式区域查找网络,则待加入节点保存的分布式区域查找区间为所述待加入节点加入前所述待加入节点的邻居节点保存的查找区间上限小于或等于所述待加入节点的节点标识的查找区间;所述待加入节点的邻居节点在所述待加入节点加入后保存的分布式区域查找区间为上限为所述待加入节点的节点标识的左开右闭区间。 13, claim 11 or claim 12, wherein the distributed lookup network region, wherein, if a node joins the distributed network lookup region, to be added to the distributed storage node regions lookup segment to be added to said added node Find the upper range of the previous node from neighbor node to be added is less than or equal to find the interval to be added to the node identifier of the node; neighbor node of the node to be added in the node to be added after the addition of a distributed storage area Find limit interval to be added to the node's left and right node identifier opening and closing section.
14、 如权利要求11或12所述分布式区域查找网络,其特征在于,如果有节点离开所述分布式区域查找网络,则待离开节点的邻居节点保存的分布式区域查找区间为所述待离开节点保存的查找区间。 14, claim 11 or claim 12, wherein the distributed lookup network region, wherein, if the distributed area to find the node leaves the network, to be away from neighbor nodes of the distributed area to find the interval to be Find a range of nodes left to save.
15、 一种节点,其特征在于,包括待发布节点选择单元和发布单元; 所述待发布节点选择单元,用于根据分布式区域查找区间的上限和节点的节点标识,在分布式区域查找网络中选择待发布节点,并将选择结果发送到所述发布单元;所述发布单元,用于向所述分布式区域查找网络中的节点发布所述分布式区域查找区间。 15. A node, wherein the node comprises selection means to be distributed and issuing unit; to be distributed node selecting unit for finding node identification and the node of the upper section of a distributed areas distributed in regions lookup network publishing node to be selected, and the selection result is sent to the issuing unit; the issuing unit configured to locate the region distributed in the distribution network node distributed lookup segment region.
16、 如权利要求15所述的节点,其特征在于,还包括判断单元,用于判断是否继续发布所述分布式区域查找区间,并将判断结果发送到所述发布单元。 16. The node as claimed in claim 15, characterized by further comprising determining means for determining whether to release the distributed regions lookup segment, and transmits the determination result to the issuing unit.
CN 200710162705 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone CN101399688A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200710162705 CN101399688A (en) 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200710162705 CN101399688A (en) 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone

Publications (1)

Publication Number Publication Date
CN101399688A true CN101399688A (en) 2009-04-01

Family

ID=40517968

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200710162705 CN101399688A (en) 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone

Country Status (1)

Country Link
CN (1) CN101399688A (en)

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105052090A (en) * 2013-03-15 2015-11-11 思科技术公司 Seamless segment routing
US9749227B2 (en) 2012-10-05 2017-08-29 Cisco Technology, Inc. MPLS segment-routing
US10063475B2 (en) 2014-03-06 2018-08-28 Cisco Technology, Inc. Segment routing extension headers
US10122614B2 (en) 2015-02-26 2018-11-06 Cisco Technology, Inc. Failure protection for traffic-engineered bit indexed explicit replication
US10178022B2 (en) 2014-07-17 2019-01-08 Cisco Technology, Inc. Segment routing using a remote forwarding adjacency identifier
US10212076B1 (en) 2012-12-27 2019-02-19 Sitting Man, Llc Routing methods, systems, and computer program products for mapping a node-scope specific identifier
US10263881B2 (en) 2016-05-26 2019-04-16 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US10367737B1 (en) 2012-12-27 2019-07-30 Sitting Man, Llc Routing methods, systems, and computer program products
US10374938B1 (en) 2012-12-27 2019-08-06 Sitting Man, Llc Routing methods, systems, and computer program products
US10397101B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products for mapping identifiers
US10397100B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products using a region scoped outside-scope identifier
US10404583B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using multiple outside-scope identifiers
US10404582B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using an outside-scope indentifier
US10411997B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Routing methods, systems, and computer program products for using a region scoped node identifier
US10411998B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Node scope-specific outside-scope identifier-equipped routing methods, systems, and computer program products
US10419334B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Internet protocol routing methods, systems, and computer program products
US10419335B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Region scope-specific outside-scope indentifier-equipped routing methods, systems, and computer program products
US10447575B1 (en) 2012-12-27 2019-10-15 Sitting Man, Llc Routing methods, systems, and computer program products
US10476787B1 (en) 2012-12-27 2019-11-12 Sitting Man, Llc Routing methods, systems, and computer program products

Cited By (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10469370B2 (en) 2012-10-05 2019-11-05 Cisco Technology, Inc. Segment routing techniques
US9749227B2 (en) 2012-10-05 2017-08-29 Cisco Technology, Inc. MPLS segment-routing
US9929946B2 (en) 2012-10-05 2018-03-27 Cisco Technology, Inc. Segment routing techniques
US10218610B2 (en) 2012-10-05 2019-02-26 Cisco Technology, Inc. MPLS segment routing
US10389624B1 (en) 2012-12-27 2019-08-20 Sitting Man, Llc Scoped identifier space routing methods, systems, and computer program products
US10447575B1 (en) 2012-12-27 2019-10-15 Sitting Man, Llc Routing methods, systems, and computer program products
US10419335B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Region scope-specific outside-scope indentifier-equipped routing methods, systems, and computer program products
US10419334B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Internet protocol routing methods, systems, and computer program products
US10411998B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Node scope-specific outside-scope identifier-equipped routing methods, systems, and computer program products
US10212076B1 (en) 2012-12-27 2019-02-19 Sitting Man, Llc Routing methods, systems, and computer program products for mapping a node-scope specific identifier
US10476787B1 (en) 2012-12-27 2019-11-12 Sitting Man, Llc Routing methods, systems, and computer program products
US10411997B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Routing methods, systems, and computer program products for using a region scoped node identifier
US10404582B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using an outside-scope indentifier
US10404583B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using multiple outside-scope identifiers
US10397100B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products using a region scoped outside-scope identifier
US10367737B1 (en) 2012-12-27 2019-07-30 Sitting Man, Llc Routing methods, systems, and computer program products
US10374938B1 (en) 2012-12-27 2019-08-06 Sitting Man, Llc Routing methods, systems, and computer program products
US10382327B1 (en) 2012-12-27 2019-08-13 Sitting Man, Llc Methods, systems, and computer program products for routing using headers including a sequence of node scope-specific identifiers
US10397101B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products for mapping identifiers
US10389625B1 (en) 2012-12-27 2019-08-20 Sitting Man, Llc Routing methods, systems, and computer program products for using specific identifiers to transmit data
US10476788B1 (en) 2012-12-27 2019-11-12 Sitting Man, Llc Outside-scope identifier-equipped routing methods, systems, and computer program products
US10164838B2 (en) 2013-03-15 2018-12-25 Cisco Technology, Inc. Seamless segment routing
CN105052090B (en) * 2013-03-15 2018-03-27 思科技术公司 The method and device of seamless Segment routing
US10469325B2 (en) 2013-03-15 2019-11-05 Cisco Technology, Inc. Segment routing: PCE driven dynamic setup of forwarding adjacencies and explicit path
US10270664B2 (en) 2013-03-15 2019-04-23 Cisco Technology, Inc. Segment routing over label distribution protocol
US9979601B2 (en) 2013-03-15 2018-05-22 Cisco Technology, Inc. Encoding explicit paths as segment routing segment lists
CN105052090A (en) * 2013-03-15 2015-11-11 思科技术公司 Seamless segment routing
US10382334B2 (en) 2014-03-06 2019-08-13 Cisco Technology, Inc. Segment routing extension headers
US10063475B2 (en) 2014-03-06 2018-08-28 Cisco Technology, Inc. Segment routing extension headers
US10178022B2 (en) 2014-07-17 2019-01-08 Cisco Technology, Inc. Segment routing using a remote forwarding adjacency identifier
US10122614B2 (en) 2015-02-26 2018-11-06 Cisco Technology, Inc. Failure protection for traffic-engineered bit indexed explicit replication
US10341221B2 (en) 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
US10341222B2 (en) 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
US10263881B2 (en) 2016-05-26 2019-04-16 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers

Similar Documents

Publication Publication Date Title
CN100431320C (en) Method and appts. for real-time parallel delivery of segments of large payload file
US6654807B2 (en) Internet content delivery network
JP4982651B2 (en) System including distributed media network and metadata server
US8504663B2 (en) Method and system for community data caching
CN1528079B (en) Method and apparatus for peer-to-peer services
US7188145B2 (en) Method and system for dynamic distributed data caching
CN100354857C (en) Dynamic service register list
CN102185928B (en) Method for creating virtual machine in cloud computing system and cloud computing system
CN100474835C (en) Semantic information network (SION)
CN100417158C (en) Scalable resonrce discovery and reconfiguration for distributed computer networks
US6760763B2 (en) Server site restructuring
CN101981572B (en) Request routing
KR19980041908A (en) Computerized resource name deriving mechanism
US20080195597A1 (en) Searching in peer-to-peer networks
US20120143688A1 (en) Media advertising over peer-to-peer networks
KR20120072909A (en) Distribution storage system with content-based deduplication function and object distributive storing method thereof, and computer-readable recording medium
CN102047242B (en) Content management
JP2575800B2 (en) How to find resources
US7756898B2 (en) Systems and methods for notifying listeners of events
TWI473029B (en) Programmable and may extend as much as tenant service structure
US7822711B1 (en) Conflict resolution for a distributed file sharing system
CN105530324A (en) Request routing based on class
US7831735B1 (en) Coherency of replicas for a distributed file sharing system
CA2176775A1 (en) System and Method for Database Access Administration
CA2375132A1 (en) System and method for influencing a position on a search result list generated by a computer network search engine

Legal Events

Date Code Title Description
C06 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)