-
公开(公告)号：US07562293B2
公开(公告)日：2009-07-14
申请号：US11140189
申请日：2005-05-27
CPC分类号： G06F17/2247 , G06F17/2725
摘要： A data processing method comprises receiving an electronically parseable document, scanning the document according to at least one predefined rule to determine if the document is suspicious, and, if the document is determined not to be suspicious, parsing the document with a first parser, and, if the document is determined to be suspicious, parsing the document with a second parser.
摘要翻译： 数据处理方法包括接收电子可解析文档，根据至少一个预定义规则扫描文档以确定文档是否可疑，以及如果文档被确定为不可疑，则用第一解析器解析文档，以及 如果文档被确定为可疑，则使用第二个解析器解析文档。
-
公开(公告)号：US20080184105A1
公开(公告)日：2008-07-31
申请号：US12059913
申请日：2008-03-31
IPC分类号： G06F17/27
CPC分类号： G06F17/2247 , G06F17/2725
摘要： A data processing method comprises receiving an electronically parseable document, scanning the document according to at least one predefined rule to determine if the document is suspicious, and, if the document is determined not to be suspicious, parsing the document with a first parser, and, if the document is determined to be suspicious, parsing the document with a second parser.
摘要翻译： 数据处理方法包括接收电子可解析文档，根据至少一个预定义规则扫描文档以确定文档是否可疑，以及如果文档被确定为不可疑，则用第一解析器解析文档，以及 如果文档被确定为可疑，则使用第二个解析器解析文档。
-
公开(公告)号：US08176413B2
公开(公告)日：2012-05-08
申请号：US12059913
申请日：2008-03-31
CPC分类号： G06F17/2247 , G06F17/2725
摘要： A data processing method comprises receiving an electronically parseable document, scanning the document according to at least one predefined rule to determine if the document is suspicious, and, if the document is determined not to be suspicious, parsing the document with a first parser, and, if the document is determined to be suspicious, parsing the document with a second parser.
摘要翻译： 数据处理方法包括接收电子可解析文档，根据至少一个预定义规则扫描文档以确定文档是否可疑，以及如果文档被确定为不可疑，则用第一解析器解析文档，以及 如果文档被确定为可疑，则使用第二个解析器解析文档。
-
公开(公告)号：US20090055728A1
公开(公告)日：2009-02-26
申请号：US12191652
申请日：2008-08-14
申请人： Marcel Waldvogel , Jan Van Lunteren , Andreas Kind
发明人： Marcel Waldvogel , Jan Van Lunteren , Andreas Kind
IPC分类号： G06F17/00
CPC分类号： G06F17/272 , G06F17/2247 , H03M7/30 , H03M7/3088
摘要： This invention provides methods, apparatus, and systems for decompressing electronic documents. Utility of this invention includes use in validation and parsing of compressed XML documents. An example data processing method comprises receiving a compressed electronic document, decompressing the document and executing an analysis of the document during the decompression. The analysis determines whether the document conforms to defined syntax rules. In one example, a compressed XML document, while it is being decompressed, following receipt, will be parsed and/or validated at the same time.
摘要翻译： 本发明提供了用于解压缩电子文档的方法，装置和系统。 本发明的实用性包括用于验证和解析压缩的XML文档。 示例性数据处理方法包括在解压缩期间接收压缩的电子文档，解压缩文档和执行文档的分析。 分析确定文档是否符合定义的语法规则。 在一个示例中，压缩的XML文档在被解压缩之后，在收到之后将被同时解析和/或验证。
-
5.发明授权Searching a range in a set of values in a network with distributed storage entities 有权在具有分布式存储实体的网络中搜索一组值中的范围公开(公告)号：US08880502B2
公开(公告)日：2014-11-04
申请号：US11079554
申请日：2005-03-14
申请人： Marcel Waldvogel , Roman A. Pletka
发明人： Marcel Waldvogel , Roman A. Pletka
CPC分类号： G06F17/30545 , G06F17/30575 , H04L67/1097
摘要： Methods for searching a range in a set of values in a network with distributed storage nodes. An example of a method for searching a range in a set of values in a network with distributed storage nodes according to the invention comprises the following steps. First, the range is divided up into a set of subranges by means of a hierarchical structure. Then, a query packet is generated for said set of subranges and transmitted to the distributed storage nodes for performing the query.
摘要翻译： 用于在具有分布式存储节点的网络中搜索一组值中的范围的方法。 根据本发明的用于搜索具有分布式存储节点的网络中的一组值中的范围的方法的示例包括以下步骤。 首先，通过层次结构将范围分为一组子范围。 然后，为所述一组子范围生成查询分组，并发送到分布式存储节点以执行查询。
-
6.发明申请System and program storage device for controlling data packet flows by manipulating data packets according to an actual manipulation rate 失效系统和程序存储装置，用于根据实际操纵速率操纵数据包来控制数据包流公开(公告)号：US20080267070A1
公开(公告)日：2008-10-30
申请号：US12215007
申请日：2008-06-24
申请人： Soenke Mannal , Roman A. Pletka , Marcel Waldvogel
发明人： Soenke Mannal , Roman A. Pletka , Marcel Waldvogel
IPC分类号： H04L12/24
CPC分类号： H04L47/10 , H04L47/12 , H04L47/193 , H04L47/283
摘要： A network device and a computer program element are introduced for controlling data packet flows in a network device by manipulating data packets according to an actual manipulation rate. Amongst data packets received by a network device such as a router, data packets are identified that are marked with a pattern according to a congestion notification scheme. A pattern rate of data packets comprising such a pattern is determined, and the actual manipulation rate is determined subject to the pattern rate.
摘要翻译： 引入网络设备和计算机程序元件，以通过根据实际操纵速率操纵数据分组来控制网络设备中的数据分组流。 在由诸如路由器的网络设备接收的数据分组中，根据拥塞通知方案识别出标记有模式的数据分组。 确定包含这种模式的数据分组的模式速率，并根据模式速率确定实际的操纵速率。
-
7.发明授权Method of resource-efficient and scalable streaming media distribution for asynchronous receivers 有权用于异步接收器的资源有效和可扩展的流媒体分发方法公开(公告)号：US06823394B2
公开(公告)日：2004-11-23
申请号：US09735017
申请日：2000-12-12
IPC分类号： G06F1300
CPC分类号： H04L65/4076 , H04L12/185 , H04L12/1877 , H04L12/1881 , H04L29/06027 , H04L65/607 , H04L65/80 , H04N21/2343 , H04N21/26208 , H04N21/26275 , H04N21/47208 , H04N21/6405
摘要： A method of distributing streaming media to one or more users. The method includes partitioning the media into segments that each include data associated with at least a portion of one or more of the successive data units in the media. Each segment also includes information for positioning the data relative to the order of the data units. A transmission sequence having a plurality of successive time slots is defined for the segments to enable reconstruction of an i-th data unit from Li segments. A server transmits each of the segments according to the defined transmission sequence during one of the time slots. A client processes the transmitted segments based on the positioning information to reconstruct the media.
摘要翻译： 一种向一个或多个用户分发流媒体的方法。 该方法包括将媒体分成各个段，每个段包括与媒体中的一个或多个连续数据单元的至少一部分相关联的数据。 每个段还包括用于相对于数据单元的顺序定位数据的信息。 为这些段定义具有多个连续时隙的传输序列，以使得能够从Li段重建第i个数据单元。 服务器在一个时隙期间根据定义的传输顺序发送每个段。 客户端根据定位信息来处理所传送的段，以重构媒体。
-
公开(公告)号：US6018524A
公开(公告)日：2000-01-25
申请号：US926370
申请日：1997-09-09
CPC分类号： H04L45/00 , H04L45/7457 , Y10S707/99932 , Y10S707/99937
摘要： A method and apparatus for an exponentially faster technique than is presently utilized in routers for looking-up destination addresses and matching them to a prefix in order to determine an output data link for routing of the data message to a destination. The basic algorithm includes arranging the prefix and corresponding output data link information in sub-databases arranged by prefix length and then using a multi-step prefix length binary search algorithm to sort through the sub-databases to determine a best matching prefix for routing of the data packet. Various refinements of the basic algorithm are disclosed to further enhance the search time including adding markers representative of sub-database entries having a longer prefix length and also various searching methodologies to minimize the number of searching steps including rope searching in various formats. Thus, methodologies are disclosed for building the sub-databases, as appropriate to implement the corresponding novel search routines and perform the novel search routines themselves, and the router which implements all of the foregoing. Many of the inventive features disclosed herein are applicable to other routing DPJ protocols such as OSI Routing, call routing and telephone DPJ networks, and string matching problems.
摘要翻译： 一种比目前在路由器中用于查找目的地地址并将其与前缀匹配的指数更快的技术的方法和装置，以便确定用于将数据消息路由到目的地的输出数据链路。 基本算法包括将前缀和对应的输出数据链路信息排列在由前缀长度排列的子数据库中，然后使用多步前缀长度二进制搜索算法对子数据库进行排序，以确定用于路由的最佳匹配前缀 数据包。 公开了基本算法的各种改进，以进一步增强搜索时间，包括添加表示具有较长前缀长度的子数据库条目的标记，以及各种搜索方法，以最小化包括各种格式的绳索搜索的搜索步骤的数量。 因此，公开了用于构建子数据库的方法，以适当地实现相应的新颖搜索例程并执行新颖的搜索例程本身以及实现所有前述的路由器。 本文公开的许多发明特征适用于其它路由DPJ协议，例如OSI路由，呼叫路由和电话DPJ网络以及字符串匹配问题。
-
公开(公告)号：US08370454B2
公开(公告)日：2013-02-05
申请号：US10563071
申请日：2004-05-07
IPC分类号： G06F15/16
CPC分类号： G06F17/30094 , G06F17/30215
摘要： There are introduced ways for retrieving or depositing a replica of an electronic document in a computer network. After having selected at least one replica number, a given function is applied. The function requires as input the replica number and a document identifier. The function returns as a result at least one entity identifier, each entity identifier representing an entity in the network that might provide the replica. In a next step, a document related request is addressed to at least one of the identified entities.
摘要翻译： 引入了在计算机网络中检索或存放电子文档副本的方法。 在选择了至少一个副本号后，应用给定的功能。 该功能需要输入副本号和文档标识符。 该函数作为结果返回至少一个实体标识符，每个实体标识符表示网络中可能提供副本的实体。 在下一步骤中，文档相关请求被发送到所标识的实体中的至少一个。
-
公开(公告)号：US06212184B1
公开(公告)日：2001-04-03
申请号：US09115886
申请日：1998-07-15
IPC分类号： H04L1256
CPC分类号： H04L45/745 , H04L45/00 , H04L45/7457 , H04L49/25 , H04L49/3009 , H04L49/602
摘要： Fast, scalable methods and devices are provided for layer four switching in a router as might be found in the Internet. In a first method, a grid of tries, which are binary branching trees, is constructed from the set of routing filters. The grid includes a dest-trie and a number of source tries. To avoid memory blowup, each filter is stored in exactly one trie. The tries are traversed to find the lowest cost routing. Switch pointers are used to improve the search cost. In an extension of this method, hash tables may be constructed that point to grid-of-tries structures. The hash tables may be used to handle combinations of port fields and protocol fields. Another method is based on hashing, in which searches for lowest cost matching filters take place in bit length tuple space. Rectangle searching with precomputation and markers are used to eliminate a whole column of tuple space when a match occurs, and to eliminate the rest of a row when no match is found. Various optimizations of these methods are also provided. A router incorporating memory and processors implementing these methods is capable of rapid, selective switching of data packets on various types of networks, and is particularly suited to switching on Internet Protocol networks.
摘要翻译： 为在互联网中可能找到的路由器中的第四层交换提供了快速，可扩展的方法和设备。 在第一种方法中，从一组路由过滤器构建一个作为二叉分支树的尝试网格。 网格包括一个目标和一些源尝试。 为了避免内存溢出，每个过滤器都存储在正好一个特里。 遍历尝试以找到最低成本的路由。 切换指针用于提高搜索成本。 在该方法的扩展中，可以构造指向尝试结构的哈希表。 哈希表可用于处理端口字段和协议字段的组合。 另一种方法是基于散列，其中最低成本匹配滤波器的搜索发生在位长度元组空间中。 使用预先计算和标记的矩形搜索用于在发生匹配时消除整列元组空间，并且在找不到匹配时消除其余行。 还提供了这些方法的各种优化。 包含实现这些方法的内存和处理器的路由器能够在各种类型的网络上快速，选择性地切换数据分组，并且特别适合于互联网协议网络上的切换。
-
-
-
-
-
-
-
-
-
搜索结果
30 条记录 (耗时 0.027 秒)
