公开(公告)号：US07454520B2

公开(公告)日：2008-11-18

申请号：US10299908

申请日：2002-11-20

Applicant: Zheng Zhang ,  Zhichen Xu

Inventor： Zheng Zhang ,  Zhichen Xu

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L67/1046 ,  H04L69/329

Abstract: In a method of generating a routing table for a selected peer, a zone of the selected peer is compared to a target zone. A current entry associated with the zone of the selected peer is created in a routing table of the selected peer in response to the zone of the selected peer being one of smaller and equal to the target zone.

Abstract translation: 在为所选对等体生成路由表的方法中，将所选择的对等体的区域与目标区域进行比较。 响应于所选择的对等体的区域是小于和等于目标区域的区域，在所选择的对等体的路由表中创建与所选对等体的区域相关联的当前条目。

公开(公告)号：US07433316B2

公开(公告)日：2008-10-07

申请号：US10368426

申请日：2003-02-20

Applicant: Zhichen Xu ,  Mallik Mahalingam ,  Magnus Karlsson

Inventor： Zhichen Xu ,  Mallik Mahalingam ,  Magnus Karlsson

IPC: G01R31/08

CPC classification number: H04L45/306 ,  H04L45/02 ,  H04L45/20 ,  H04L45/64 ,  H04L67/104 ,  H04L67/1042 ,  H04L67/1068

Abstract: Described herein is a method for creating route summaries in an auxiliary network for a peer-to-peer (P2P) overlay network for routing a data packet. The method comprises dividing a d-dimensional Cartesian space of nodes in the P2P overlay network into multiple virtual grids that form the auxiliary network, numbering each virtual grid, summarizing default overlay network zones of the P2P overlay network corresponding to each of the virtual grids that form the auxiliary network, receiving a data packet, and routing the data packet to a packet destination using one of the P2P overlay network and the auxiliary network.

Abstract translation: 这里描述了一种用于在用于路由数据分组的对等（P2P）覆盖网络的辅助网络中创建路由摘要的方法。 该方法包括将P2P覆盖网络中的节点的d维笛卡尔空间划分为形成辅助网络的多个虚拟网格，对每个虚拟网格进行编号，总结与每个虚拟网格对应的P2P覆盖网络的默认覆盖网络区域， 形成辅助网络，接收数据包，并使用P2P覆盖网络和辅助网络之一将数据包路由到分组目的地。

公开(公告)号：US20080172399A1

公开(公告)日：2008-07-17

申请号：US11624072

申请日：2007-01-17

Applicant: Liang-Yu Chi ,  Dmitry Yurievich Pavlov ,  Yun Fu ,  Eren Manavoglu ,  Paul Heymann ,  Zhichen Xu

Inventor： Liang-Yu Chi ,  Dmitry Yurievich Pavlov ,  Yun Fu ,  Eren Manavoglu ,  Paul Heymann ,  Zhichen Xu

IPC: G06F17/30

CPC classification number: G06F17/30884

Abstract: The present invention is directed towards systems and method for organization of bookmarks. The method according to one embodiment comprises retrieving one or more bookmarks associated with one or more content items, a given bookmark generated by a user of a client device and identifying one or more tags associated with one or uniform resource locators corresponding to the or more bookmarks. A bookmark folder hierarchy is created through use of a clustering algorithm on the basis of the one or more tags associated with the one or more uniform resource locators corresponding to the one or more bookmarks.

Abstract translation: 本发明涉及用于组织书签的系统和方法。 根据一个实施例的方法包括检索与一个或多个内容项目相关联的一个或多个书签，由客户端设备的用户生成的给定书签，以及识别与一个或多个与该书签相对应的一个或多个统一资源定位符相关联的一个或多个标签 。 基于与一个或多个书签相对应的一个或多个统一资源定位符相关联的一个或多个标签，通过使用聚类算法来创建书签文件夹层次结构。

公开(公告)号：US07379428B2

公开(公告)日：2008-05-27

申请号：US10284100

申请日：2002-10-31

