Abstract: An architecture for a multimedia peer-to-peer home network allows the simple definition of peer groups, or zones, where each peer is capable of automatically identifying whether other peers are members of the same group, or of another group, by using group labels. Each peer may freely cooperate with the other peers of the same group, or with peers of previously specified other groups. e.g. exchange information or share resources. The architecture aims to map an atmosphere of trust existing between users to a technical system. namely their respective home networks. Using this architecture, it is e.g. possible that users who trust each other may give each other access to their own home network, or parts of it.

Abstract: 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 meta-data into the MXF files enable both seamless real-time stream recording and stream-able data playback.

Abstract: The present invention relates to a method for ensuring data consistency upon mapping of a hierarchical data format to a relational database management system.

Abstract: The use of disk-assisted, dynamic databases is to be optimized. To this end, provision is made for new data intended to update an old stock of data to have a second index, relating to the new data, generated for them, and for said second index to be stored on the disk storage medium as a supplement to the first index relating to the old stock of data. This allows the number of write access operations to the disk storage medium to be reduced. This is particularly advantageous for optical media, whose useful life can be increased as a result.

Abstract: In current Distributed Storage Systems, applications may determine the device on which data shall be stored. The invention provides a method for automatically selecting an individual storage device within a DSS. A method for automatically classifying a node in a network comprises determining data classes, automatically classifying data of said data classes stored on a node, determining the amount of stored data per data class, calculating data dominance values for each of the data classes, receiving a request that indicates a data type according to one of said data classes, and providing said dominance value according to the requested data class. Further, a method for automatically organizing nodes in a network comprises receiving a request for storing data of a particular data type, transmitting the request to storage nodes, receiving from the storage nodes respective dominance values, and selecting the node with the highest dominance value for storing the data.

Abstract: An architecture for a multimedia peer-to-peer home network allows the automated definition of peer groups, or zones, by using group labels, where each peer is capable of automatically identifying whether other peers are members of the same group, or of another group, and where each peer may freely cooperate with other peers of the same group, e.g. exchange information or share resources like storage capacity. Using this architecture, it is e.g. possible that a user who is accessing a node within a peer group has also access to any other node of the peer group, without being requested for authentication. Another characteristic is that other peer groups can be defined which have access rights to network resources and services. Advantageously, the invention simplifies network creation and operation by not requiring the user to have special networking knowledge.

Abstract: The invention relates to a storage medium on which a set of data is stored, whereby a first data section of the data set is stored in a read-only memory area and a second data section of the data set is stored in a read/write memory area, and the data set comprises language-independent data and language-dependent data. The data set can be processed in a handling device either in a first processing form related to a first language, or in a different processing form related to a second language. Language-independent data and language-dependent data which are related to the first language are included in the first data section, and language-dependent data which are related to the second language are included in the second data section. For the processing in different form, data from the second data section as well as data from the first data section are to be used.

Abstract: A data transfer in a network comprises a first node sending out a request for a particular data unit, a second node receiving and analysing the request, detecting that it may provide the requested data unit and sending to the first node a message indicating that it may provide the requested data unit, the first node receiving and selecting the message and sending a second request to the second node to request transfer of the particular data unit, and the second node transferring the particular data unit upon reception of the second request. A method for assigning a priority to such data transfer in a network comprises the first node assigning an identifier corresponding to a first priority to the request, the second node evaluating the identifier and, based on the identifier, calculating a second priority and assigning the calculated second priority to said transfer.

Abstract: Current peer-to-peer 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, including the steps of a first peer being either a member of the first peer-group or a secondary peer relating to a primary peer, wherein the primary peer is a member of the first peer-group, sending a message to the second peer-group; a second peer being a member of the second peer-group receiving said message, detecting credentials of first peer and first peer-group, and detecting whether a connection is allowed; and if so, granting the first peer membership with the second peer-group.

Abstract: A logical quality-of-service management method for peer-to-peer networks 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 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 messages.

