WO2005004463A1 - Delivering method and receiving method for broadcast objects delivered via object carousel - Google Patents

Abstract

A delivering method of broadcast objects using an object carousel, comprising the steps of encoding an object in a module of the object carousel; encoding an object reference mechanism that determines the position of the object; and multiplexing the object carousel and object reference mechanism with a transport stream for broadcasting.

Description

 Description Delivery method and reception method of broadcast object delivered by object car cell

 The present invention relates to a distribution method and a reception method of a broadcast object distributed by an object car cell. Background art

 Data broadcasting is a significant extension of MPEG-2 based DTV systems that carry data in addition to video and audio. Examples of data broadcasting include downloading software, delivering Internet services, and interactive TV. The command and control of digital storage media (DSM—CC: Digital Storage Media Coram and Control, Ref. [1]) is based on the MPEG-2 compliant periodic broadcast of data modules on a network. It is defined to provide data broadcasting services.

In DSM-CC, a broadcast object is uniquely identified in the distribution system by its object reference. The object reference contains addressing information that uniquely identifies the object by the carousel ID, module ID, and object key. This addressing information can be detected in the broadcast inter-ORB protocol (BIOP, where ORB is the object resource protocol). The protocol is the default encoding method used within the DSM—CC U—U Object Carousel. In addition, the object reference is described by the BIOP :: 0bjectLocation LiteComponent, which is included in the object's interoperable object reference (IOR). BIOP:: 0bjectLocation LiteComponenttt Includes Canolease ID, module ID, and object key. Carousel ID provides context for the module ID field that identifies the module to which the object is delivered To do. The object key uniquely identifies an object in a module. An object can belong to only one u-U object cell. These BIOP messages are carried in the DSM-CC object car cell module. Each module is divided into blocks, and these blocks are carried in download data block (DDB) messages. The IOR carried by the down-save-in-one-initiate (DSI: DownloadServerInitiate) message contains references to directory and file objects that exist directly in the service gateway (SRG). The IOR carried in a directory's BIOP message contains a reference to a directory object and a file object that exists directly in that directory.

 Information on versioning, along with the module description and any logical grouping, is provided in the download control message and is defined using either a download-subscribe message or a download information indication (DII) message. You. This prior art provides a means for purging and updating. Each message type has its versioning mechanism. For any change in the content of the data, the version is incremented for the control message along with the version of the individual module in the changed data message. At that time, the receiver checks the version of the cached module and determines whether a new version is available from the stream. However, the prior art does not deal with the validity and applicability of past modules and the relationship of modules affected by changes in version.

The periodic distribution of the data modules in the data of the object carousel means is transmitted in a cyclic manner. If a receiver misses a particular module, it must wait for data to be retransmitted in the next cycle. This method is acceptable for small canolases / resizers transmitted with periodic characteristics. The larger the data power cell size and the longer the circulation interval, the less efficient it becomes. In such a case, the receiver will not use resources such as filters, memory, and CPU It is necessary to continuously filter and monitor the force roosel data until the required module is received.

 (Problems to be solved by the invention)

 To resolve the location of an object in an object carousel, consider an object carousel in the service gateway that contains a directory named "parent". Within its parent directory is another directory named "child", in which files reside. To determine the location of this file in the physical cell, the receiving device needs to get the IOR stored in the child directory object, which means that the child directory object needs to be loaded. Similarly, in order to resolve a child directory object, it is necessary to get the IOR stored by the parent directory object, and thus also load the parent directory object. To resolve the parent directory object, it is necessary to get the IOR stored in the service gateway that is loaded when the service domain is added. Thus, to load a file object, the receiving device must first load the intermediate directory object. These steps can cause substantial delays, especially when the requested object is deeply nested.

Carousel data sent over the network is organized into modules. For any changes in the data content, the version of the control and individual affected module messages will be incremented to reflect these changes. With this versioning mechanism, the receiver can detect any version change in individual modules, but cannot detect the mutual relationships or dependencies between modules affected by the version change. The receiving device may have started executing the downloaded application constructed from the carousel file and directory object when the version change occurs. In that case, the receiving device will close and reload the application, or You can continue execution with already cached modules. The first half of the implementation terminates the execution of the application each time the module version changes, whether or not the module has any effect on the execution of the application. Frequent occurrences of this will hinder this implementation. Later implementations will continue to execute applications from the cached memory containing both versions, while module updates continue in the background. This results in unpredictable application behavior.

 The prior art is not optimized for delivering large numbers of broadcast objects to resource-limited receivers such as digital TV receivers. For a large carousel, the receiver must monitor the receiving module in the carousel that requires a longer transmission period. To do so, a lot of resources are used for monitoring unnecessary modules and for potential searches. The task of monitoring and retrieving modules dramatically reduces the memory resources and section filters of the receiving device. Further, if the implementation performs pre-caching of data modules not currently needed by the application, the receiving device will immediately use and fulfill the memory to perform subsequent caching. (How to solve it)

 One aspect of the present invention relates to an object reference mechanism of an object car cell. The present invention provides a faster means of resolving the position of a desired object in the object carousel. This measure is implemented as a data structure containing the required module IDs and object keys that are used to uniquely determine the location of the object in the carousel.

Another embodiment of the present invention provides a mechanism for confirming the validity of an existing module when a version change is notified to a receiving device. This is achieved by embedding module cluster information and dependency information in the transport stream, so that the receiving device can version and update the cached module. And validation can be performed.

 Yet another aspect of the present invention processes time information associated with a broadcast object within an object cell to optimize the caching behavior of the receiving device. The present invention requires a method for multiplexing time schedule information into a transport stream used for optimizing operation at the receiving device. Thereby, the receiving apparatus can determine when each module becomes available on the transport stream, and can allocate resources to appropriately select these modules. This is achieved by the time control information provided by using a descriptor that distributes the time information of the module.

 The last aspect of the invention provides a means for quickly referencing a desired broadcast object within an object cell. This is realized by the receiving device resolving / loading the service domain and directory objects, by sequentially creating the location information of all the child objects immediately below it, and reloading / reloading the intermediate directory many times. Object resolution / load delay can be reduced without solving. Specifically, the present invention provides the following method.

 (A 1) The first method according to the present invention is a method of broadcasting off and delivering an object using an object carousel. The delivery method consists of encoding the object into a module of the object carousel, encoding the object's reference mechanism to resolve the object's location, and referencing the object's cell and the object's reference mechanism. Multiplexing into a transport stream for broadcast.

 (A2) The step of encoding the reference mechanism of the object includes the step of specifying the position of the structure including the addressing information of the object, and the step of specifying the addressing information of all the file objects in the object cell. Designating the structure.

(A3) In the above (A2), the step of designating the position of the structure containing the addressing information of the object may further comprise the step of specifying the object storing the structure Encoding the descriptor containing the addressing information of the object, and inserting the descriptor into the private data section of the download information display message delivered in the object carousel. The step of specifying the addressing information of all the file objects in the above structure includes a step of encoding a file message including the above structure in the message body part, and a step of encoding the file message in the above object cell. Inserting.

 (A 4) In the above (A 3), the step of encoding a file message further includes the step of encoding a path name of each file object in the object cell obtained by reference from the service gateway. Specifying a hashing algorithm to be used for encoding, and passing the values output by passing each pathname to the hashing algorithm (each of these values is then referred to as a hash code). The method may include the step of specifying and, with each hash code, the step of specifying address information for a file object whose path name produces the hash code.

 (A5) In the above (A4), the step of specifying the addressing information of the file object includes the step of specifying the identification information of the module in which the file object is located, and the step of specifying all of the modules included in the module. The method may include a step of specifying identification information of an object in which a file object is arranged in the object, and a step of specifying a path name of the file object.

 (A6) The second method according to the present invention provides a broadcast transport stream encoded in a module of an object carousel, wherein the object carousel and a reference mechanism of the encoded object are multiplexed. "This is a method of receiving broadcast objects distributed by the system.

