In real time communication system, packets of lower prioritized flows suffer a longer queuing delay than the packets having higher priority. As a result, they reach at the destination in a long end-to-end delay and become less useful. In this paper, we have proposed a real time packet scheduling technique to minimize overall end-to-end delay among multiple flows. Here, elapsed time plays a major role to calculate priority of a packet. The packets, already spent a long queuing delay are re-assigned to lower priority. Also, the model reduces the priority of the higher prioritized packets when they are very early and approaching to the destination node. This model gives more importance to middle aged packets (neither too early nor too late with respect to packet creation and deadline of packet receiving) so that they can reach the destination within time bound. The model is experimented using NS-2 and performance has been compared with other queuing policies. Performance evaluation of this model exhibits moderated end-to-end latency of the flows and works more efficiently than other techniques.