Kalinahia: Considering quality of service to design and execute distributed multimedia applications

被引：1
作者：
Laplace, Sophie [1 ]
Dalmau, Marc [1 ]
Roose, Philippe [1 ]
机构：
[1] Univ Pau & Pays Adour, LIUPPA IUT Bayonne, Bayonne, France
来源：
2008 IEEE NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, VOLS 1 AND 2 | 2008年
关键词：
quality of service; adaptation; design; multimedia; distributed application; reconfiguration; components;
D O I：
10.1109/NOMS.2008.4575255
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
One of the current challenges of Information Systems is to ensure semi-structured data transmission, such as multimedia data, in a distributed and pervasive environment. Information Sytems must then guarantee users a quality of service ensuring data accessibility whatever the hardware and network conditions may be. They must also guarantee information coherence and particularly intelligibility that imposes a personalization of the service. Within this framework, we propose a design method based on original models of multimedia applications and quality of service. We also define a supervision platform Kalinahia using a user centered heuristic allowing us to define at any moment which configuration of software components constitutes the best answers to users' wishes in terms of service.
引用
收藏
页码：951 / 954
页数：4
相关论文
共 20 条
  • [1] AYED D, 2004, DATA MODEL CONTEXT A
  • [2] CALVARY G, 2001, UNIFYING REFERENCE F
  • [3] DALMAU M, 2005, IEEE 19 ICAINA TAIW
  • [4] DASILVA LA, 2000, IEEE COMMUNICATIONS, V3, P2, DOI DOI 10.1109/COMST.2000.5340797
  • [5] Firesmith D., 2003, J OBJECT TECHNOL, V2, P67, DOI [10.5381/jot.2003.2.5.c6, DOI 10.5381/JOT.2003.2.5.C6]
  • [6] GARCIA E, 2001, CENTRALIZED DISTRIBU, P108
  • [7] Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
  • [8] Gu XH, 2002, J VISUAL LANG COMPUT, V13, P61, DOI 10.1006/jvlc.2001.0227
  • [9] HAFID A, 1998, ELECT J NETWORKS DIS, P1
  • [10] MAMCRA: a constrained-based multicast routing algorithm
    Kuipers, F
    Van Mieghem, P
    [J]. COMPUTER COMMUNICATIONS, 2002, 25 (08) : 802 - 811
12