Applicant: Zhichen Xu ,  Mallik Mahalingam ,  Magnus Karlsson

Inventor： Zhichen Xu ,  Mallik Mahalingam ,  Magnus Karlsson

IPC: H04L12/28

CPC classification number: H04L67/104 ,  H04L45/04 ,  H04L67/1042 ,  H04L67/1046 ,  H04L67/1068

Abstract: A system and method for an auxiliary network for a peer-to-peer overlay network using autonomous system level topology. Using information available through the auxiliary network, expressway connections are established amongst expressway nodes and ordinary connections are established between ordinary and expressway nodes. The connections established is unconstrained and arbitrary. After the connections are established, efficient routing of information may take place.

Abstract translation: 一种用于使用自主系统级拓扑的对等覆盖网络的辅助网络的系统和方法。 利用辅助网络提供的信息，在高速公路节点之间建立高速公路连接，在普通高速公路节点之间建立普通连接。 建立的连接是无约束和任意的。 建立连接后，可能会发生信息的有效路由。

公开(公告)号：US20070011161A1

公开(公告)日：2007-01-11

申请号：US11444141

申请日：2006-05-30

Applicant: Kenneth Norton ,  Chung-Man Tam ,  Jianchang Mao ,  Zhichen Xu ,  Adrienne Bassett ,  Ashley Hall ,  Nathan Arnold

Inventor： Kenneth Norton ,  Chung-Man Tam ,  Jianchang Mao ,  Zhichen Xu ,  Adrienne Bassett ,  Ashley Hall ,  Nathan Arnold

IPC: G06F17/30

CPC classification number: G06F17/30867 ,  G06F3/04842 ,  G06F17/30873 ,  G06F17/30997

Abstract: The present invention relates to systems, methods, and user interfaces for browsing a collection of content items saved by a user or by one or more buddies associated with a given user. The method of the present invention comprises saving one or more content items and one or more associated keywords as specified by a user. An interface is generated that displays the one or more saved content items and the one or more associated keywords, as well as the one or more buddies associated with a given user. A user indication of the selection of a given keyword or the selection of a given buddy by the user is received. The one or more displayed content items are filtered according to the selected keyword, buddy, or combination of selected keyword and buddy.

Abstract translation: 本发明涉及用于浏览由用户或由与给定用户相关联的一个或多个伙伴保存的内容项目的集合的系统，方法和用户界面。 本发明的方法包括保存由用户指定的一个或多个内容项和一个或多个关联关键字。 生成一个界面，显示一个或多个保存的内容项目以及一个或多个关联关键字，以及与给定用户相关联的一个或多个伙伴。 接收给定关键字的选择的用户指示或用户对给定好友的选择。 一个或多个显示的内容项目根据所选择的关键字，好友或所选关键词和伙伴的组合进行过滤。

公开(公告)号：US20060294311A1

公开(公告)日：2006-12-28

申请号：US11475427

申请日：2006-06-26

Applicant: Yun Fu ,  Zhichen Xu ,  Jianchang Mao

Inventor： Yun Fu ,  Zhichen Xu ,  Jianchang Mao

IPC: G06F13/28 ,  G06F12/00 ,  G06F7/00 ,  H04N5/445 ,  G06F13/00 ,  G06F3/00 ,  G06F17/00

CPC classification number: G06F17/30864 ,  G06F17/30902 ,  Y10S707/99933

Abstract: Methods, systems, and machine-readable media are disclosed for searching a corpus of information by utilizing a Bloom filter for caching query results. According to one aspect of the present invention, a method of caching information from a corpus of information can include populating one or more Bloom filters with a plurality of bits representative of information in the corpus of information. A search request can be received identifying requested information from the corpus of information. One or more bits in the filter(s) associated with the requested information can be checked and the requested information can be retrieved from the corpus of information based on results of said checking. Furthermore, the filter(s) can be used to determine which information to make available to a particular user in a system where certain information is associated with or access is limited to certain users or groups of users.

公开(公告)号：US20060294192A1