The receiving method includes the steps of obtaining and decoding the reference mechanism of the encoded object multiplexed in the broadcast transport stream, and multiplexing the broadcast transport stream using the reference mechanism. Resolving the position of the object in the encoded object cell. (A7) In the above (A6), the step of acquiring and decoding the reference mechanism includes the steps of: detecting a position of a structure including addressing information of all file objects of the object car cell; The step of resolving the position of the object includes the steps of processing the information contained in the structure into a format that can be accessed in a later search; and searching for the addressing information of the object in the object carousel. And the step of performing.

 (A8) In the above (A7), the step of detecting the position of the structure including the addressing information of the object includes the step of detecting the position of the structure including the addressing information of the object in the private data section of the download information display message received from the object cell. A step of retrieving a descriptor (this descriptor includes addressing information of the object storing the above structure); and an object storing the above structure in one object cell based on the addressing information included in the descriptor. And a step of loading the data.

 (A9) In the above (A7), the step of processing the information included in the structure includes the step of decoding the hashing algorithm specified by the structure, and the step of decoding the information contained in the object cell. Hash code and addressing information related to each file object (addressing information is the identification information of the module in which the object in the above module is located, and the object in which the object is located among all the objects included in the above module) Decoding the tuple, including the identity of the object and the object's pathname; generating an array of references indexed by a hash code; and Includes the decoded addressing information for each hash code Generating a list of), to refer to the above list may include the step of setting the elements of the array. The location of each element is specified by a hash code.

(A10) In the above (A9), the step of searching for the addressing information is performed by calculating the hash code of the object on the path name of the object by using a specified hashing algorithm. Calculating and in the array of references indexed by the calculated hash code Determining the position of the generated list of structures; determining the position of the structure whose path name field matches the path name of the object in the list of structures; and determining the structure of the matched path name. Determining the position of the addressing information.

 (1) A third method according to the present invention provides a method for distributing a broadcast object. The method comprises the steps of encoding the object into an object carousel module, encoding the object's reference mechanism to resolve the object's location, encoding the module's versioning and dependency information. , Encoding the schedule information of the object canolases, and the object carousel, the reference mechanism of the objects, the versioning and dependency information of the modules, and the schedule information of the object canolases, and the schedule information of the object canolases into the transport stream for broadcasting. Multiplexing.

 (2) The step of encoding the reference mechanism of the object in the above (1) includes the steps of specifying the position of the structure including the addressing information of the object, and the addressing information of all the file objects of the force rouxel in the structure. Specifying the information.

 (3) In the step (2) of specifying the position of the object addressing information including the structure, the descriptor including the identification information of the module and the object in the module in which the structure is arranged is encoded. And loading the descriptor into the private data section of the download information display message delivered in the object force rouxel.

 (4) In the above (2), the step of specifying addressing information of all file objects is a step of encoding a file message including the above structure in the message body, and inserting the file message into the carousel. Steps may be included.

(5) The step of encoding a file message in the above (4) is a hashing algorithm used to encode the path name of each file object in the carousel obtained by reference from the service gateway. A step to specify the type of algorithm and a step to specify all the values that will be output by passing the path name through the hashing algorithm (each of these values will then be referred to as a hash code), along with each hash code The path name may specify address information about the file object resulting in the hash code.

 (6) The step of specifying the addressing information of the file object in the above (5) includes the step of specifying the identification information of the module in which the file object is located, and the step of specifying the file object among all the objects included in the module. May be specified, and the path name of the file object may be specified.

 (7) The module versioning and the step of encoding the dependency information in the above (1) include a step of specifying a valid version range of each module, a step of mapping each module to dependency information, and a step of mapping the dependency module. Specifying dependency information to form a cluster.

 (8) The step of encoding the schedule information of the object carousel in the above (1) may include a step of designating schedule information of each module and a step of designating a carousel time reference.

 (9) A fourth method according to the present invention provides a method of quickly referring to a broadcast object in an object cell. The method includes the steps of detecting the position of a structure including addressing information of all broadcast objects in an object power rule, and processing the information included in the structure into a format that can be easily accessed in a subsequent search. And searching for addressing information of the broadcast object in the object carousel.

 (10) The step of detecting the position of the structure in the above (9) is a step of retrieving a descriptor in a private data section of a download information display message received from an object cell. (Including addressing information of the object including the structure), and loading the object whose position of the object cell is included in the descriptor.

(11) The step of processing the information included in the structure in the above (9) is as follows. Decoding the information contained in the information, and generating a collection object including the decoded information.

 (12) The steps of (9) and (11) for decoding the information included in the above structure include a step of decoding the hashing algorithm specified by the above structure, a hash code, and a broadcast object. Decoding the set with associated addressing information. The addressing information may include identification information of a module in which the broadcast object is arranged, identification information of the object in which the broadcast object is arranged, and a path name of the broadcast object in the module.

 (13) In the above (11), the step of generating a collection object includes a step of generating a reference array having the same size as a set of hash codes, and a step of generating a hash code in which each structure is decoded. A step of generating a list of structures including addressing information decoded by the method of (12), and a step of setting the elements of the array to refer to the list. The location of the element may be specified by a hash code.

 (14) In the step (9) of searching for addressing information, the hash code of the broadcast object is calculated into the path name of the broadcast object using the hashing algorithm determined by the method (12). Calculating the position of the list of structures generated by the method of (13) in the array of references indexed by the calculated hash code; and calculating the position of the structure. The method may include a step of obtaining a position of a structure whose path name field matches the path name of the broadcast object in the list, and a step of obtaining a position of addressing information in the structure of the matched path name.

(15) A fifth method according to the present invention provides a version verification method of a broadcast object cached from a transport stream. The method determines the minimum version of each object module in the transport stream used to validate cached broadcast objects, and determines the application of the above cached broadcast objects from the scope of the validation version. And the individual modules containing the cached objects. Determining the location of the dependency information of the yule; performing versioning of the dependency module from the dependency information; and verifying the cached object from the dependency information.

 (16) A sixth method according to the present invention provides a method of monitoring and downloading broadcast objects in an object carousel. The method includes the steps of allocating filter resources according to the module schedule information, downloading the broadcast object, caching the broadcast object of the above module at the time of search, and being notified that the version of any module has been updated. Sometimes, determining the validity of the cached module and, upon notification, storing the valid old broadcast object.

 (17) A seventh method according to the present invention provides a method of monitoring a life cycle of an application downloaded at the time of version notification. Keeping a record of the broadcast objects being cached and used by the application; determining the application of cached broadcast objects from a valid version range; and broadcasting affected by the version notification Locating the dependency information of the module of the object, determining from the dependency information a cache state for the successful caching of the module associated with the downloaded application, and a cache upon version notification. Determining the life cycle of the downloaded application from the application and the cache state of the downloaded object.

