Flow Aggregation Criteria in Networks with Rate-Guaranteeing Servers 


Vol. 33,  No. 12, pp. 1097-1102, Dec.  2008


PDF
  Abstract

An effective method for calculating delay bounds of flows through flow aggregations and deaggregations is given. Based on this calculation, it is suggested a simple criteria for flow aggregation whether the aggregation will induce an increased delay bound. The criteria is evaluated in a few realistic scenarios.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Joung, J. Song, S. S. Lee, "Flow Aggregation Criteria in Networks with Rate-Guaranteeing Servers," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 12, pp. 1097-1102, 2008. DOI: .

[ACM Style]

Jinoo Joung, Jongtae Song, and Soon Seok Lee. 2008. Flow Aggregation Criteria in Networks with Rate-Guaranteeing Servers. The Journal of Korean Institute of Communications and Information Sciences, 33, 12, (2008), 1097-1102. DOI: .

[KICS Style]

Jinoo Joung, Jongtae Song, Soon Seok Lee, "Flow Aggregation Criteria in Networks with Rate-Guaranteeing Servers," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 12, pp. 1097-1102, 12. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880