Searching for tight performance bounds in feed-forward networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5987 LNCS, Issue , 2010, Pages 227-241

  Kiefer, Andreas ^a   Gollan, Nicos ^a   Schmitt, Jens B ^a  

^a France   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX PROBLEMS; COMPUTATIONAL EFFORT; FEED-FORWARD NETWORK; MONTE CARLO; NP-HARD; PERFORMANCE BOUNDS; SERVER MODELS; TIGHT BOUND;

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; MONTE CARLO METHODS; QUALITY ASSURANCE;

HEURISTIC METHODS;

EID: 78650293633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12104-3_18     Document Type: Conference Paper

References (42)

1. Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. Tech. Rep. RR-7012, Unité de recherche INRIA Rennes (2009).
2. Cruz, R.L.: A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory 37, 114-131 (1991).
3. Cruz, R.L.: A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory 37, 132-141 (1991).
4. Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications 13, 1048-1056 (1995).
5. Sariowan, H., Cruz, R.L., Polyzos, G.C.: Scheduling for quality of service guarantees via service curves. In: Proc. IEEE ICCCN, September 1995, pp. 512-520 (1995).
6. Chang, C.-S.: On deterministic traffic regulation and service guarantees: A systematic approach by filtering. IEEE Transactions on Information Theory 44, 1097-1110 (1998).
7. Le Boudec, J.-Y.: Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory 44, 1087-1096 (1998).
8. Agrawal, R., Cruz, R.L., Okino, C., Rajan, R.: Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking 7, 310-323 (1999).
9. Ciucu, F., Burchard, A., Liebeherr, J.: A network service curve approach for the stochastic analysis of networks. In: Proc. ACM SIGMETRICS, June 2005, pp. 279-290 (2005).
10. Le Boudec, J.-Y., Thiran, P.: Calculus A Theory of Deterministic Queuing Systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2001).
11. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. Probability and Mathematical Statistics. John Wiley & Sons Ltd., Chichester (1992).
12. Chang, C.-S.: Performance Guarantees in Communication Networks. Telecommunication Networks and Computer Systems. Springer, Heidelberg (2000).
13. Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: an Overview. RFC 1633, Informational (June 1994).
14. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Service. RFC 2475 (Informational). Updated by RFC 3260 (December 1998).
15. Schmitt, J., Roedig, U.: Sensor network calculus - a framework for worst case analysis. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 141-154. Springer, Heidelberg (2005).
16. Koubaa, A., Alves, M., Tovar, E.: Modeling and worst-case dimensioning of clustertree wireless sensor networks. In: Proc. IEEE RTSS, pp. 412-421 (2006).
17. Skeie, T., Johannessen, S., Holmeide, O.: Timeliness of real-time ip communication in switched industrial ethernet networks. IEEE Transactions on Industrial Informatics 2, 25-39 (2006).
18. Chakraborty, S., Kuenzli, S., Thiele, L., Herkersdorf, A., Sagmeister, P.: Performance evaluation of network processor architectures: Combining simulation with analytical estimation. Computer Networks 42(5), 641-665 (2003).
19. Kim, H., Hou, J.: Network calculus based simulation: theorems, implementation, and evaluation. In: Proc. IEEE INFOCOM (March 2004).
20. Chang, C.-S.: Stability, queue length and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control 39, 913-931 (1994).
21. Andrews, M.: Instability of fifo in session-oriented networks. In: Proc. SODA, March 2000, pp. 440-447 (2000).
22. Charny, A., Le Boudec, J.-Y.: Delay bounds in a network with aggregate scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 1-13. Springer, Heidelberg (2000).
23. Jiang, Y.: Delay bounds for a network of guaranteed rate servers with fifo aggregation. Computer Networks 40(6), 683-694 (2002). (Pubitemid 35433138)
24. Zhang, Z.-L., Duan, Z., Hou, Y.T.: Fundamental trade-offs in aggregate packet scheduling. In: Proc. ICNP, November 2001, pp. 129-137 (2001). (Pubitemid 34099977)
25. Starobinski, D., Karpovsky, M., Zakrevski, L.A.: Application of network calculus to general topologies using turn-prohibition. IEEE/ACM Transactions on Networking 11(3), 411-421 (2003).
26. Fidler, M., Sander, V.: A parameter based admission control for differentiated services networks. Computer Networks 44(4), 463-479 (2004).
27. Lenzini, L., Martorini, L., Mingozzi, E., Stea, G.: Tight end-to-end per-flow delay bounds in fifo multiplexing sink-tree networks. Performance Evaluation 63(9), 956- 987 (2006).
28. Urvoy-Keller, G., Hébuterne, G., Dallery, Y.: Traffic engineering in a multipointto- point network. IEEE Journal on Selected Areas in Communications 20, 834-849 (2002).
29. Le Boudec, J.-Y., Charny, A.: Packet scale rate guarantee for non-fifo nodes. In: Proc. IEEE INFOCOM, June 2002, pp. 23-26 (2002).
30. Le Boudec, J.-Y., Rizzo, G.: Pay bursts only once does not hold for non-fifo guaranteed rate nodes. Performance Evaluation 62(1-4), 366-381 (2005).
31. Echagüe, J., Cholvi, V.: Worst case burstiness increase due to arbitrary aggregate multiplexing. In: Proc. of VALUETOOLS. ACM, New York (2006).
32. Rajagopal, S., Reisslein, M., Ross, K.W.: Packet multiplexers with adversarial regulated traffic. In: Proc. IEEE INFOCOM, March 1998, pp. 347-355 (1998).
33. Schmitt, J., Zdarsky, F.: The DISCO Network Calculator - a toolbox for worst case analysis. In: Proc. of VALUETOOLS. ACM, New York (2006).
34. Bouillard, A., Thierry, E.: An algorithmic toolbox for network calculus. Tech. Rep. RR-6094, Unité de recherche INRIA Rennes (2007).
35. Schmitt, J.B., Zdarsky, F.A., Martinovic, I.: Improving Performance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once. In: 14th GI/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB 2008), Dortmund, Germany, GI/ITG (March 2008).
36. Schmitt, J.B., Zdarsky, F.A., Fidler, M.: Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch... In: 27th IEEE International Conference on Computer Communications (INFOCOM 2008), Phoenix, AZ, USA (April 2008).
37. Schmitt, J., Zdarsky, F., Fidler, M.: Delay bounds under arbitrary multiplexing. Technical Report 360/07, University of Kaiserslautern, Germany (July 2007).
38. Hooke, R., Jeeves, T.A.: "'Direct Search"' Solution of Numerical and Statistical Problems. J. ACM 8(2), 212-229 (1961).
39. Gollan, N., Zdarsky, F.A., Martinovic, I., Schmitt, J.B.: The DISCO Network Calculator. In: 14th GI/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB 2008), Dortmund, Germany, GI/ITG (2008).
40. Zdarsky, F., Schmitt, J., Gollan, N.: The DISCO Network Calculator, http://disco.informatik.uni-kl.de/content/Network-Calculator (last accessed 2009-10-09).
41. Eikland, K., Notebaert, P., et al.: lp solve: A Mixed Integer Linear Programming (MILP) solver, http://sourceforge.net/projects/lpsolve/(last accessed 2009- 10-09).
42. Shenker, S., Partridge, C., Guerin, R.: Specification of Guaranteed Quality of Service. RFC 2212 (Proposed Standard) (September 1997).