中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

31 records (took 0.025 seconds)

    GLOBAL TRAFFIC MANAGEMENT USING MODIFIED HOSTNAME
    21.
    发明公开
    GLOBAL TRAFFIC MANAGEMENT USING MODIFIED HOSTNAME 审中-公开
    全球流量管理使用修改的主机名

    公开(公告)号：EP2700208A2

    公开(公告)日：2014-02-26

    申请号：EP12773669.2

    申请日：2012-04-06

    Applicant: Microsoft Corporation

    Inventor： HUANG, Cheng ,  BATANOV, Ivan Ivanov ,  LI, Jin

    IPC: H04L29/02 ,  H04L29/10

    CPC classification number: H04L61/609 ,  H04L47/12 ,  H04L61/1511 ,  H04L61/301 ,  H04L61/305 ,  H04L67/1002

    Abstract: A particular method includes receiving a request from a client at a server and sending a global traffic management identifier in response to the request from the client. The global traffic management identifier is determined based on an attribute of the client. In response to the client requesting access to a service based on a modified hostname of the service, a data center associated with the service is identified based on the modified hostname of the service. The modified hostname identifies the global traffic management identifier, and the identified data center is useable by the client to access the service.

    ADAPTIVE INDEX FOR DATA DEDUPLICATION
    26.
    发明公开
    ADAPTIVE INDEX FOR DATA DEDUPLICATION 审中-公开
    可自定义的列表数据的重复数据删除

    公开(公告)号：EP2659377A2

    公开(公告)日：2013-11-06

    申请号：EP11852446.1

    申请日：2011-12-28

    Applicant: Microsoft Corporation

    Inventor： LI, Jin ,  SENGUPTA, Sudipta

    IPC: G06F12/00

    CPC classification number: G06F17/30097 ,  G06F17/3007 ,  G06F17/30159

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks.

    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION
    27.
    发明公开
    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION 审中-公开
    VERWENDUNG EINER INDEXPARTITIONIERUNG UND-ABSTIMMUNGFÜREINE DATENDEDUPLIZIERUNG

    公开(公告)号：EP2659376A2

    公开(公告)日：2013-11-06

    申请号：EP11852319.0

    申请日：2011-12-23

    Applicant: Microsoft Corporation

    Inventor： LI, Jin ,  SENGUPTA, Sudipta ,  KALACH, Ran ,  DESAI, Ronakkumar N. ,  OLTEAN, Paul Adrian ,  BENTON, James, Robert

    IPC: G06F12/00

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

    Abstract translation: 本发明涉及一种数据重复数据删除技术，其中散列索引服务的索引被划分为子空间索引，其中小于整个散列索引服务的索引来缓存内存。 访问子空间索引以确定数据块是否已经存在或需要进行索引和存储。 索引可以根据与要索引的数据相关联的标准被划分为子空间，例如文件类型，数据类型，最后使用时间等等。 还描述了子空间协调，其中检测子空间中的重复条目，以便从重复数据删除系统中删除条目和块。 当更多的系统资源可用时，子空间协调可以在非高峰时间执行，并且如果需要资源，则可能被中断。 调和的子空间可以基于相似性，包括通过相似性的签名，每个紧密地表示子空间的散列。

    LOW RAM SPACE, HIGH-THROUGHPUT PERSISTENT KEY-VALUE STORE USING SECONDARY MEMORY
    28.
    发明公开
    LOW RAM SPACE, HIGH-THROUGHPUT PERSISTENT KEY-VALUE STORE USING SECONDARY MEMORY 审中-公开
    具有低高吞吐量和RAM的地方，与使用辅助内存中的持久密钥存储器

    公开(公告)号：EP2633413A2

    公开(公告)日：2013-09-04

    申请号：EP11834842.4

    申请日：2011-10-04

    Applicant: Microsoft Corporation

    Inventor： SENGUPTA, Sudipta ,  DEBNATH, Biplob Kumar ,  LI, Jin

    IPC: G06F12/02

    CPC classification number: G06F16/9014

    Abstract: Described is using flash memory (or other secondary storage), RAM-based data structures and mechanisms to access key-value pairs stored in the flash memory using only a low RAM space footprint. A mapping (e.g. hash) function maps key-value pairs to a slot in a RAM-based index. The slot includes a pointer that points to a bucket of records on flash memory that each had keys that mapped to the slot. The bucket of records is arranged as a linear-chained linked list, e.g., with pointers from the most-recently written record to the earliest written record. Also described are compacting non-contiguous records of a bucket onto a single flash page, and garbage collection. Still further described is load balancing to reduce variation in bucket sizes, using a bloom filter per slot to avoid unnecessary searching, and splitting a slot into sub-slots.

    Abstract translation: 使用闪速存储器（或其它辅助存储器），基于RAM的数据结构和机制，以访问存储在仅使用低RAM空间占用闪存键 - 值对所述。 的映射（例如，散列）函数键 - 值对映射到在基于RAM的索引的槽。 该槽包括一个指针没有指向记录在闪存上的铲斗做各自具有键并映射到时隙。 记录桶被设置为线性链链接列表，例如从最近写入记录的最早的文字记三分球。 如此描述被压缩水桶的非连续记录到一个单一的闪存页面，和垃圾收集。 仍然进一步地描述的是负载平衡，以减少在桶的大小的变化，使用每时隙一个布隆过滤器，以避免不必要的搜索，和分割的槽成子时隙。

    USING DNS REFLECTION TO MEASURE NETWORK PERFORMANCE
    29.
    发明公开
    USING DNS REFLECTION TO MEASURE NETWORK PERFORMANCE 审中-公开
    利用测量网络性能性功能的DNS思考

    公开(公告)号：EP2564559A2

    公开(公告)日：2013-03-06

    申请号：EP11777931.4

    申请日：2011-04-26

    Applicant: Microsoft Corporation

    Inventor： HUANG, Cheng ,  HOLT, Nicholas Leonard ,  GREENBERG, Albert G. ,  LI, Jin

    IPC: H04L12/26 ,  H04L12/24

    CPC classification number: H04L61/1511 ,  H04L29/12066 ,  H04L43/0864

    Abstract: A top level domain name system (DNS) server receives a DNS query from a local DNS resolver, the DNS query requesting a network address corresponding to a domain name. The top level DNS server reflects the local DNS resolver to a reflector DNS server. The reflector DNS server reflects the local DNS resolver to a collector DNS server, which in turn returns the network address to the local DNS resolver. The reflector DNS server and collector DNS server are both in the same data center, and one or more network performance measurements for communications between the local DNS resolver and the data center are determined based on the communications between the local DNS resolver and both the reflector DNS server and the collector DNS server.

    ISP-AWARE PEER-TO-PEER CONTENT EXCHANGE
    30.
    发明公开
    ISP-AWARE PEER-TO-PEER CONTENT EXCHANGE 有权
    ISP意识的对等网络内容交换

    公开(公告)号：EP2171605A1

    公开(公告)日：2010-04-07

    申请号：EP08747791.5

    申请日：2008-05-07

    Applicant: Microsoft Corporation

    Inventor： LI, Jin ,  HUANG, Cheng

    IPC: G06F15/16

    CPC classification number: H04L67/1021 ,  H04L67/1002 ,  H04L67/104 ,  H04L67/108 ,  H04L67/1089

    Abstract: An Internet Service Provider (ISP) aware peer-to-peer (P2P) content exchange system and method for exchanging content over a P2P network using the Internet. The system and method accounts for the type of relationship between peers and classifies and groups each peer according to these relationships. A peer overlay is constructed and peers within a peer's neighborhood are favored over peers outside of the neighborhood. Peer scheduling is utilized to exchange information regarding availability of blocks of content. This block availability information can be exchanged differently and its frequency changed depending on a peer's classification. Peers are selected for block exchange based on their classification. A peer selection proportion may be defined that dynamically changes depending on contents of a peer's download buffer. The blocks to be exchanged are selected based on the block availability information, and the rarest blocks are exchanged before the more common blocks.

Patent Agency Ranking