Abstract: The handling of metadata being provided in different formats shall be simplified. Tehrefore, it is suggested to provide metadata in a first metadata structure having a first format and providing a second metadata structure having a first format and providing a second metadata structure having a second format, wherein link data are deposited in the second metadata structure. The link data point to metadata in the first metadata structure. Thus, it is possible to trealize synchronous and automatic editing of metadata and its mirror metadata.

Abstract: When recording packetized real-time streaming data, e.g. multimedia data, it is in general not possible to know in advance the size of the data stream, and thus the required storage area. Therefore the storage device may be full before the data stream is completely stored. The disclosed method for storing and retrieving the remaining part of the data stream on another storage device uses metadata tags (10,11) and data buffers (IB1,IB2) to split a data stream seamlessly into chunks while recording it, and distribute the chunks in real-time to different connected storage devices (D1,D2), so that the chunks can be seamlessly concatenated again in real-time for replaying the stream. The metadata tags (10,11) contain identifiers for the successive storage node (N2) and/or the preceding storage node (N1) and for the last stored application packet.

Abstract: The present invention relates to a method for ensuring data consistency upon mapping of a hierarchical data format to a relational database management system.

Abstract: The generation of metadata shall be simplified. Therefore, a method is presented in which a metadata-template is filled with selected essence and MD-links obtained from a list of links to essence and/or a list of current metadata. Furthermore, it is possible to obtain the MD-links from further metadata or essences directly or indirectly linked with the selected essence.

Abstract: Metadata databases shall be cleaned regularly. Those metadata which are not utilized as index information of essence anymore should be deleted. Thus, there is provided a method and a device to save the selected metadata as essence. This means that metadata seleceted by a graphical user interface are converted into a new essence by taking over the MD-essence of the metadata into the new essence. The user may find further essence data on the basis of the MD-link of the selected metadata which could be added to new essence.

Abstract: This invention deals with an architecture for a multimedia peer-to-peer home network which allows the simple definition of peer groups, or zones, where each peer is capable of automatically identifying whether other peers are members of the same group, or of another group, by using group labels, and where each peer may freely cooperate with the other peers of the same group, or with peers of previously specified other groups, e.g. exchange information or share resources. The architecture aims to map an atmosphere of trust existing between users to a technical system, namely their respective home networks.

Abstract: An architecture for a multimedia peer-to-peer home network allows the automated definition of peer groups, or zones, by using group labels, where each peer is capable of automatically identifying whether other peers are members of the same group, or of another group, and where each peer may freely cooperate with other peers of the same group, e.g. exchange information or share resources like storage capacity. Using this architecture, it is e.g. possible that a user who is accessing a node within a peer group has also access to any other node of the peer group, without being requested for authentication. Another characteristic is that other peer groups can be defined which have access rights to network resources and services. Advantageously, the invention simplifies network creation and operation by not requiring the user to have special networking knowledge.

Abstract: In case of a loss of power supply a short-circuit between the corresponding pins of the two IEEE 1394 connectors of a device is established. Preferably this will be achieved by a relay controlling switches. If power is available, the relay is powered and the switches are open. The device then behaves like without this extension. If power is lost, the relay is not powered any longer, and the switches are closed. By this way, the device simply disappears from the cluster, which will then be reorganised according to IEEE 1394 rules.

Abstract: The invention relates to a storage medium on which a set of data is stored such that at least part of the set of data can be read and processed using a evaluation device, one part of the set of data being stored in a read-only memory area and another part of the set of data being stored in a read/write memory area of the storage medium. At least part of the set of data is read by means of the evaluation device and can be processed in a first processing form and at least one other processing form, each of which can be selected by means of the evaluation device, independent data in the set of data, which independent data can be used both for the at least partial processing of the set of data in the first processing form and for the at least partial processing of the set of data in the at least one other processing form, being included in the first part of the set of data, which part is stored in the read-only memory area.

Abstract: A process of image signal coding provides motion vectors for blocks of picture elements (pixels). An array of motion vectors for pixel blocks may be used to generate a zoom and pan vector for a full image. When the format of a vertically subsampled image is changed before coding, motion parameters for a full image are used to obtain maximum local resolution after subsampling. Remaining image areas which have not been fully motion compensated are detected by an alteration (change) detector and are vertically filtered in a field.