PARALLEL TRACE-DRIVEN SIMULATION OF PACKET-SWITCHED MULTIPLEXER UNDERPRIORITY SCHEDULING POLICY

We propose an approximate parallel simulation for packet loss of packe t-switched multiplexer with priority scheduling policy. The speedup of the algorithm over the sequential simulation is O(N), where N is the number of processors. For packets with priority level m, the number L( m) of lost packets computed in the algorithm is bounded by the exact n umber L(E)m within 2(N - 1) packets. That is, \L(m) - L(E)m\ less-than -or-equal-to 2(N - 1).