D. Starobinski, M. Karpovsky, and L. Zakrevski. Application of Network Calculus to General Topologies using Turn-Prohibition. IEEE/ACM Transactions on Networking, June 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Extending the Network Calculus Pay Bursts Only Once Principle to.. - Fidler (2003) (Correct)
....cycles, and transform the domains topology into a feed forward network, to allow for the direct application of Network Calculus. Such a conversion of the network topology can be made by means of breaking up loops by forbidding certain links, for example by turn prohibition as presented in [21] for networks that consist of bidirectional links. Doing so, the BB can inductively derive the arrival curves of micro flows at each outgoing link, then compute the service curve of each link from the point of view of each micro flow, and concatenate these to end to end service curves, to give ....
....sinks to each of the level two nodes. Links are either Synchronous Transfer Mode (STM) 4, STM 16, or STM 64 connections. The link transmission delay is assumed to be 2 ms. Shortest Path First (SPF) routing is applied to minimize the number of hops along the paths. Further on, Turn Prohibition (TP) [21] is used, to ensure the required feed forward property of the network. Figure 3 shows how loops are broken within the level one mesh of the DFN topology by the TP algorithm. The nodes have been processed by TP in the order of their numbering. For example the turn (8; 7; 9) that is the turn from ....
[Article contains additional citation context not shown here]
Starobinski, D., Karpovsky, M., and Zakrevski, L., Application of Network Calculus to General Topologies using Turn-Prohibition, Proceedings of IEEE Infocom, 2002.
Scalable Cycle-Breaking Algorithms for Gigabit.. - De Pellegrini.. (2004) (1 citation) Self-citation (Starobinski Karpovsky) (Correct)
No context found.
D. Starobinski, M.G. Karpovsky and L. Zakrevski "Application of Network Calculus to General Topologies using Turn-- Prohibition," IEEE/ACM Transactions on Networking, Vol. 11, No. 3, pp. 411-421, June 2003.
Routing in Turn-Prohibition Based Feed-Forward Networks - Fidler, Einhoff (2004) (Correct)
No context found.
D. Starobinski, M. Karpovsky, and L. Zakrevski. Application of Network Calculus to General Topologies using Turn-Prohibition. IEEE/ACM Transactions on Networking, June 2003.
Path Allocation in Backbone Networks: Project Report - Fidler, Klimala, Sander (2004) (Correct)
No context found.
Starobinski, D., Karpovsky, M. and Zakrevski, L., Application of Network Calculus to General Topologies using Turn-Prohibition, IEEE/ACM Transactions on Networking, vol. 11, no. 3, pp. 411-421, 2003.
Path Allocation in Backbone Networks: Project Report - Fidler, Klimala, Sander (2004) (Correct)
No context found.
Starobinski, D., Karpovsky, M. and Zakrevski, L., Application of Network Calculus to General Topologies using Turn-Prohibition, IEEE/ACM Transactions on Networking, vol. 11, no. 3, pp. 411-421, 2003.
On the Impacts of Traffic Shaping on End-to-End Delay Bounds in.. - Fidler (2003) (Correct)
No context found.
Starobinski, D., Karpovsky, M., and Zakrevski, L., Application of Network Calculus to General Topologies using Turn-Prohibition, Proceedings of IEEE Infocom, 2002.
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