Real-time traffic scheduling and routing in packet-switched networks using a least-laxity-first strategy
DOI10.1023/A:1022826023262zbMATH Open1036.68010OpenAlexW2133991830MaRDI QIDQ1870516FDOQ1870516
Authors: Sudhir M. Rao, Albert M. K. Cheng
Publication date: 14 May 2003
Published in: Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022826023262
Recommendations
- Scheduling nonuniform traffic in a packet switching system with large propagation delay
- Deadline-based scheduling in support of real-time data delivery
- scientific article; zbMATH DE number 2185540
- Optimal multiplexing on a single link: delay and buffer requirements
- Adaptive packet scheduling for requests delay guaranties in packet-switched computer communication network
buffer managementreal-time schedulingend-to-end delaypacket-switched networkspacket routingmultimedia trafficLLFfirst schedulingleast-laxity
Cited In (8)
- Title not available (Why is that?)
- Guaranteed real-time communication in packet-switched networks with FCFS queuing
- Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound
- A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing
- Scheduling nonuniform traffic in a packet switching system with large propagation delay
- Deadline-based scheduling in support of real-time data delivery
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Real-time traffic scheduling and routing in packet-switched networks using a least-laxity-first strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870516)