(18) The eighth method according to the present invention provides a method of dynamically caching an object / one-note object by using time control information in a receiving device. The method includes the steps of encoding date and time information used to form the module time schedule for the download process; and, during the module download process, the date and time of the object canolace object object. A module for encoding the date and time information of the reference to be used as a reference, and defining a notification mechanism for notifying the client-implementation of the presence of a dynamic caching mechanism, and a module. Module date and time Decoding the carousel date and time reference method used to match the time to determine the module download schedule, the original UTC time, and the reference UTC time. And determining an accurate module download time.

 (19) In the above (18), the method may further include a step of searching for the carousel date and time reference method for the object carousel module for the purpose of downloading.

 (20) In (18) above, the date and time information of the module may be used for down-load scheduling purposes to facilitate dynamic caching of the object-cell module.

 (21) In (18) above, the step of encoding the date and time of the module may further comprise the step of setting a reference type state to determine a carousel time reference type method for download. Good.

 (22) In (18) above, the step of encoding the date and time of the module may include determining the use type status for determining whether the date and time of the specified module are valid to be retained. May further be included.

 (23) In the above (18), at the time of dynamic caching, a step of using a flag indicating the presence or absence of a module in the transport stream may be further included.

 (24) In the above (19), (21), a step of using a flag in the descriptor, which indicates the type of the carousel time reference mechanism, may be further included.

 (25) In the above (19), the method may include a step of using either a table or a descriptor indicating the different carousel time reference mechanism.

 (26) In (19) above, the carousel reference time retrieved from the table or the descriptor may be used as a reference for the time of the active download of an object in the MPEG transport stream.

(27) To determine the type of carousel time base in (21) above Further comprising the step of storing the reference type status information used for:

(28) In the above (24), the flag may include a step used to determine whether or not the module time information is valid for use.

 (29) In the above (22), (27), a step of using information stored as scheduling information for downloading the object carousel object may be further included.

 (30) In each of the above methods, the method may further include a step of determining an implementation-specific value for closing the set-top box resource during a module download waiting process.

 (31) In each of the above methods, the method may further include, based on the module schedule information, proposing a method of allocating download resources before an actual module download time.

 (32) In each of the above methods, the method may further include the step of encoding the carousel reference time as private section data using the descriptor.

 (33) In each of the above methods, the allocation of the resources of the set-top box Z The release of the allocation may be performed optimally by the module / reference and the reference date and time information when downloading the object car cell object. Good.

 (34) In each of the above methods, a step of indicating or notifying dynamic caching may be further included according to the presence of the descriptor.

 (35) In each of the above methods, a step of storing the specified module date and time information used to determine the actual module download time may be further included.

 (36) In each of the above methods, the method may further include the step of storing force roosel date and time information used to determine the actual module download time.

 (37) In each of the above methods, the method may further include a step of broadcasting all of the encoded date and time information as a television signal.

(38) The ninth method according to the present invention relates to a broadcast method in an object carousel. Provide a way to quickly reference objects. The method includes the steps of creating addressing information for the child object of the service gateway, creating addressing information for the child object of the directory object, and converting the addressing information into a format that can be easily accessed in a later search. Processing, and retrieving addressing information of a broadcast object in the object carousel.

 (39) The step of creating the addressing information of the object in the above (38) is as follows.

 Setting the identification information of the module in which the child object is located; setting the identification information of the object in which the child object is located among all the objects included in the module; and The method may include a step of setting a path name.

 (40) The step of processing the addressing information in the above (39) is a step of encoding a path name from the service gateway by a hash algorithm, and a size of the same size as a set of a hash code value. Generating a list of structures containing addressing information of the same object with the same hash code; and setting the elements of the array to refer to the list. ,. The position of each element may be specified by a hash code.

 (41) The step of searching for the addressing information in the above (38) is a step in which a hash code is calculated by performing an operation on the path name of the broadcast object, and an index obtained by the calculated hash code. Determining the position of the list of structures in the reference array; determining the position of the structure whose path name field matches the path name of the broadcast object in the list of structures; and determining the position of the matched path name. A step for determining the position of the addressing information in the structure.

(Action)

Resolve the position of the desired object within the object cell In order to quickly refer to the object, the addressing object is located in the private data section of the IW information display (Downloadlnfolndication) message. Need to be embedded. This descriptor contains a reference to the addressing object. The addressing object contains addressing information for all other file objects and directory objects in the object cell. By using the information in the addressing object, the receiving device can directly find the position of the module with respect to the specified fill object or directory object. Without having to load and resolve intermediate file and directory objects, the data module that stores the requested object can be determined and loaded.

 The module cluster and dependency information are embedded in the transport stream, allowing the receiving device to perform the appropriate versioning of the cached module. The receiving device must be able to determine the validity of the cached module in order to perform versioning and archiving while being notified of a version update. The validity of the cached module may not be guaranteed if there is a version change in any of the modules grouped under the same dependency and not all of the modules have been cached. Absent. In such cases, the receiver must discard the cached module.

The scheduling information implements a receiver that uses resources efficiently while waiting for the specified module to arrive. From the time information, the receiving device can specify when to start the caching process and allocate resources to select the required data modules. The scheduled time is referenced against the carousel time in the carousel time descriptor placed in the download information display message. As a result, the receiver can anticipate the arrival of the module and efficiently allocate resources. (Advantageous effect over conventional technology)

 Data broadcasting over object carousels is a significant extension of MPEG-2 based DTV systems, and the effect of delivering broadcast content over such carousels is to use carousel objects with data modules and blocks, and Influenced by the organization of the carousel object scheduling. These parameters are important at the receiving device for the determination of the download time and for the caching implementation. The present invention provides additional parameters for data caching, versioning, scheduling of the distribution server and the receiving device, and extension of the implementation for efficient use of resources for receiving broadcast objects. Brief Description of Drawings

 FIG. 1 is a block diagram showing a configuration of a digital broadcasting system according to the present invention. FIG. 2 is a module configuration diagram of the DSM-CC encoder of the transmission device.

 FIG. 3 is a diagram illustrating an example of the MPEG2 transport stream.

 FIG. 4 is a diagram illustrating an example of a broadcast object.

 FIG. 5 is a diagram for describing management information distributed by the carousel for managing object positions.

 FIG. 6 is a diagram showing a processing flow of addressing object information.

 FIG. 7 is a diagram showing a processing flow of a file or directory object. FIG. 8 is a diagram illustrating a process of determining the position of the designated module time information. FIG. 9 is a diagram illustrating a process of downloading a module based on time information. FIG. 10 is a diagram depicting a processing flow of a service domain addition processing;

 FIG. 11 is a diagram showing processing for determining and loading a file or directory object. BEST MODE FOR CARRYING OUT THE INVENTION

A broadcast object distribution system according to the present invention will be described with reference to the accompanying drawings. First embodiment

 FIG. 1 is a block diagram showing a configuration of a digital broadcasting system according to the present invention. The digital broadcasting system includes a transmitting device 700, a transmitting device 710, and a receiving device 720. Although only one receiving device is provided, the number may be any number.

 The transmitting device 700 transmits a broadcast signal such as video, audio, program information, and data to a plurality of receiving devices. The data storage unit 701 stores data such as application programs, text data, and image data as files in a hierarchical directory. The DSM-CC encoder 702 receives the data from the data storage unit 701, encodes the data into a DSM-CC U-U object carousel, and outputs it to the multiplexing unit 703. The multiplexing unit 703 multiplexes the encoded DSM-CCU_U object carousel together with other information such as video / audio / program blueprint into an MPEG2 transport stream. Details of the MPEG2 transport stream are described in the MPEG standard ISO / IEC 13818-1, and a detailed description is omitted here. The multiplexed MPEG2 transport stream is QPSK-modulated by modulation section 704, converted to a predetermined frequency band by up-converter 705, and transmitted as a broadcast signal.

 The transmission device 710 is a digital satellite broadcasting system (one example), and includes a transmitting antenna 711, a broadcasting satellite 712, and a receiving antenna 713. The transmitting device 710 distributes a broadcast signal from the transmitting device 700 to the receiving device 720 via the broadcasting satellite 712.

