Abstract
Attention in the recent history of QoS routing, in particular Expedited Forwarding (EF) and Assured Forwarding (AF), has focused on routing or on analyzing the performance of QoS classes separately using approaches not specifically addressing the needs of the classes in question. This study proposes a heuristic scheme on how to route both classes with the emphasis on maximizing admission probability for the EF class. Mainstream algorithms are examined and a case is made for why current algorithms are inadequate and why this scheme, though flawed in its own right, is a step towards finding an optimal and practical solution and hopefully stimulate more research in this issue.