J. Y. L. Boudec and P. Thiran. Network Calculus. Springer Verlag LNCS 2050. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Predicate Routing: Enabling Controlled Networking - Roscoe, Hand (2002) (7 citations) (Correct)
....by the modi cation of Predicate Routing paths. Similar arguments apply to IEEE VLANs [7] in the local area. Predicate Routing also has much in common with the hose model [4] in that end points are explicit (being described by predicates) while network paths are implicit. The network calculus [2] provides a framework for reasoning about trac on network links and has a natural synergy with Predicate Routing: predicate terms can be annotated with values from the network calculus. XXX more on network calculus; policy routing policy based routing. 6. CONCLUSION We have presented Predicate ....
J. Y. L. Boudec and P. Thiran. Network Calculus. Springer Verlag LNCS 2050.
Predicate Routing: Enabling Controlled Networking - Roscoe, Hand, Isaacs.. (2002) (7 citations) (Correct)
....by the modification of Predicate Routing paths. Similar arguments apply to IEEE VLANs [7] in the local area. Predicate Routing also has much in common with the hose model [4] in that end points are explicit (being described by predicates) while network paths are implicit. The network calculus [2] provides a framework for reasoning about tra#c queuing patterns in networks, based on the Min Plus algebra. Network calculus provides a way to extend Predicate Routing with notions of Quality of Service and tra#c engineering. By attaching network calculus expressions to flow terms in link ....
J. Y. L. Boudec and P. Thiran. Network Calculus. Springer Verlag LNCS 2050.
Traffic Engineering in a Multipoint-to-Point Network - Urvoy-Keller.. (Correct)
....The result applies to FIFO networks with a general architecture, but it is restricted to the case of constant bit rate sources. In the present work, we concentrate on a specific architecture, the m2p architecture, however with variable bit rate sources. III. NETWORK CALCULUS The Network Calculus [13], 6] 7] 8] 14] is an analytical method to derive deterministic bounds on end to end delays and backlogs. The Network Calculus has been developed both for continuous time [13] and discrete time [8] We use here the continuous version that is better suited for a fluid flow analysis. We ....
....the m2p architecture, however with variable bit rate sources. III. NETWORK CALCULUS The Network Calculus [13] 6] 7] 8] 14] is an analytical method to derive deterministic bounds on end to end delays and backlogs. The Network Calculus has been developed both for continuous time [13] and discrete time [8] We use here the continuous version that is better suited for a fluid flow analysis. We present, in the following, the basic concepts of the Network Calculus that will be used in the rest of this paper. A. Sources and Network Elements Modeling A.1 General Sources Consider ....
[Article contains additional citation context not shown here]
J.-Y. Le Boudec and P. Thiran, Network Calculus, Springer Verlag LNCS 2050.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC