Self-similar traffic generation

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S411000

Reexamination Certificate

active

10404864

ABSTRACT:
There is disclosed apparatus and methods for mimicking self-similar traffic in a telecommunications network. One ore more self-similar streams of data units may be generated according to values of selected parameters for the streams, such as the Hurst parameter. Values may be pre-calculated and stored in a table in a memory. To generate the stream, a traffic distribution is generated based on the values of the parameters, and through retrieval of the values from the table.

REFERENCES:
patent: 5568471 (1996-10-01), Hershey et al.
patent: 5671351 (1997-09-01), Wild
patent: 5761486 (1998-06-01), Watanabe
patent: 5787147 (1998-07-01), Gundersen
patent: 5905713 (1999-05-01), Anderson et al.
patent: 6028847 (2000-02-01), Beanland
patent: 6148277 (2000-11-01), Asava
patent: 6172989 (2001-01-01), Yanagihara et al.
patent: 6173333 (2001-01-01), Jolitz
patent: 6321264 (2001-11-01), Fletcher
patent: 6343078 (2002-01-01), Bronstein et al.
patent: 6507923 (2003-01-01), Wall et al.
patent: 6526259 (2003-02-01), Ho
patent: 6580707 (2003-06-01), Ikeda
patent: 6601020 (2003-07-01), Myers
patent: 6621805 (2003-09-01), Kondylis et al.
patent: 6789100 (2004-09-01), Nemirovsky
patent: 6950405 (2005-09-01), Van Gerrevink
patent: 6990529 (2006-01-01), Yang et al.
patent: 7002918 (2006-02-01), Prieto et al.
patent: 7161902 (2007-01-01), Carter et al.
patent: 2001/0039590 (2001-11-01), Furukawa
patent: 2002/0037008 (2002-03-01), Tagami
patent: 2002/0080781 (2002-06-01), Gustavsson
patent: 2002/0138226 (2002-09-01), Doane
patent: 2002/0177977 (2002-11-01), Scarfat
patent: 2003/0043434 (2003-03-01), Brachmann et al.
patent: 2003/0099243 (2003-05-01), Oh et al.
patent: 0895375 (1999-02-01), None
Bramko, et al., Experiences with Network Simulation, ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems, Philadelphia, New York, May 23, 1996.
Ixia, Specifications for Load Modules—Multilayer Gigbit Ethernet for LM1000LX, LM1000SX, LM1000GBIC, LM1000T, Product Specification Sheet.
Ulanvos, Modeling methods of self-similar traffic for network performance evaluation, Scientific Proceeding of RTU, Series 7, Telecommunications and Electronics, 2002.
Veres, et al., The Chaotic Behavior of TCP Congestion Control, Best Paper Award at IEEE INFOCOM, Tel-Aviv, Mar. 2000.
Zec, M. and Mikuc, M., Real-Time IP Network Simulation at Gigabit Data Rates, Proceedings of the 7th International Conference on Telecommunications (ConTEL), Jun. 2003.
Ye, Tao, et al., Large-Scale Network Parameter Configuration Using an On-line Simulation Framework, Technical report, ECSE Department, Rensselear Polytechnic Institute. 2002.
Kramer, Glen, Self-Similar Network Traffic: The notions and effects of self-similarity and long-range dependence, Online!, website: http://wwwcsif.cs.ucdavis.edu/{kramer/papers/ss—trf—present2.pdf>.
Mondragon, R.J. et al., Chaotic maps for traffic modelling and queueing performance analysis, Performance Evaluation 43, 2001.
Sikdar, Biplab and Kenneth S. Vastola, On the contribution of TCP to the Self-Similarity of Network Traffic, Springer-Verlag, p. 596-613, 2001, Berlin Germany ISBN: 3-450-42592-6. Sep. 20, 2001.
Ye, Tao, Network Management and Control Using collaborative On-Line Simulation, Rensselaer Polytechnic Institute, 2003.
Willinger, Walter, and Robert Sherman, Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level, IEEE/ACM Transactions on Networking vol. 5 No. 1 Feb. 1997.
Ryu, “Fractal Network Traffic: From Understanding to Implications,” Ph.D. Thesis, Columbia University, NY, 1996.
Guo et al, “How Does TCP Generate Pseudo-Self-Similarity?,” In Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems—MASCOTS '01, Cincinnati, Ohio, Aug. 2001.
Veres et al, “The Chaotic Behavior of TCP Congestion Control,” Best Paper Award at Proceedings of IEEE INFOCOM (and Best paper Award), Tel-Aviv, Mar. 2000.
Paxson, “Fast Approximate Synthesis of Fractional Gaussian Noise for Generating Self-Similar Network Traffic,” Computer Communication Review 27(5), pp. 5-18, Oct. 1997.
Wallerich, “Self-Similarity and Heavy Tailed Distributions,” Design and Implementation of a WWW Workload Generator for the NS-2 Network Simulator (Chapter 2.2), NSWEB.
Kramer, et al, Interleaved Polling with Adaptive Cycle Time (IPACT): Protocol Design and Performance Analysis, Jul. 2001.
Kramer, “On Generating Self-Similar Network Traffic Using Pseudo-Pareto Distribution,” Tutorial, U.C. Davis.
Kramer, “Generator of Self-Similar Network Traffic (version 2),” U.C. Davis.
Delgado-Restituo et al, “Integrated Chaos Generators,” Proceedings of the IEEE, vol. 90, No. 5, May 2002.
Kramer, “Generator of Self-Similar Network Traffic,” U.C. Davis.
Taqqu, et al, “Proof of a Fundamental Result in Self-Similar Traffic Modeling”.
Willinger, et al., “Self-Similarity and Heavy Tails: Structural Modeling of Network Traffic”.
Willinger, et al., “Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level,” Proc. of the ACM/Sigcomm '95.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Self-similar traffic generation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Self-similar traffic generation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-similar traffic generation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3888936

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.