A Study on the Transportation Period of the EPG Data Specification in Terrestrial DMB

With the convergence of information communication and broadcasting technology, DMB (Digital Multimedia Broadcasting) becomes the hottest issue of the next generation in the new media industry and the communications market. It is possible for people to watch seamless TV broadcast using DMB in motion, by adding video transportation specification into Eureka-147 of European digital radio broadcasting standard. DMB can select the preferred channel by using EPG (Electronic Program Guide). Since the EPG information takes a role of baseline which provides whole guidelines and services to users, its update should be performed constantly. To support scalability and compatibility on DMB, XML-based EPG and binary EPG have been proposed for the establishment of standard and these EPGs are being updated daily or weekly. However, this update period is too long to apply changes on time and also makes the update process take long time. To solve this problem, this paper proposes and implements efficient EPG system which maximizes the efficiency of EPG specification, by updating EPG of binary format per period of an hour and applying Naming Rule.

[1]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..

[2]  D. Manjunath,et al.  Routing and wavelength assignment in optical networks from edge disjoint path algorithms , 2002, IEEE Communications Letters.

[3]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[4]  Kumar N. Sivarajan,et al.  Practical routing and wavelength assignment algorithms for all optical networks with limited wavelength conversion , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[5]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[6]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[7]  Hyunseung Choo,et al.  A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths , 2003, Human.Society@Internet 2003.

[8]  Rahul Simha,et al.  The Partition Coloring Problem and its Application to Wavelength Routing and Assignment , 2000 .

[9]  C. Siva Ram Murthy,et al.  WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .

[10]  Panagiotis Papadimitratos,et al.  Path set selection in mobile ad hoc networks , 2002, MobiHoc '02.

[11]  Sajal K. Das,et al.  An efficient heuristic for routing and wavelength assignment in optical WDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[12]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..