Advertisement

A Novel Congestion Control Scheme for Elastic Flows in Network-on-Chip Based on Sum-Rate Optimization

  • Mohammad S. Talebi
  • Fahimeh Jafari
  • Ahmad Khonsari
  • Mohammad H. Yaghmae
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)

Abstract

Network-on-Chip (NoC) has been proposed as an attractive alternative to traditional dedicated busses in order to achieve modularity and high performance in the future System-on-Chip (SoC) designs. Recently, end-to-end congestion control has gained popularity in the design process of network-on-chip based SoCs. This paper addresses a congestion control scenario under traffic mixture which is comprised of Best Effort (BE) traffic or elastic flow and Guaranteed Service (GS) traffic or inelastic flow. We model the desired BE source rates as the solution to a rate-sum maximization problem which is constrained with link capacities while preserving GS traffic services requirements at the desired level. We proposed an iterative algorithm as the solution to the maximization problem which has the advantage of low complexity and fast convergence. The proposed algorithm may be implemented by a centralized controller with low computation and communication overhead.

Keywords

Congestion Control Link Capacity Source Rate Best Effort Subgradient Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Guerrier, P., Greiner, A.: A Generic Architecture for On-Chip Packet-Switched Interconnections. In: Proc. Design, Automation and Test in Europe Conference and Exhibition (DATE) (2000)Google Scholar
  2. 2.
    Dally, W.J., Towles, B.: Route Packets, Not Wires: On-Chip Interconnection Networks. In: Proc. DAC 2001 (2001)Google Scholar
  3. 3.
    Goossens, K., et al.: The Æthereal network on chip: Concepts, architectures, and implementations. IEEE Design and Test of Computers 22(5) (2005)Google Scholar
  4. 4.
    Bjerregaard, T., et al.: A router architecture for connection oriented service guarantees in the MANGO clockless Network-on-Chip. In: Proc. Design, Automation and Test in Europe Conference and Exhibition (DATE) (2005) Google Scholar
  5. 5.
    Bertozzi, D., et al.: Xpipes: A network-on-chip architecture for gigascale systems-on-chip. IEEE Circuits and Systems Magazine (2004)Google Scholar
  6. 6.
    Kelly, F.P., Maulloo, A., Tan, D.: Rate control for communication networks: Shadow prices, proportional fairness, and stability. J. Oper. Res. Soc. 49(3), 237–252 (1998)zbMATHCrossRefGoogle Scholar
  7. 7.
    Yang, C., et al.: A taxonomy for congestion control algorithms in packet switching networks. IEEE Network 9 (1995)Google Scholar
  8. 8.
    Low, S.H., Lapsley, D.E.: Optimization Flow Control, I: Basic Algorithm and Convergence. IEEE/ACM Transactions on Networking 7(6), 861–874 (1999)CrossRefGoogle Scholar
  9. 9.
    Ogras, U., et al.: Prediction-based flow control for network-onchip traffic. In: Proc. DAC (2006)Google Scholar
  10. 10.
    Hu, J., et al.: DyAD - smart routing for networks-on-chip. In: Proc. DAC (2004)Google Scholar
  11. 11.
    van den Brand, J.W., Ciordas, C., Goossens, K., Basten, T.: Congestion- Controlled Best-Effort Communication for Networks-on-Chip. In: Proc. Design, Automation and Test in Europe Conference and Exhibition (DATE) (April 2007)Google Scholar
  12. 12.
    Talebi, M.S., Jafari, F., Khonsari, A.: Utility-Based Congestion Control for Best Effort Traffic in Network-on-Chip Architecture (Submitted to MASCOTS 2007)Google Scholar
  13. 13.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge Univ. Press, Cambridge, U.K (2004)zbMATHGoogle Scholar
  14. 14.
    Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (1999)Google Scholar
  15. 15.
    Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and distributed computation. Prentice-Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  16. 16.
    Boyd, S.: Convex Optimization II Lecture Notes. Stanford University (2006)Google Scholar
  17. 17.
    Poljak, B.T.: A General Method of Solving Extremum Problems. Soviet Math Doklady 8(3), 593–597 (1967)Google Scholar
  18. 18.
    Grant, M., Boyd, S., Ye, Y.: CVX (Ver. 1.0RC3): Matlab Software for Disciplined Convex Programming, Download available at: http://www.stanford.edu/~boyd/cvx

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mohammad S. Talebi
    • 1
  • Fahimeh Jafari
    • 1
    • 3
  • Ahmad Khonsari
    • 2
    • 1
  • Mohammad H. Yaghmae
    • 3
  1. 1.IPM, School of Computer, TehranIran
  2. 2.ECE Department, University of Tehran 
  3. 3.Ferdowsi University of Mashhad 

Personalised recommendations