The receiving device 720 receives the broadcast signal, reproduces video and audio, displays program information, and acquires data stored in the object cell. The input unit 729 has a plurality of keys such as a number from 0 to 9, an arrow, “0K:”, and “cancel”. When the user presses a key, the key code is sent to the CPU 725. The CPU 725 controls the operations of the tuner 721, the demodulation unit 722, the transport decoder 723, the AV decoder 724, the RAM 726, the ROM 727, and the AV output unit 728 by executing a program stored in the ROM 727. Tuner 7 21 performs tuning according to the tuning information including the frequency specified by the CPU 725, and sends a signal of the selected frequency to the demodulation unit 722. The demodulation unit 722 performs QPSK demodulation on the signal transmitted from the transmitting device 700 after being QPSK modulated, and sends the demodulated MPEG2 transport stream to the transport decoder 723. Transport decoder 723, based on filtering information for Baketsuto ID specified by CPU 725, filters the movies image 'audio stream of the PES packet format, and sends the result to the AV decoder 72 ^4. The AV decoder 724 decodes the video / audio stream and outputs it to the AV output unit 728 including the display speed. Also, the transport data 723 converts section-format data in which a program information object cell is stored based on filtering information including a packet ID and a table ID specified by the CPU 725. Get and transfer to RAM726. The details of the process for acquiring the object force lucel will be described later.

 In this embodiment, the modulation scheme is QPSK modulation, but other modulation schemes for digital TV broadcasting such as QPSK modulation and OFDM modulation may be used. Further, although a digital satellite broadcasting system is used as transmission device 710, a digital terrestrial broadcasting system divided by a digital cable television system may be used.

 FIG. 2 is a diagram illustrating an example of a module configuration of the DSM-CC encoder 702 of the transmitting device 700. The DSM—CC encoder 702 is composed of an object cannula cell encoding unit 801, an object reference mechanism encoding unit 802, a version and dependence information encoding unit 803, and a schedule information encoding unit 804. Details of each module will be described later.

FIG. 3 is a diagram showing an example of the MPEG-2 transport stream multiplexed by the multiplexing unit 703 of the transmitting apparatus 700. In the MPEG2 transport stream 901, video and audio streams 903 and 904 in PES format, program information 905 in section format, and DSM—CC U—U object canolay encoded by the DSM—CC encoder 702 Senor 902 is multiplexed. Figure 4 is an example of a broadcast object distributed by an object car cell. In the directory "/" (1001) associated with the service gateway, A directory object "dirl" (1002) and a file object "file2" (1003) are located. Further, in the directory "dirl" (1002), two file objects "filell" (1004) and "filel2" (1005) are located. The complete pathname of the file object "filell" is represented as "/ dirl / filell" by reference from the service gateway.

 FIG. 5 is a diagram illustrating management information distributed within the carousel for managing object positions. The transmitting device 700 stores management information for managing the position of an object in a carousel in the form of an addressing object information structure described later, and distributes the information together with the object. The receiving device 720 can quickly and easily specify the object position by extracting the management information from the received carousel, caching it in the form of an addressing object map described later, and referring to it. In FIG. 5, the management information (management table) 200 includes a plurality of entries 201, 202,..., Each entry 201, 202 ′ is associated with a hash code value. Also, it is associated with the addressing information 211, 213, 215, ... indicating the position of the object. A hash code value specifying an entry is calculated from the path name of the object according to a predetermined hash algorithm. For example, in FIG. 5, entry 201 stores the addressing information of the file object rfilellj 104 shown in FIG. That is, the hash code value corresponding to the entry 201 is a value calculated from the path name “/ dirl / filell” of the file object rfilellj 104, and the addressing information 211 associated with the entry 201 1 indicates the position of the file object r-filellj 104. If there are multiple objects with the same hash code, multiple pieces of addressing information (for example, 2 13 and 2 15 in Fig. 5) are associated with the same entry. Multiple pieces of addressing information associated with the same entry are managed as a collision list 220.

A first aspect of the invention relates to an object reference mechanism that provides a quicker means for resolving the position of a desired object within an object carousel. This is implemented as a data structure containing the required module ID and object key used to uniquely locate the object in the carousel. It is. It adds the following items:

 Addressing—object one location des criptor:

 Download information display (Downloadlnfolndication) Included in the private data section of the message. This descriptor must contain a reference to the object that contains addressing information for all files in the object carousel.

 Addressing object:

 Addressing object Referenced by the object location descriptor, which contains addressing information for all objects in the object canolay cell.

 The addressing object location descriptor contains a reference to the object containing addressing information for all objects in the object cell. Table 1 shows the syntax of the addressing object location descriptor. The meaning of the descriptor is as follows.

 descriptor— "tag (descriptor tag): This 8-bit field provides an identification value indicating the addressing object location descriptor.

 descriptor—length (descriptor length): This field specifies the byte length of the subsequent descriptor data.

 moduleld (Module ID): This field / red specifies the module ID of the object.

 objectKey — length (object key length): This field specifies the size of the following object key data.

 objectKey — data (object key data): This field stores the object key of the object. The size is specified by the 1-byte object length field described above.

The addressing object referenced by the addressing object location descriptor must contain addressing information for all objects in the object carousel. This object is a file object, and with such an implementation the object would be a DSM—CC control message You are free from any size restrictions imposed by locks. The addressing object is transmitted to the receiving device by a download data block (DownloadDataBlock) message. The contents of this file must be stored in the BIOP :: message body data file message _(m es sageBody- data) within. Table 2 shows the addressing object information structure. The semantic definition of this object is as follows.

 -file_content_size (file content size): This 32 bit field specifies the byte size of the remaining files.

 — Addressing— object-location-tag: This field specifies the tag that identifies this file as containing an addressing object information structure.

 One hash—algorithm: This fino redo specifies the hash algorithm used to hash the path name of an object within an object cell. Hashing is a technique used to reduce the time required to locate the addressing information for an object given in this structure. The specified hash algorithm may be a Fowler / Noll / Vo (Fowler / Noll / Vo) algorithm FNV-1.

 (1) hash—table—size (hash tape size): This field specifies the hash table size.

 -hash_code_count (Hash code count): This field specifies the hash entry in the subsequent loop.

 1 hash—code (hash code): This field specifies the Nosh code.

 One collision—count: The number of collisions of the hash code value.

 1 carouselld (carousel ID): This field specifies the carousel ID of the object for this entry.

One moduleld (Module ID): This field specifies the module ID of the object for this entry. One objectKey—length (object key length): This field specifies the size of the following object key data.

 —ObjectKey—data: These fields form the object key of the object for this entry. Its size is preceded by a one-byte object key length field.

 ~ path arae_length (path name length): This field specifies the size of the path name data field.

 -pathNarae_data (path name data): These fields form the file path of the file object.

 Each hash entry in the nosh code count loop has a hash code value

