Method for managing elements of a peer-group
    12.
    发明公开
    Method for managing elements of a peer-group 审中-公开
    用于管理对等组的元素的方法

    公开(公告)号:EP1633079A1

    公开(公告)日:2006-03-08

    申请号:EP04020701.1

    申请日:2004-09-01

    IPC分类号: H04L12/24 H04L29/12 H04L29/06

    摘要: For the creation and self-organization of peer-groups the JXTA protocol may be used, which includes messages such as peer or peer-group advertisements and services such as the discovery service. Conventional peer-groups of this type are static and need restart after any modification, e.g. a new service. A method for dynamically managing hardware and/or software elements, e.g. services, utilized and/or offered by such peer-groups comprises detecting a change within a peer-group (OZ), creating a new peer-group identifier, publishing within the peer-group a first peer-group advertisement message (PGA1) that includes the current and the new peer-group identifier and pointers to current services including the detected modification, accepting the new peer-group identifier by the other peer-group members, and publishing a second peer-group advertisement message (PGA2) in the superordinate peer-group (NPG), wherein both advertisement messages may be identical. Thus, peer-groups may operate continuously while peers modify, add or delete services.

    摘要翻译: 为了创建和自组织对等组,可以使用JXTA协议,其中包括诸如对等或对等组通告以及诸如发现服务之类的服务的消息。 这种类型的常规对等组是静态的,需要在任何修改后重新启动,例如, 一项新服务。 动态管理硬件和/或软件元件的方法,例如, 由这样的对等组使用和/或提供的服务包括检测对等组(OZ)内的改变,创建新的对等组标识,在对等组内发布第一对等组通告消息(PGA1) 包括当前和新的对等组标识符和指向包括检测到的修改的当前服务的指针,由其他对等组成员接受新的对等组标识符,以及在上级中发布第二对等体组通告消息(PGA2) 对等组(NPG),其中两个广告消息可以是相同的。 因此,对等组可以连续操作,而对等组修改,添加或删除服务。

    Method and device for updating a local copy of metadata
    13.
    发明公开
    Method and device for updating a local copy of metadata 审中-公开
    Verfahren und Vorrichtung zur Aktualisierung von lokal gespeicherten Metadaten

    公开(公告)号:EP1511034A1

    公开(公告)日:2005-03-02

    申请号:EP03090270.4

    申请日:2003-08-27

    IPC分类号: G11B27/00 G11B27/10

    摘要: When updating a local copy of metadata, first change history data of metadata are read from an optical storage medium. Second change history data of the metadata are read from a local storage of an optical storage medium playback and/or recording device. If the first and second change history data are different a change attribute is read from the optical storage medium and an update operation of the metadata stored in the local storage or an update operation in the optical storage medium is determined depending on the change attribute.

    摘要翻译: 当更新元数据的本地副本时,从光学存储介质读取元数据的第一次更改历史数据。 从光存储介质回放和/或记录装置的本地存储器中读取元数据的第二改变历史数据。 如果第一和第二改变历史数据不同,则从光存储介质读取改变属性,并且根据变化属性确定存储在本地存储器中的元数据的更新操作或光存储介质中的更新操作。

    Method for assigning an identifier to a peer-group in a peer-to-peer network
    14.
    发明公开
    Method for assigning an identifier to a peer-group in a peer-to-peer network 审中-公开
    在对等网络将标识符分配给一组对等节点中的方法

    公开(公告)号:EP1480415A1

    公开(公告)日:2004-11-24

    申请号:EP03011674.3

    申请日:2003-05-23

    IPC分类号: H04L29/12

    摘要: Networks, particularly home networks, may be implemented using peer-to-peer technology. To relieve the user from administrative tasks, some configuration routines for such networks may be automated. Therefore a peer-group (OZ_20,OZ_21) selects one of its peers as negotiation peer (N21,N23), having the task to communicate with single other peers or negotiation peers from other peer-groups. When adding or removing single peers, or merging or splitting peer-groups, the group label (Z_ID A ,Z_ID B ) is usually modified. But it may be advantageous to keep the group label, especially if that label is known to other peer-groups. If a new peer-group in a peer-to-peer network is created by merging or splitting other peer-groups, a method for selecting a group label for the new peer-group comprises determining a negotiation peer, exchanging information between the negotiation peers in the case of merging, comparing features of the two peer-groups and based on the comparison assigning the label (Z_ID B ) of one of the peer-groups to the new peer-group (OZ_2).

    摘要翻译: 网络,特别是家庭网络,可以使用对等网络技术来实现。 以减轻管理任务的用户,寻求网络的一些配置程序可以自动的。 因此,一个对等体组(OZ_20,OZ_21)选择其对等体如等协商(N21,N23)的一个,其具有与来自其它对等体组的其它对等体或单个对等体协商进行通信的任务。 添加或删除单个对等体时,或者合并或拆分对等体组,该组标签(Z_IDA,Z_IDB)通常修改。 但它可能是有利的,以保持组标签,爱,特别是如果没有标签,是已知的其他对等组。 如果在对等网络新的对等组被合并或拆分等同行团体创建的,选择一组标签的新的对等组的方法,包括确定采矿谈判同行,协商同行之间交换信息 在合并,比较这两个对等体组的特征和基于所述比较分配对等体的基团的新的对等组(OZ_2)中的一个的标签(Z_IDB)的情况下。

    Method of assigning an absolute time value to an entry point of a data stream sequence
    15.
    发明公开
    Method of assigning an absolute time value to an entry point of a data stream sequence 审中-公开
    将绝对时间值分配给数据流序列的入口点的方法

    公开(公告)号:EP1439700A1

    公开(公告)日:2004-07-21

    申请号:EP03000899.9

    申请日:2003-01-16

    IPC分类号: H04N7/24

    摘要: The invention relates to assigning a first absolute time value to an entry point, the entry point being located at a first position in a data stream sequence, the data stream having data packets with relative time stamps. A second absolute time value is provided for a second position of the data stream sequence. The absolute time value is determined for the entry point based on the second absolute time value and the relative time stamps of data packets between the first and second positions.

    摘要翻译: 本发明涉及向入口点分配第一绝对时间值,入口点位于数据流序列中的第一位置,该数据流具有带有相对时间戳的数据分组。 为数据流序列的第二位置提供第二绝对时间值。 基于第二绝对时间值和第一和第二位置之间的数据分组的相对时间戳确定入口点的绝对时间值。

    Method for establishing communication between peer-groups
    16.
    发明公开
    Method for establishing communication between peer-groups 审中-公开
    Eine Methode zur aufbauen einer Kommunikation zwischen Peer-Gruppen

    公开(公告)号:EP1646205A1

    公开(公告)日:2006-04-12

    申请号:EP04024017.8

    申请日:2004-10-08

    IPC分类号: H04L29/08

    摘要: Current peer-to-peer (P2P) systems are well defined for messaging and collaboration of peers running the same proprietary software and protocols, e.g. Kazaa or EDonkey. The generic framework JXTA for P2P computing provides various peer-group mechanisms and may address different applications, but provides no convenient method for exchanging messages between different peer-groups. The invention discloses a bridging concept and a delegate concept to establish communication between a first and a second peer-group (OZ1,OZ2), including the steps of a first peer being either a member (Node_ID3) of the first peer-group (OZ1) or a secondary peer (H) relating to a primary peer (G), wherein the primary peer (G) is a member of the first peer-group (OZ1), sending a message to the second peer-group (OZ2); a second peer (Node_ID2) being a member of the second peer-group (OZ2) receiving said message, detecting credentials of first peer and first peer-group (OZ1), and detecting whether a connection is allowed; and if so, granting the first peer (Node_ID3,H) membership with the second peer-group (OZ2).

    摘要翻译: 当前的对等(P2P)系统被很好地定义为运行相同的专有软件和协议的对等体的消息传递和协作,例如。 Kazaa或EDonkey。 用于P2P计算的通用框架JXTA提供了各种对等组机制,并且可以解决不同的应用,但是不提供用于在不同对等体组之间交换消息的方便的方法。 本发明公开了一种用于建立第一和第二对等体组(OZ1,OZ2)之间的通信的桥接概念和委托概念,包括第一对等体作为第一对等组(OZ1,OZ2)的成员(Node_ID3) )或与主对等体(G)相关的次要对等体​​(H),其中所述主对等体(G)是所述第一对等体组(OZ1)的成员,向所述第二对等体组(OZ2)发送消息; 接收所述消息的第二对等组(OZ2)的成员的第二对等体(Node_ID2),检测第一对等体和第一对等组(OZ1)的凭证,以及检测是否允许连接; 如果是,则向第二对等组(OZ2)授予第一对等体(Node_ID3,H)成员资格。

    Method and device for improving quality-of-service management in peer-to-peer networks
    17.
    发明公开
    Method and device for improving quality-of-service management in peer-to-peer networks 审中-公开
    用于改善对等网络中的服务质量管理的方法和设备

    公开(公告)号:EP1633088A1

    公开(公告)日:2006-03-08

    申请号:EP04090339.5

    申请日:2004-09-02

    IPC分类号: H04L12/56 H04L29/08

    摘要: A logical quality-of-service (QoS) management method for peer-to-peer networks (OZ) uses a special group service for QoS management within peer-groups. This group service determines and assigns a budget per time unit for each peer. Such time unit may be in the range of milliseconds or few seconds. It may also determine a group budget for the peer-group. While a peer (N1,...,N6) uses bandwidth, i.e. while it sends or receives data, its budget is decreased. When a peer has exhausted its budget, it has to lower its priority for transferring or receiving data. Each peer is responsible for keeping its own budget. If a peer does not keep the conditions, other peers may have the right to deny the data transfer from that peer. The QoS service function is advertised in peer-group advertisement (PGA) messages.

    摘要翻译: 对等网络(OZ)的逻辑服务质量(QoS)管理方法使用特殊的组服务在对等组内进行QoS管理。 该组服务为每个对等方确定并分配每个时间单位的预算。 这种时间单位可能在毫秒或几秒钟的范围内。 它也可以确定同伴组的组预算。 虽然同级(N1,...,N6)使用带宽,即在发送或接收数据时,其预算会减少。 当同伴用尽预算时,它必须降低转移或接收数据的优先级。 每个同行都有责任保留自己的预算。 如果对方不保留条件,其他对等方可能有权拒绝来自该对等方的数据传输。 QoS服务功能在对等组通告(PGA)消息中通告。

    Method and device for recording or playing back a data stream
    18.
    发明公开
    Method and device for recording or playing back a data stream 审中-公开
    用于记录或回放数据流的方法和设备

    公开(公告)号:EP1592015A2

    公开(公告)日:2005-11-02

    申请号:EP04009912.9

    申请日:2004-04-27

    IPC分类号: G11B27/00

    摘要: A distributed storage system able to support real-time recording of streaming data shall be provided. Therefore, on the basis of MXF files a data stream is packed into at least a first MXF file (1) and a second MXF file (2). First connection data (1 N ) are inserted into the first MXF file (1), wherein this first connection data (1 N ) points to the second MXF file (2). Furthermore, second connection data (2 L ) are inserted into the second MXF file (2), wherein the second connection data (2 L ) points to the first MXF file (1). These connection data inserted as metadata into the MXF files enable both seamless real-time stream recording and stream-able data playback.

    摘要翻译: 应提供能够支持实时记录流数据的分布式存储系统。 因此,在MXF文件的基础上,数据流至少被打包成第一个MXF文件(1)和第二个MXF文件(2)。 将第一连接数据(1N)插入到第一MXF文件(1)中,其中该第一连接数据(1N)指向第二MXF文件(2)。 此外,第二连接数据(2L)被插入到第二MXF文件(2)中,其中第二连接数据(2L)指向第一MXF文件(1)。 这些连接数据作为元数据插入到MXF文件中,可实现无缝实时流记录和可流式数据播放。

    Improved link resolving mechanism
    19.
    发明公开
    Improved link resolving mechanism 审中-公开
    Verbesserte Vorrichtung zurLösungvon Verbindungen

    公开(公告)号:EP1377063A1

    公开(公告)日:2004-01-02

    申请号:EP02090219.3

    申请日:2002-06-15

    IPC分类号: H04N7/24

    CPC分类号: H04N21/235 H04N21/435

    摘要: According to the invention every asset (metadata or essence) is labelled with a unique identifier and with the last action applied to this asset.
    A problem to be solved by the invention is to find a method for storing a recording, which includes storing the essence (A/V) of a recording on one storage medium and the metadata belonging to this recording on another storage medium.

    摘要翻译: 根据本发明,每个资产(元数据或本质)被标记有唯一的标识符,并且最后的操作被应用于该资产。 本发明要解决的问题是找到一种用于存储记录的方法,其包括将记录的本质(A / V)存储在一个存储介质上,以及将属于该记录的元数据存储在另一存储介质上。