Profit oriented multichannel resource management of integrated Communication and Broadcast Networks

IEEE Transactions on Broadcasting

Volumn 51, Issue 4, 2005, Pages 530-537

  Miao, Guowang ^a,b   Niu, Zhisheng ^a,b  

^a IEEE   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Bandwidth allocation; Integration; Multichannel; Resource management

Indexed keywords

BROADCAST NETWORKS; MULTICHANNELS; RESOURCE MANAGEMENT;

BANDWIDTH; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA PROCESSING; FREQUENCY ALLOCATION; MULTIMEDIA SYSTEMS; REDUNDANCY; TELECOMMUNICATION NETWORKS;

BROADCASTING;

EID: 29044434283     PISSN: 00189316     EISSN: None     Source Type: Journal    
DOI: 10.1109/TBC.2005.858423     Document Type: Article

References (21)

1. R. Burow, P. Pogrzeba, and P. Christ, Mobile Reception of DVB-T, 1999.
2. P. Nasiopoulos and R. Ward, "Effective multi-program broadcasting of pre-recorded video using VBR MPEG-2," IEEE Trans. Broadcast. Sep. 2002.
3. R. Jaeger and J. Neubauer. "Broadband internet access in a DVB network," in Proc. of International Symposium on Services und Local Access, Stockholm. Sweden. June 2000.
4. G. Gardikis, A. Kourtis. and P. Constantinous. "Dynamic bandwidth allocation in DVB-T networks providing IP services," IEEE Transaction on Broadcasting, vol. 49, no. 3. Sep. 2003.
5. M. D. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
6. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations: J. Wiley & Sons, 1990.
7. E. Falkenauer, "A hybrid grouping genetic algorithm for bin packing," CRIF Industrial Management and Automation, CP 106-P4. 40 av. F.D. Roosevelt, Brussels, Belgium, 1994.
8. M. S. Hung and U. C. Fisk, "An algorithm for zero-one Multiple Knapsack Problems." Naval Research Logistics Quarterly, vol. 24, pp. 279-571, 1978.
9. S. Martello and P. Toth, "Solution of the zero-one Multiple Knapsack Problem," European Journal of Operational Research, vol. 4. pp. 276-283, 1980.
10. A. Drexl, "A simulated annealing approach to the multiconstraint zero-one Knapsack Problem," Computing, vol. 40, pp. 1-8, 1988.
11. F. Glover and O. A. Kochenberger, "Critical event tabu search for multidimensional Knapsack Problems," in Metaheuristics: The Theory and Applications: Kluwer Academic Publishers, 1996, pp. 407-427.
12. S. Hanafi and A. Fréville, "An efficient tabu search approach for the 0-1 multidimensional Knapsack Problem," European Journal of Operational Research, vol. 106, pp. 659-675, 1998.
13. P. C. Chu and J. E. Beasley, "A genetic algorithm for the multidimensional Knapsack Problem," Journal of Heuristic, vol. 4, pp. 63-86, 1998.
14. G. R. Raidl and G. Kodydek, "Genetic algorithms for the multiple container packing problem," in Proc. of the 5th Int. Conference on Parallel Problem Solving From Nature, Amsterdam, The Netherlands, 1998, pp. 875-884.
15. Y. An-bo and Y. Jia-ben, "Genetic algorithm for Multi Knapsack Problem," Computing Technology and Automation, vol. 2, no. 2, pp. 59-63, 2002.
16. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. Chichester, UK: Wiley, 1990.
17. _, "A bound and bound algorithm for the zero-one Multiple Knapsack Problem," Discrete Applied Mathematics, vol. 3, pp. 275-288, 1981.
18. G. B. Dantzig, "Discrete variable extremum problems," Operations Research, vol. 5, pp. 266-277, 1957.
19. R. E. Bellman, Dynamic Programming. Princeton, NJ: Princeton University Press, 1957.
20. U. Reimers, Digital Video Broadcasting: The International Standard for Digital HDTV: Springer, 1997.
21. M. Conti and E. Gregori, "Global telecommunications conference, 1997," in IEEE GLOBECOM '97, vol. 1, Nov. 3-8, 1997, pp. 443-447.