It contains (hash—code key) and addressing information for a list of objects with the path name associated with the hash code. The addressing information provided is the carousel ID, module ID and object key (0 bjectKey_data) for each object. The object's path name (pathName—data) is also included to identify itself from other objects in the same list when the collision occurs. Path names are fully specified with respect to the service gateway. For example, 7some-file, txt is a file whose file name including its extension is {some-file.txt} and which is located in the directory 7 for the service gateway. The resulting hash code needs to be determined. The hash code for a string must always give the same value, no matter how many times the hashing is performed. The structure can be extended to use other hashing algorithms such as MD2 and DES.

The object carousel cell encoding unit 801 in the DSM-CC encoder 702 of the transmitting device 700 encodes the data received from the data storage unit 701 into a DSM-CCU-U object carousel. The details of the format of the object force roulette are defined in ISO 138 138-6, and the details are omitted in the present embodiment. In the example of FIG. 3, the object power ^ / is set to the directory "/ ,, (931) related to the service gateway, the directory object" dirl "(932), and the file" file2 ". "(933) and Stored somewhere in "filell" (934). Directory "/" (931), directory object "dirl" (932), file object "file 2" (933) and "filell" (934) are stored in module "modulel" (921). Similarly, the file object "filel2" (935) is stored in the module "module2 ,, (922). Each of the modules 921, 922 contains a download data block (DDB) message 913-916, 91 7-918. Each is divided into. Download information display (DII) message 912 stores information of each module, and download download shadow (DSI) message 911 stores an IOR to the service gateway. These messages are multiplexed in the MPEG2 transport stream in section format and transmitted.

 The object reference mechanism encoding unit 802 extracts the addressing information of all the objects in the object force rucel encoded by the object cannula senor encoding unit 801 and generates the above-mentioned addressing object information structure, Store it in the file object "AO I" (936) and insert it in the object cell. Further, an addressing object position descriptor indicating the reference of this file object is inserted into a private section in the download information display message 912.

 In this embodiment, the file object "AO I" (936) storing the addressing object information structure is inserted by extending the module "module2". However, another module is added and stored there. You may do it.

 Next, decoding processing on the receiving device 720 side when the management information indicating the object position as described above is transmitted by a carousel will be described.

FIG. 6 shows a flow of decoding processing of information included in an addressing object. The processing flow starts during processing of the DII message by the receiving device. The receiver checks whether the addressing object location descriptor exists in the private data section of the DII message. This sub-process is denoted by the symbol “100”. The receiving device checks the descriptor tag (descript or_tag) field of the descriptor to determine the addressing object location. Verify the existence of the predicate.

 Upon confirming the existence of the addressing object location descriptor, the receiver initiates the loading of the file object "AOI" (933) at the location specified by the module ID and object key fields of the descriptor. This sub-process is denoted by reference numeral “1 0 1”.

 Once the file object has been loaded, it performs the processing of the file object's content. The sub-process denoted by “1 0 2” represents a finite period before the file object is loaded.

 Before processing the contents of the file object, the receiving device generates a fixed-size array of address pointer values called an addressing-object-map. The addressing object map has a means for associating each hash code value with the module ID of the file Z directory object and a list of object key information. It is kept in the receiver's memory until the current service domain is detached. Table 3 shows the structure of the addressing object map and its internal representation. The addressing object map contains 496 address pointers (for a 12 bit hash code). The number of address pointers depends on the size of the set of hash code values. Typically, the memory capacity of this array increases by a power of two as the bit length of the hash code increases. In the example in this specification, a 1'2-bit hash code is specified. However, this can be increased or decreased depending on the implementation restrictions, ie, the fixed memory size.

 Each address pointer or pointer to the collision list structure (as described in Table 3) is to store a reference to the collision list structure. When the addressing object map is created, each of the address pointers must be set to null.

 After that, the receiving device shall start processing the addressing object position structure stored in the loaded file object "AOI" (9336). This sub-process is denoted by the symbol "103 j."

If the hash code values are the same, a collision list structure is generated. If the collision count is less than one, the generation is discarded. Otherwise, an array of ending addressing information structures is generated, and the pointers to the addressing information structure pointers in the collision list structure are each set to reference the corresponding member of the addressing information structure. The module ID, object key and path name fields of each addressing information structure are set by the corresponding module ID, object key and path name field information in the addressing object information structure. The sub-processes described in this paragraph are denoted by the symbols "104" and "105".

 Advance to the next hash code value and, if there is one, repeat the entire process. Until all the hash code values in the addressing object information are exhausted, the sub-processes represented by the codes “1 0 4” and “1 0 5” are repeated. Then, the process ends. At this point, the receiving device also has the further option of using a complete dressing object map to resolve and load the file Z directory on the connected service domain.

 FIG. 7 shows a process for loading and resolving a file or directory object using the addressing object information. Whenever the receiving device needs to load and resolve the location of the file directory object in the service domain, use the pre-generated early addressing object map object, as indicated by code “106”. You can choose to do so.

 The receiving device may choose to use other means for performing processing outside the scope of this specification. This sub-process is denoted by reference numeral “107”.

 If the receiving device decides to use this choice, it uses the same algorithm used to generate the hash code value in the dressing object information structure, ie, using the FNV-1 hash algorithm. The hash code of the complete pathname of the file / directory must be calculated. This sub-process is denoted by the code “1 08”.

In addition, the receiving device must refer to the addressing object map at the location indexed by the calculated hash code value. if, If pointer is null, the file Z directory cannot be found in the addressing information structure. The receiving device may choose to use other means for resolving and loading the file Z directory. Otherwise, the pointer references the collision list structure. This sub-process is represented by the code "1 0 9".

 Using the collision list structure, the receiving device can find the array of the addressing information structure. One of the addressing information structures may be what you want. First, consider the first structure in the array, as indicated by the sign "1 1 0". Compare the complete path name of the file Z directory with the string indicated by the pointer (to pointer_to_full_path_string) field for the entire path string in the addressing information structure, as indicated by the code "1 1 1". If the strings do not match, it attempts to locate the next addressing information structure in the array, as indicated by the symbol "1 1 2". When the position of the next addressing information structure is determined (as indicated by reference numeral “1 13”), the sub-process indicated by reference numeral “1 1 1” is repeated. If the subprocess indicated by the code "1 1 2" is "false", it means that the file / directory is not found in the addressing information structure. The receiving device may choose to use other means to resolve / load the file Z directory.

 However, if the subprocess denoted by the symbol "1 1 2" is "true", the receiver has a module ID and an object key field that can be used to locate the file / directory. You have discovered the addressing information structure. With this information, the client can proceed with the resolution Z load of the requested file directory. This sub-process is denoted by the symbol “1 1 4”. Second embodiment

