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 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: 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: The present invention relates to a digital audio and/or video recorder and to a method for recording of program data comprised in a transport stream, the transport stream having metadata, the method comprising the steps of: de-multiplexing the transport stream to provide the program data and the metadata, storing the program data in a digital recording format, the digital recording format having a first data structure for storing of navigation data and a second data structure of a second stream format for storage of program data packets, transforming the metadata into the first data structure, and storing the transformed metadata as part of the navigation data.

Abstract: The invention relates to the field of network communication in a wide area, where a local network of a first type has a sending station that communicates with a receiving station in a local network of a second type. A network of a third type is in between the two networks and provides virtual private networking between the two local networks. The network of the first type supports a fine grained QoS, whereas the network of the third type supports a coarser grained QoS. In one example the network of the first type is RSVP capable and the network of the second type is an MPLS network. The invention resides in a component called RSVP-MPLS proxy that maps the RSVP resource advertisements and reservations within an RSVP-aware customer network to an MPLS network, whereby the receiver side doesn't participate in the RSVP communication process.

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 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: Search engines for searching within home networks shall be optimised. Therefore, it is suggested to dynamically adapt a weight of an individually metadata of a data unit of the database by analysing an external database. For example, web page information is used to individually influence the ranking of the search results.

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: 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: A comfortable method and device for searching databases are required. Thus, a database access concept including an interface descriptor is proposed. The interface descriptor may be a XML-file which describes interface categories and database access strategies. The database interface machine may comprise a standard category display method and a standard database access method. The database interface machine can use the definitions contained in the interface descriptor to set up a categorized interface to the database and to perform complete database searches.

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: The resistance against recording defects of a write-once optical disk is enhanced allowing realtime recording and playback of data streams with a single speed disk drive. A data stream is recorded in data blocks on the optical disk. An error correction block for one or more data blocks is generated and written on the same optical disk during recording. A spare data area is kept blank on the storage medium and used for storing a defect data block reconstructed by using the error correction block.

Abstract: 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, creating a new peer-group identifier, publishing within the peer-group a first peer-group advertisement message 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 in the superordinate peer-group, wherein both advertisement messages may be identical.

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: The invention comprises an application for recording and the playback of MPEG-2 transport-streams transmitted via DVB-systems with optical discs. Apart from audio- and video-signals, additional information (which describe the content of the DVB-multiplex) will also be transmitted in DVB-SI descriptors. These descriptors correspond to the incoming transport-stream-packets and can be used for comfortable features, like event-triggered start of a recording or automatic generation of play-lists.

Abstract: In modern digital video recorders not only the video/audio data stream itself is stored in data packets on the medium but also additional information about the stream. Part of this additional information is navigation information for random access to segments within the recorded material. A playlist is used that includes a sequence of substructure information data carrying start and end time data and addressing mode information for the segments. The substructure information data provide information describing each segment within one recording and where the segment data can be found on the storage medium. Because the playlist level does not include addressing mode information for the segments, segments having any addressing mode can be replayed using a single playlist.

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 invention relates to the updating of 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 a 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.