Time-driven priority
Template:Short description Time-driven priority (TDP)[1] is a synchronous packet scheduling technique that implements UTC-based pipeline forwarding[2] and can be combined with conventional IP routing to achieve the higher flexibility than another pipeline forwarding implementation known as time-driven switching (TDS) or fractional lambda switching (FλS).[3][<span title="Script error: No such module "decodeEncode".">clarification needed] Packets entering a switch from the same input port during the same [time frame] (TF) can be sent out from different output ports, according to the rules that drive IP packet routing. Operation in accordance to pipeline forwarding principles ensures deterministic quality of service and low complexity packet scheduling. Specifically, packets scheduled for transmission during a TF are given maximum priority; if resources have been properly reserved, all scheduled packets will be at the output port and transmitted before their TF ends.
Various aspects of the technology are covered by several patents issued by both the United States Patent and Trademark Office and the European Patent Office.[citation needed]
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.Li, Chung-Sheng; Ofek, Yoram; Yung, Moti (1996), ""Time-driven Priority" Flow Control for Real-time Heterogeneous Internetworking", IEEE Int. Conf. on Computer Communications (INFOCOM 1996) (PDF), IEEE
- ^ Page Module:Citation/CS1/styles.css has no content.Baldi, Mario; Marchetto, Guido; Ofek, Yoram (10 October 2007), "A Scalable Solution for Engineering Streaming Traffic in the Future Internet", Computer Networks, 51 (14): 4092–4111, CiteSeerX 10.1.1.559.3251, doi:10.1016/j.comnet.2007.04.019
- ^ Page Module:Citation/CS1/styles.css has no content.Baldi, Mario; Ofek, Yoram (2004), "Fractional Lambda Switching - Principles of Operation and Performance Issues" (PDF), SIMULATION: Transactions of the Society for Modeling and Simulation International, 80 (10): 527–544, CiteSeerX 10.1.1.131.6794, doi:10.1177/0037549704046461, S2CID 2276883