The next aspect of the present invention provides a mechanism for specifying the data module dependency when the version change is notified to the receiving device. This is achieved by embedding dependency information (information indicating the degree of impact between modules due to a version change) in the force rule, so that the Module versioning can be performed as appropriate. It uses a description that includes the following descriptors:

 -Module dependent location, G predicate (modules—dependency—locator descriptor):

 Download information display (Downloadlnfolndication) Module information (Modulelnfo) structure in the message User information (userlnfo) In a loop. Indicates the validity of the module and determines the location of the module-dependent information descriptor affected by the module.

 One or more dependencies' | W report.self 50 (modules one dependency one info descript or):

 Download information display (Downloadlnfocation) Control message in the message Private data (privateData) This is in the rape.

 Table 4 shows the syntax of the module-dependent positioning descriptor. The meaning of the descriptor is as follows.

 1 descriptor—tag (descriptor tag): This 8-bit field gives an identification value indicating the module-dependent positioning descriptor.

 1 descriptor—length (descriptor length): Specify the byte length of the subsequent descriptor data.

 -rainVersion (minimum version): This line indicates the validity of past purges of this module. Must be used with the module version (moduleVersion).

 One dependency—info_size (dependency information size): This field specifies the number of module dependency information descriptors that can be used for this module.

 Dependency—info—id: This field identifies the relevant module dependency information descriptor in the “private data” loop.

 Table 5 shows the syntax of the module-dependent information descriptor. The meaning of the descriptor is as follows.

-descriptor_tag (descriptor tag): This 8-bit field gives an identification value indicating the module-dependent information descriptor. 1 descriptor—length (descriptor length): This field specifies the byte length of the subsequent descriptor data.

 (1) dependency_info_id (dependency information ID): This 8-bit field gives an identification value for determining the position of the module dependency cluster.

 One moduleld (module ID): This field specifies the module ID of the object.

 -depndency_value: This 5-bit value indicates the dependency of this module on all other modules belonging to this cluster. A value of “0” indicates no dependencies, and a value of “32” indicates strong dependencies on other modules. Based on the dependencies between the individual modules, the version in the transmitting device 700 and the dependency information code section 803 display the above-mentioned module-dependent positioning descriptor and module-dependent information descriptor in the form of download information (DII ) Insert in message 9 1 2.

The module-dependent positioning descriptor and the module-dependent information descriptor are present in the download information display message in the transition of any version change. The receiving device's application manager should use the value of minVersion and the information in the module-dependent information descriptor to determine the validity or applicability of the cached module. Upon receipt of the version notification and the module-dependent locator, any cached modules whose version is outside the range between moduleVersion and minVersion shall be invalidated. To explain the use of minVersion, when the module that stores the broadcast object containing textual information is updated, the moduleVersion of this stream is incremented by 1 and the minVersion remains unchanged. The broadcast object is used by the application on the receiving device 又 は or downloaded to generate a textual display. A cached module has a version value equal to minValue and less than moduleVersion, which means that it is still usable while a search for a new version is still in progress. The application will continue to display old text data until a new version is received. On the other hand, if this module is If it contains broadcast objects such as control information or program data that can cause unpredictable application behavior when used, the cached module is disabled and the minVersion is incremented. Need to be

 The receiving device may perform versioning archiving as appropriate by further checking the dependent cached module from the corresponding module dependent information descriptor. If all dependent modules are cached, an archive of such modules that make up a fully executable or useful unit may be performed. In addition, such information is important to the application manager in determining the validity of the current application that may be used and interpreted from these modules. When notified of a version, the application manager, which controls the life cycle of the downloaded application, checks for any changed version in these modules that are currently loaded and used. There must be. If any of these modules are affected, the associated module-dependent information descriptor is read to see if the modules reflected in this dependent cluster have been cached. If all modules are already cached, the application will continue to work with the old version from cache memory. Otherwise, the application manager may terminate this application because its operation is unpredictable. Third embodiment

 The next aspect of the present invention is to process the connection between the broadcast object and the time information in the object cell, and to optimize the cache operation of the receiving device. The present invention seeks a method for multiplexing time schedule information. It uses a description that includes the following descriptors:

 ー Module 8 temple, G predicate (module—time—descriptor):

It is included in the user information ("userlnfo") loop of the module information ("Modulelnfo") structure in the download information display (Downloadlnfolndication) message. Indicates the specified arrival time of the module.

Ichiriki Nore ¹ ~~ · ΐτ ノ レ Pukima ii predicate

 The cull cell time is stored so that the receiver implementation can use the time information as a reference to properly schedule the download sequence. Download information display (Downloadlnfolndication) Stored in the private data loop of the message.

 The module time descriptor (module-time-descriptor) and the force / racenole time descriptor (carousel_time-descriptor) are shown in Tapes 6 and 7, respectively. The meaning of the descriptor is as follows.

 1 descriptor—tag (descriptor tag): This 8-bit field gives an identification value indicating a module time descriptor or a carousel time descriptor.

 -descriptor_length (descriptor length): Specifies the byte length of the subsequent descriptor data.

 -use: This field is specified as follows:

 0—Module available

 1 Use the start time in this descriptor

 2, 3—Reservation

 One time—reference: This field is specified as follows.

 0—Use of the carousel_time—descriptor

 1 Use of system time (eg, TDT is used for DVB systems)

 2, 3—Reservation

 -start_time (start time): time the module arrives in the stream (UTC time)

 One current— time: the current carousel time

The schedule information encoder section 804 of the transmitting device 700 inserts the module time descriptor and the carousel time descriptor described above into the download information display (DII) message 912 based on the carousel transmission schedule. I do. Figure 8 shows the positioning process for the specified module time information. The format of the notification mechanism is required to notify the receiver implementation that the current transport stream contains information that allows dynamic caching of the carousel object. This allows the receiver implementation to not have to wait indefinitely for a particular module when the carousel itself becomes too large and unmanageable. Perform a dynamic caching mechanism (301) Download information display A message version change must be made to indicate this transition period.

Upon receiving the notification, the implementation of the receiving device may perform a process of acquiring time information of all modules. The module time descriptor gives the exact date and time the module exists in the transport. The module time descriptor may or may not be present for each module in the download information display message. If there is no module time descriptor, it indicates that the module is currently on the stream. Therefore, this module can be downloaded (304). Similarly, the presence of a module on the transport stream is, in a similar sense, represented by a value of “0” in the “use” field of the module time descriptor (if any) (302 ). Otherwise, the implementation of the receiving device can use or store this information (303), determine when to start downloading for the requested module, and Only then can you attempt to incorporate the module's content into the cache. Carousel time reference method information on how to obtain carousel time (ie, carousel time is obtained either by carousel time descriptor or TDT) should also be stored by the client implementation. This is so that the client can easily and accurately determine which force rouse time reference mechanism method the sender has used. Until all the modules indicated in the download information display message (or only the modules necessary for executing the application) are downloaded, the next module in the download information display message is obtained ( The above processing is repeated (306).

 Monitoring of carousel time is mandatory when this active caching mechanism is used. Implementation of the receiver would be sufficient to monitor only normal download information display messages to retrieve carousel time information. This is in order to easily realize DSM-CC as a stand-alone module. According to the present invention, no other monitoring overhead is imposed on the receiving device side. This is because the download information is displayed in the implementation based on the MH P 1.0.2 specification (ETSITS 108.12 V 1.2.2.1 or later) or the specification extended based on it. Is always monitored. To obtain the current carousel time, a carousel time descriptor is present in the private data loop of the download information display message. This force roosel time descriptor contains the same UTC time format as the module time descriptor. Alternatively, other ways of obtaining time information (other than the carousel time descriptor) can be obtained from the Time and Date Table (TDT). Since the contents of the carousel time descriptor are expected to change continuously to reflect the current time, the version number of the download information display remains the same (unless the contents of the other fields change). ). On the other hand, if the download information display version is changed, it may indicate that the time specified in the module time descriptor is also changed.