公开(公告)日：2006-12-28

申请号：US11169178

申请日：2005-06-27

Applicant: Jianchang Mao ,  Zhichen Xu ,  Chad Walters ,  John Wang ,  Albert Meltzer

Inventor： Jianchang Mao ,  Zhichen Xu ,  Chad Walters ,  John Wang ,  Albert Meltzer

IPC: G06F15/173 ,  G06F15/167

CPC classification number: H04L63/102 ,  H04L67/306

Abstract: Access control systems and methods regulate access to shared content items in a corpus using visibility tokens. A user provides other users with access to a content item by associating a content token with the content item and associating a matching user token with each user who is to be granted access. A user who attempts to access the content item succeeds only if that user has a user token matching the content token associated with the content item. User tokens can be propagated automatically from one user to another, e.g., based on trust relationships among the users. Content tokens can be indexed with content items so that when a user searches the corpus, a search engine can detect matches between user tokens and content tokens and filter the search results based on whether they are visible to the querying user.

公开(公告)号：US07039634B2

公开(公告)日：2006-05-02

申请号：US10385454

申请日：2003-03-12

Applicant: Zhichen Xu ,  Mallik Mahalingam ,  Chunqiang Tang

Inventor： Zhichen Xu ,  Mallik Mahalingam ,  Chunqiang Tang

IPC: G06F17/30 ,  G06F7/00

CPC classification number: H04L67/104 ,  G06F17/30206 ,  G06F17/3069 ,  H04L67/1065 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

Abstract: In a method of semantic querying in a peer-to-peer network, an item of information is mapped into a semantic vector based on the latent semantic indexing algorithm or any IR algorithms that can derive a vector representation. The semantic vector is associated with an address index as a key pair. The key pair is stored in an overlay network formed from the peer-to-peer network such that the stored key pair is proximally located to at least one other key pair having a similar semantic vector.

Abstract translation: 在对等网络中的语义查询的方法中，基于潜在语义索引算法或可以导出向量表示的任何IR算法将信息项映射到语义向量中。 语义向量与地址索引作为密钥对相关联。 密钥对存储在由对等网络形成的覆盖网络中，使得所存储的密钥对近端位于具有相似语义向量的至少一个其他密钥对。

公开(公告)号：US20050201278A1

公开(公告)日：2005-09-15

申请号：US10797200

申请日：2004-03-11

Applicant: Sujata Banerjee ,  Sung-Ju Lee ,  Zhichen Xu ,  Chunqiang Tang ,  Zhiheng Wang

Inventor： Sujata Banerjee ,  Sung-Ju Lee ,  Zhichen Xu ,  Chunqiang Tang ,  Zhiheng Wang

IPC: G01R31/08

CPC classification number: H04L12/18 ,  H04L45/16 ,  H04L45/302 ,  H04L45/46 ,  H04L45/48 ,  H04L45/745

Abstract: A multicast tree is provided in an application multicast network. A child node in the multicast tree detects a degradation of quality of service associated with a service being received at the child node. The child node determines whether the degradation of quality of service is resulting from a child-parent link or an upstream link in the multicast tree.

Abstract translation: 组播树在应用组播网络中提供。 多播树中的子节点检测与在子节点处正在接收的服务相关联的服务质量的劣化。 子节点确定服务质量的劣化是否是由多播树中的子 - 父链路或上游链路产生的。

公开(公告)号：US20050198286A1

公开(公告)日：2005-09-08

申请号：US10767285

申请日：2004-01-30

Applicant: Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

Inventor： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

IPC: H04L12/56 ,  G06F15/173

CPC classification number: H04L45/02 ,  H04L45/126 ,  H04L45/46 ,  H04L45/54

Abstract: A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

Abstract translation: 网络包括多个节点。 基于候选节点的位置信息和网络中的第一节点来选择来自多个节点的一组候选节点。 聚类算法应用于候选节点和第一节点的位置信息，并且基于应用聚类算法的结果来识别最接近第一节点的候选节点集合的子集。