利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

1312 条记录 (耗时 0.022 秒)

    PERFORMING A TIME MEASUREMENT IN A COMMUNICATION NETWORK
    104.
    发明公开
    PERFORMING A TIME MEASUREMENT IN A COMMUNICATION NETWORK 有权
    定时在通信网络实现

    公开(公告)号：EP2520059A1

    公开(公告)日：2012-11-07

    申请号：EP09802148.8

    申请日：2009-12-29

    申请人： Telecom Italia S.p.A.

    发明人： COCIGLIO, Mauro

    IPC分类号： H04L29/06 ,  H04L12/26

    CPC分类号： H04L65/602 ,  H04L43/0858 ,  H04L43/087 ,  H04L43/106 ,  H04L65/4053 ,  H04L65/80

    摘要： It is disclosed a method for performing a time measurement on a data flow transmitted from a transmitter to a receiver of a communication network. The method comprises: at the transmitter, dividing the data flow in first and second time alternating blocks of data units, transmitting them, increasing a transmission counter while the first blocks are transmitted and setting a transmission timestamp to a current time when a predetermined data unit of each first block is transmitted; at the receiver, receiving the first and second blocks, increasing a reception counter while the first blocks are received and setting a reception timestamp to a further current time when the predetermined data unit of each first block is received; and at a management server, periodically detecting values of the transmission counter, the reception counter, the transmission timestamp and the reception timestamp, and using them for performing the time measurement.

    METHOD AND SYSTEM FOR CARRYING OUT SEARCHES IN A DATABASE
    106.
    发明公开
    METHOD AND SYSTEM FOR CARRYING OUT SEARCHES IN A DATABASE 有权
    方法和系统，以搜查数据库

    公开(公告)号：EP2519897A1

    公开(公告)日：2012-11-07

    申请号：EP09810888.9

    申请日：2009-12-30

    申请人： Telecom Italia S.p.A.

    发明人： ADZIC, Jovanka ,  BELLUATI, Maurizio ,  DE NOIA, Giuseppe ,  FIORE, Valter

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30321 ,  G06F17/30595 ,  G06F17/30864 ,  H04L29/08981

    摘要： According to another aspect of the present invention, a method for carrying out searches in a database (250, 260, 270) by means of a data processing system (130) is provided. The database includes a first plurality of first data items and a second plurality of second data items; the database is structured to enable a generic first data item to be in relationship with one or more second data items and vice versa. The method comprises based on the database, generating in an internal memory (240) of the data processing system at least one among a first data table structure (280) and a second data table structure (285). Each one among the first and second data table structures comprises a first data table (420; 520) comprising a plurality of elements each one corresponding to a respective first data item; the elements of the first data table are univocally identified by a respective first index, The first and second data table structures further comprise a second data table (410; 510) comprising a plurality of elements each one corresponding to a respective second data item; the elements of the second data table are univocally identified by a respective second index. The first and second data table structures still further comprise a third data table (430; 530) comprising a plurality of elements each one being in a univocal relationship with a respective element of the first data table and in a univocal relationship with a respective element of the second data table. The method further comprises receiving a search string (IS) comprising an identifier of a first data item or of a second data item. If the search string comprises an identifier of a first data item, the method further provides for accessing at least one element of the first data table based on the search string; accessing at least one element of the third data table corresponding to the accessed element of the first data table and retrieving from the accessed element of the third data table the second index of at least one corresponding element of the second data table; accessing the second data table using said second index for extracting a search result. If the search string comprises an identifier of a second data item, the method further comprises accessing at least one element of the second data table based on the search string; accessing at least one element of the third data table corresponding to the accessed element of the second data table and retrieving from the accessed element of the second data table the first index of at least one corresponding element of the first data element; accessing the first data table using said first index for extracting a search result.

    IMPROVED CACHING OF DIGITAL CONTENTS IN P2P NETWORKS
    109.
    发明公开
    IMPROVED CACHING OF DIGITAL CONTENTS IN P2P NETWORKS 有权
    数字内容P2P网络的改进的高速缓存

    公开(公告)号：EP2497251A1

    公开(公告)日：2012-09-12

    申请号：EP09759695.1

    申请日：2009-11-03

    申请人： Telecom Italia S.p.A.

    发明人： CIMINIERA, Luigi ,  PAPA MANZILLO, Marco ,  VERCELLONE, Vinicio ,  ULLIO, Mario

    IPC分类号： H04L29/08

    CPC分类号： H04L67/104 ,  G06F17/30209 ,  G06F17/30902 ,  H04L63/0435 ,  H04L67/1065 ,  H04L67/1076 ,  H04L67/2842

    摘要： A method for enabling sharing of content files among nodes of a P2P network is provided. The P2P network comprises sub-networks each including a respective plurality of nodes capable of storing content files. Each sub-network has an associated corresponding hash table for indexing the content files stored in the nodes of the sub-network. The hash table is distributed among at least some of the nodes of the sub-network. The method comprises, for each content file stored in at least one node of a sub-network, storing in the hash table associated with the sub-network a criticality index providing an indication of the degree of sharing of the content file among the nodes of the sub-network. The method causes a node to cache at least one content file for sharing with other nodes of the sub-network based on the criticality index of the at least one content file.