Figure 9 shows the module download process using time information. The receiver implementation checks all module time descriptors and determines the earliest of the modules needed by the receiver (402). Using the time information given by the carousel time descriptor, the start time (of the module time descriptor) that matches the current time given in the carousel time descriptor, (for any module with a module time descriptor, 4 0 6)) It is sufficient to start the download process (4 0 3). The receiver implementation predicts that the module of interest is present (from the time information given in the module time descriptor), and removes individual resources, such as filters, from the arrival of the module of interest. Should be set somewhat earlier than expected actual time Is also practical. This is to cover the time latency due to the processing time required for setting. Determining when to start and stop the processing and resources involved while waiting for a module based on the time information it has is an implementation specification of the receiver (404). If the receiver implementation does not expect the earliest module to arrive (set by its own threshold), choose to release the associated resources used by this download process. Can be (405). The process of obtaining the required modules by implementation of the receiver is repeated until all the required modules have been successfully downloaded from the transport stream (401). Fourth embodiment

 The next aspect of the invention relates to a generating and referencing mechanism on the receiving device side of an addressing object map that provides a quick means of determining the position of a desired object within an object cell.

(Service domain B)

 Figure 1.0 shows an example of the service domain addition processing port. The service domain addition processing by the receiving device 720 starts. The receiving device 720 acquires the IOR carried by the download server initiate (DSI) message, makes a reference to the service gateway, and adds the service domain. This sub-process is denoted by reference numeral “501”.

It checks whether the service gateway message has been successfully completed within a finite time and the service domain has been successfully added. If addition of the service domain fails, the process ends. This sub-process is indicated by reference numeral “502”. If the service domain is successfully applied U, a fixed-size array of address pointer values called an addressing object map (addressing_object_map) is generated. This addressing object map stores each hash code value in the module ID of the file / directory object and the information of the object key information. It has means for associating with the strike. It is kept in the memory of the receiving device 720 until the current service domain is detached.

 Table 3 shows the structure of the addressing object map and its internal representation. The addressing object map contains 496 address pointers (for a 12-bit hash code). The number of address pointers depends on the size of the hash code value set; typically, the memory requirements of this array increase by a power of two for each additional bit length of the hash code. In the example used in this specification, a 12-bit hash code is specified. However, this can be increased or decreased depending on implementation restrictions, ie, fixed memory size.

 Each address pointer or pointer to a collision list structure (pointer-to-collision-list-structure) is to store a reference to the collision list structure. When the addressing object map is created, each of the address pointers must be initialized to null. This sub-process is designated by reference numeral “503”.

 Next, it is checked whether the child object such as a file object or a directory object exists immediately below the service gateway. This subprocess is indicated by reference numeral “504 J”.

 If the child object exists, calculate the hash code value of the complete path name of the child object. Hashing is a technique used to reduce the time required to identify the location of addressing information, and the hash algorithm may be a Fowler / Noll / Vo algorithm.

In the example of Fig. 4, a directory object "dirl" and a file object "file2" exist immediately below the service gateway. First, for the directory object "dirl", the hash code value of the path name "/ dirl" is calculated. If the address pointer of the corresponding entry in the addressing object map indexed by the hash code value is null, a collision list structure (collisionJList) is generated, and a pointer is made to refer to the generated collision list structure. (Pointer_to_col 1 ision_list_structure) is set. Obtains the IOR of the child object stored in the service gateway and creates the newly generated addressing information In the structure (addressing-info), set the module ID, object key, and path name field of the child object, and refer to the addressing information structure pointer (pointer_to_addressing-info-structure) in the collision list structure. Set to. At this point, the size (addressing-info-array-size) of the addressing information array in the collision list structure is set to 1.

 If a pointer that refers to the collision list structure is already set in the address pointer of the corresponding entry of the addressing object map indexed by the nosh code value, the newly generated addressing information structure is used. Set the child object's module ID, object key, and path name fields and add it to the addressing information array in the collision list structure, increasing the size of the array by one. The sub-process for registering the addressing information structure described in this paragraph is denoted by reference numerals "504j," 505J.

 If another child object exists directly under the service gateway, it is indicated by reference numerals “504” and “505” until the addressing information structure for all child objects is registered in the addressing object map. The sub-process is repeated. In the example of Fig. 4, next, the hash code value of the complete path name 7file2 of the file object "file2" is calculated, registered in the corresponding entry of the addressing object map indexed by the hash code value, and then processed. To end.

(Resolve / load file / directory objects)

 FIG. 11 shows an example of processing for resolving a file or directory object in the receiving device 720 and loading it.

 In the broadcast object shown in FIG. 4, the flow of processing will be described by taking as an example a case where a file object "filell" is first loaded. At the end of the service domain addition processing, the collision list and addressing information structure corresponding to each hash code value of the directory object "dirl" and the file object "file2" have been registered in the addressing object map. .

The receiving device 720 must enter the full path name "Mir Calculate the hash code value of 1 / filell ". This sub-process is denoted by the code" 601 ".

 Next, an addressing information structure whose complete path name matches the position of the collision list structure referred to by the pointer of the addressing object map indexed by the calculated hash code value is obtained. This sub-process is denoted by reference numeral "602".

 Check whether the corresponding addressing information structure exists or not. This sub-process is indicated by reference numeral “603”.

 If a matching addressing information structure does not exist, the hash code of the path name of the parent directory is calculated, and codes “6 0 4”, “6 0 2”, “6 0” are used until a matching addressing information structure is found. Repeat the subprocess of 3) to search the parent directory of the intermediate directory sequentially.

 If a matching addressing information structure exists, it is loaded using the module ID and object. This sub-process is indicated by reference numeral “605”.

 When the file object "filell" is loaded for the first time, since the addressing information structure corresponding to the path name 7dirl / filell is not registered and does not exist in the addressing object map, the hash of the parent directory path name "/ dirl" is not registered. The addressing information structure that matches the path name "/ dirl" of the directory object "dirl" has already been registered when the service domain addition processing is completed, so the parent directory search processing is performed. Terminates and loads the directory object "dirl" using the module ID and object key in the addressing information without having to resolve it again.

 Next, it checks whether the object loaded for the first time is a directory object. This sub-process is denoted by reference numeral “606”.

If the loaded object is a directory object, check whether there are any child objects such as file / directory objects or directory objects directly under the directory object. This sub-process is indicated by reference numeral “607”. If a child object exists, calculate the hash code value of the complete path name of the child object, obtain the IOR of the child object stored in the directory object, and create a newly generated addressing information structure. (addressing-info) is set to the module ID, object key, and path name field of the child object, and registered in the addressing object map. This sub-process is indicated by reference numeral “608”.

 If another child object exists immediately below the directory object, the codes “607” and “608” will be used until the addressing information structure for all child objects is registered in the addressing object map. The indicated sub-process is repeated.

 When the directory object "dirl" is loaded for the first time, the addressing information structure of each of the immediate child object file objects "filell" and "filel2" has the complete path name "/ dirl / filel l", "/ It is registered in the corresponding entry of the addressing object map indexed by the hash value of "dir / filel2".

 When the registration of the addressing information structure for all child objects directly under the directory object is completed, it is checked whether or not the directory matches the complete path of the object to be loaded. This subprocess uses the code

