CLDF:一种增强关键服务可生存性的应急调度算法

可生存性研究是可信网络技术发展所处的一个新阶段,如何使用有效的技术来增强系统中关键服务的可生存性是一项重要的研究内容.从应急调度的角度来研究保证关键服务持续、可靠运行的可生存性增强策略,提出了价值-生存时间-截止期优先的CLDF (criticality-lifetime-deadline first)算法,并利用多重链表给出了算法的实现,包括服务的接受策略与服务完成/夭折策略的算法实现,保证了整个应急配置过程对用户的透明.仿真试验就差分服务保证率与TDM算法进行了比较,结果表明,提出的方法为关键服务的可生存性提供了保证,特别是在系统过载时能够优雅地降级,有效地提高了整个系统的可生存能力.

CLDF: an emergency scheduling algorithm for enhanced survivability of critical service

Enha ncement of surviv abili ty i s one of the most adv anced resea rch problems in the dev elo pment o f high dependabi li ty technolog y at present. A new Criticali ty-Lifetime-Deadline First ( CLDF) algo ri thm f rom the emerg ency scheduling standpoint w as proposed. The algo ri thm w as reali zed by using mul ti-linked list s including service acceptance po licy a nd service completio n /abo rtio n policy , so as to make the who le config ura tion process t ranspa rent for users. Mo reov er the performa nce of CLDF alg o rithm w as compa red w ith TDM alg ori thm based o n dif ferentiated g uarantee ratio. The experimental resul ts show that the proposed method can prov ide the guarantee o f survivabi li ty fo r cri tical serv ices, especially w hen ov erloaded, the perfo rmance can deg rade g racefully , a nd effectiv ely improv e the surviv abili ty of the overall sy stem.