H-FSC Algorithm
Eligible time (e): whenever there are eligible packets there are potential conflict between real-time and link-sharing goals
Deadline (d): if all deadlines of packets of a class are met, its service curve guarantee is met
Virtual time (v): normalized amount of service received by a class
e, d, v are computed based on three curves E( ), D( ), V( )
if (there is an eligible packet)
send eligible packet with min. deadline d ;
/* link-sharing criteria */
send packet with min. virtual time v ;