Adaptive packet routing for bursty adversarial traffic (Q1577008): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1999.1681 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210598494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slide—The Key to Polynomial End-to-End Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate load balancing on dynamic and asynchronous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The slide mechanism with applications in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for network delay. I. Network elements in isolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for network delay. II. Network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic load balancing by random matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and Admission Control in General Topology Networks with Poisson Arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for message routing in parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the greedy routing algorithm for array networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Packet Scheduling on Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A packet routing protocol for arbitrary networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal continuous routing strategies / rank
 
Normal rank

Latest revision as of 12:30, 30 May 2024

scientific article
Language Label Description Also known as
English
Adaptive packet routing for bursty adversarial traffic
scientific article

    Statements

    Adaptive packet routing for bursty adversarial traffic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2000
    0 references
    networking
    0 references
    packet routing
    0 references

    Identifiers