It is indicated by “6 9”.

 If it does not match the complete pathname of the object to be loaded, expand the pathname being processed and calculate the hash code value. This sub-process is denoted by "6 1 0" and is repeated until all intermediate directories have been loaded. When the loading of all the intermediate directories is completed, the collision list and the addressing information structure corresponding to the hash code value of the path name of the object to be read are registered in the addressing object map.

At the completion of the loading of the intermediate directory "dirl", the path name being processed is "/ dirl", which does not match the complete path name of the file object "filel l" to be loaded, Vdirl / filel l. , Expand the path name, calculate the hash code value of "/ dirl / filel l", and return to subprocess "602". At this point, since the addressing information structure of the file object "filell" to be loaded has already been registered in the addressing object map, the file object "filell" is identified using the module ID and the object key in the addressing information structure. Load and exit. This series of sub-processes is indicated by reference numerals “602”, “603”, “605”, “606”, and “609”. Subsequently, in order to load the file objects "file2" and "filel2", since the intermediate directory and the addressing information structure of each object have already been registered in the addressing object map, the modules in the address information structure have to be registered. Load each file object using its ID and object key, without having to resolve it again. Table>

 The table used for each descriptor described above is shown below.

 In tape noting 1, the addressing object location descriptor (addressing—object_locationdescriptor) is incorrect.

 Tape tape 2 does not have an addressing-object-in-fo structure.

 Tapenaire 3 does not have an addressing-object-map-structure.

 The tape notch 4 is a module dependent positioning IS predicate iodules—dependency—locator descriptor).

 Tape information 5 indicates a module dependent 'I information descriptor (modules_dependency_info descriptor).

Tape No. 6 indicates a module time descriptor. Tape, note 7 indicates the carousel time descriptor. Table 1: addressing one. bject one location descriptor

Bunore 2: addressing— object— info structure

 Syntax Bits addressing— object—info {

 f i 丄 e—content—size 32 file—content () {

 addressing— object one location— tag 8 hash— algorithm 8 hash— table— size 16 ha sh— code— coun t 16 for (i = 0; i-hash— code— count i ++) {

 hash_code 16 collision one count 8 for (j = 0; j "<co 11 ison_count; j ++) {

 carouselld 16 moduleld 16 ob j ec tKey— 1 ength 8 for (k = 0; k objectKey— length; k ++

 )

 objectKey—data 8 pathName-1 length 8 for (k = 0; kku pathName-1 length; k ++) pathName—data 8

}

 }

 }

} Table 3: addressing—object—map structure

 Syntax Bits addressing— object— map {

 pointer to collision— list— structure 32

}-One collision— list {

 addres s ing— i nf o— array— s ize 8 for (i = 0; i addressing one info— array— size; i ++) {

 pointer to_addressing_info structure 32

}

 } addressing— info {

 moduleld 16 objectKey 32 pointer to full__path_string 32

} Table 4: Modules—dependency—locator descriptor

 Syntax Bits

Modules— dependency— locator— descriptor {

 descriptor— tag 8 descriptor— length 8 reserved 3 minVersion 5 dependency— i nf o— s ize 8 for (i = 0; iku dependency 1 info— size i ++)

 dependency one info— id 8

}

Punole 5: modules—dependency—info descriptor

<References>

[l] ISO / IEC 1 38 18-6 Information technology-Generic coding of video and related audio information-Part 6: DSM-Extension to CC (IS0 / IEC 13818-0 Information technology-Generic coding of moving pictures and a ssociated audio information (Part 6: Extensions for DSM-CC) ₀ Industrial applicability

 INDUSTRIAL APPLICABILITY The present invention can be used for data broadcasting and multimedia applications such as digital TV, digital audio broadcasting, and the Internet domain for distributing broadcasting objects through an object cell. Although the present invention has been described with respect to particular embodiments, many other variations, modifications, and other uses will become apparent to those skilled in the art. Therefore, the present invention is not limited to the specific disclosure herein, but only by the appended claims. This application is related to Japanese Patent Application No. 2003-271390 (filed on July 7, 2003), the contents of which are incorporated herein by reference.

Claims

The scope of the claims

1. A method of distributing a broadcast object by an object call cell, comprising the steps of encoding the object into a module of the object call cell;

 Encoding the object reference mechanism to resolve the location of the object;

 Multiplexing the object call cell and the object reference mechanism into a transport stream for broadcast.

2. The step of encoding the reference mechanism of the object includes the step of specifying the location of the structure including the addressing information of the object, and the step of specifying the addressing information of all the file objects in the object cell in the above structure. And

The method of claim 1, wherein:

3. The step of specifying the location of the structure containing the addressing information of the object,

 Encoding a descriptor containing the addressing information of the object storing the structure;

 Inserting the descriptor into the private data section of the download information display message delivered by the object canola receiver, and specifying the addressing information of all the file objects in the above structure. The steps involved are:

 Encoding a file message containing the above structure in the message body,

Inserting the file message into the object cell. 3. The method of claim 2, wherein:

4. The steps above to encode a file message are:

 Specifying a hashing algorithm used to encode the path name of each file object in the object carousel obtained by reference from the service gateway;

 Passing the respective path names to the above-mentioned nosing algorithm and specifying values to be output; thereafter, each of these values is referred to as a hash code,

 Specifying, with each hash code, address information for a file object whose path name results in the hash code.

4. The method according to claim 3, wherein:

5. The above step of specifying the addressing information of the file object is as follows.

 A step of specifying identification information of a module in which the file object is placed;

 Specifying the identification information of the object in which the fire / ray object is located among all the objects included in the module;

 Specifying the path name of said file object.

6. Receiving the broadcast object 1 encoded in the object carousel module and delivered by the broadcast transport stream in which the above-mentioned object car cell and the encoded object reference mechanism are multiplexed. A way to

 Obtaining and decoding the reference mechanism of the encoded object multiplexed in the broadcast transport stream;

The transport stream for broadcast using the reference mechanism described above. Resolving the position of the object in the encoded object cell multiplexed in the system.

7. The steps above to obtain and decode the reference mechanism are:

 Detecting the position of the structure containing the addressing information of all the finale objects of the object force Lucenore;

 The steps for resolving the position of the object above are

 Processing the information contained in the structure into a form accessible in a later search;

 Retrieving addressing information of an object in said one object cell.

8. The step of locating the structure containing the addressing information of the object,

 Searching for a descriptor in a private data section of the download information display message received from the object car cell;

 The descriptor includes addressing information of an object storing the structure; and loading the object storing the structure from the object cell based on the addressing information included in the descriptor. The method of claim 7, wherein:

9. The step of processing the information included in the structure,

 Decoding the hashing algorithm specified by the above structure; decoding the hash code and addressing information associated with each file object in the object cell;

The addressing information includes the identification information of the module in which the object in the module is located, the identification information of the object in which the object is located among all the objects included in the module, and the path name of the object. Including Generating an array of references indexed by a hash code;

 Generating a list of structures;

 Each structure includes the decoded addressing information for each decoded hash code;

 Setting the elements of the array to refer to the list, the position of each element being specified by a hash code,

The method according to claim 6, wherein:

10. The step of searching for addressing information is as follows.

 Calculating a hash code of the object by performing an operation on the path name of the object using a designated hashing algorithm;

 Locating the list of generated structures in an array of references indexed by the calculated hash code;

 Locating a structure in the list of structures whose path name field matches the path name of the object;

 10. The method of claim 9, further comprising the step of: determining a location of the addressing information in the structure of the matched path name.