List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
A Survey on the Common Network Traffic Sources Models
Full text
 PDF(219.5KB)
Source 
International Journal of Computer Networks (IJCN)
Table of Contents
Download Complete Issue    PDF(3.2MB)
Volume:  3    Issue:  2
Pages:  43-158
Publication Date:   May / June 2011
ISSN (Online): 1985-4129
Pages 
103 - 115
Author(s)  
 
Published Date   
31-05-2011 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Traffic Modeling, Performance, Quality of Service 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Google Scholar
2. Directory of Open Access Journals (DOAJ)
3. iSEEK
4. Docstoc
 
 
Selecting the appropriate traffic model can lead to the successful design of networks. The more accurate is the traffic model the better is the system quantified in terms of its performance Successful design lead to enhancement the overall performance of the whole of network .in literature there is innumerous traffic models proposed for understanding and analyzing the traffic characteristics of networks. Consequently, the study of traffic models to understand the features of the models and identify eventually the best traffic model, for a concerned environment has become a crucial and lucrative task. Good traffic modeling is also a basic requirement for accurate capacity planning. This paper provides an overview of some of the widely used network traffic models, highlighting the core features of the model and traffic characteristics they capture best. Finally we found that the N_BURST traffic model can capture the traffic characteristics of most types of networks, under every possible circumstance rather than any type of traffic model. 
 
 
 
1 Abdelnaser Adas, “Traffic Models in Broadband Networks”, IEEE Communications Magazine, Jul. 1997
2 Victor S. Frost and Benjamin Melamed, "Traffic Modeling for Telecommunications Networks", IEEE Communications, Mar. 1994.
3 LesterLipsky,Hans-PeterSchwefel,Manfred Jobmann,And Micael Greiner, “Comparison of the Analytic N-Burst Model With Some Other Approximations to Present-Day Telecommunications Traffic”, in Technical Report ,Univ.of Connecticut,(2000).
4 Erramilli and R.P. Singh, “Application of Deterministic Chaotic Maps to Characterize Broadband Traffic”, 7th ITC Specialists Seminar, Morristown, 1990.
5 Erramilli, R.P. Singh, and P. Pruthi, “Chaotic Maps as Models of Packet Traffic,” The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, Proc. of the 14th ITC, pp. 329-338, 6-10 June, 1994
6 R. J. Mondragón, D. K. Arrowsmith, and J. M. Pitts,” Chaotic maps for traffic modeling and queueing performance analysis,” Performance Evaluation, vol, pp. 223-240, March 2001.
7 A. Erramilli and R.P. Singh, “An Application of Deterministic Chaotic Maps to Model Packet Traffic”, Bellcore Technical Memorandum, 1992; preprint 1993, co-author P.Pruthi.
8 L.S. Liebovitch and T.I. Toth, ‘‘Ion Channel Kinetics: Random or Deterministic Process?", Biophysical Journal, vol. 57, pg 317a, 1990
9 Patrice Abry, Darry1 Veitch, “Wavelet Analysis of Long Rang Dependent Traffic “ IEEE Transactions on Information Theory (1998)
10 Vinary J. Ribeiro, Rudolf H. Riedi, Matthew S.Crouse, and Richard G. Baraniuk, “simulation of nonGausian Long-Rang-Dependent Traffic Using Wavelets”, In Proceeding SIGMETRICS ‘99(April 9,1999)
11 LesterLipsky,Hans-Peter Schwefel,Manfred Jobmann, And Micael Greiner, “ComparisonoftheAnalyticN-Burst ModelWithSomeOtherApproximations to Present-Day Telecommunications Traffic”, in TechnicalReport,Univ.of Connecticut,(2000)
12 J. Kurose On computing per session performance bounds in high speed multihop computer networks In ACM SigMetri92, pages128-139, Newport Rhode Island June 1992.
13 O.Yaron ,and,M.Sidi. Calculating performance bounds in communication networks In Proceedings of IEEE IN FOCOM93, pages539-546, SanFrancisco, CA, April 1993.
14 Dallas E. Wrege, Edward W. Knightly, Hui Zhang, and Jorg Liebeherr, " Deterministic Delay Bounds for VBR Video in Packet-Switching Networks: Fundamental Limits and Practical Trade-offs"IEEEIACM TRANSACTIONS ON NETWORKING, VOL. 4, NO. 3, JUNE 1996.
15 Daniel Heyman,”Performance Implications of Very Large Service-Time Variances.” Proceedings of the SPIE conference on Performance and Control of Network Systems. Boston, November 1998.
16 O .Yaron, and M .Sidi, Performance and stability of communication networks via robust exponential bounds IEEE Transaction on Networking 1(30:pages372-385, june 1993
17 Predrag Jelenkovic and Aurel Lazar, ”Multiplexing On- Off Sources with Subexponential On Periods: Part 11.” In V. P. Wirth (eds.), ‘Teletraffic Contributions for Ramaswami and the Information Age, Vol 2A’, pp. 965-974. Elsevier Science B.V., 1997.
18 R.Cruz, A calculus for network delay parts I and II. IEEE Transaction of Information Theory37 (1):114-141-1991.
19 Lester Lipsky, QUEUEING THEORY: A Linear Al- gebraic Approach, MacMillan and Company, New York, 1992.
20 Hui zhang,Edward w.knightly, providing end to end statistical performance guarntees with bounding interval dependent stochastic models In ACM SigMetri94,pages211- 220,june,1994
21 Lester Lipsky, Pierre Fiorini and Hans-Peter Schwefel, “Analytical Models of Performance in Telecommunication Systems, Based on ON-OFF Traffic Sources with Self-similar Behavior”, 7th International Conference on Telecommunication Systems Modeling and Analysis, Nashville, March 1999.
22 Edward W. Knightly, Hui Zhang “D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic” IEEE/ACM Transactions on Networking (TON) Volume 5 , Issue 2 (April 1997) Pages: 219 - 231
23 Hans-Peter Schwefel and Lester Lipsky, “Performance Results For Analytic Models of Traffic In Telecommunication Systems, Based on Multiple ON-OFF Sources with Self- Similar Behavior”, in P. Key and D. Smith (eds.), ‘Teletraffic Engineering in a Competitive World, Vol 3A’, pp. 55-66. Elsevier, 1999.Hans-Peter Schwefel and Lester Lipsky, “Performance Results For Analytic Models of Traffic In Telecommunication Systems, Based on Multiple ON-OFF Sources with Self- Similar Behavior”, in P. Key and D. Smith (eds.), ‘Teletraffic Engineering in a Competitive World, Vol 3A’, pp. 55-66. Elsevier, 1999.
24 Robert B. Cooper, Introduction to Queueing Theory, 2nd Ed., Northland, New York 1981.
25 Mark Crovella, Virgilio Almeida, Azer Bestavros and Adriana deOliveira, “Characterizing Reference Locality in the WWW,” ACM F‘DIS, 1996
26 U.Yechiali and P.Naor, “Queuing Problems with Heterogeneous Arrivals and Service,” Operations Research, vol. 19, pp. 722–734, 1971.
27 U.Yechiali and P.Naor, “Queuing Problems with Heterogeneous Arrivals and Service,”Operations Research, vol. 19, pp. 722–734, 1971.
28 M. Zukerman and I.Rubin,“Queueing performance of demand-assigned multi access communication systems under bursty traffic conditions,” Proceedings of IEEEICC’86, vol. 3, no.57.2, Toronto, Canada, June 1986,pp.1827–1832.
29 M.Zukerman and .Rubin, “On multi channel queueing systems withfluctuating parameters,” Proceedings of IEEEINFOCOM’86, Miami, Florida, April 1986, pp. 600–608.
30 M. F. Neuts, Structured stochastic matrices of M/G/1 type and their applications, Marcel Dekker, NY 1989.
31 G.Latouche and V.Ramaswami, Introduction to matrix analytic methods in stochastic modeling, SIAM, 1999.
32 H.Heffes and D.Lucantoni, “AMarkov modulated characterization of packetized voice And data traffic and related statistical multiplexer performance,” IEEE Journal on Selected Areas in Communications, vol. 4, no. 6, pp. 856–868, Sep 1986.
33 W.Fischer and K.Meier-Hellstern, “The Markov Modulated Poisson process (MMPP)cookbook, ” Performance Evaluation, vol. 18, pp. 149–171, 1992.
34 M.F.Neuts, Matrix-geometric solutions in stochastic models-algorithmic approach, The John Hopkin’s University Press, Baltimore (1981).
35 P Brady.A techniques for investigating on off patterns in speech Bell System Technical Journal, 44:1-22 January1965
36 B.Maglaris, D.Anastassiou, P .Sen, G. Karlsson, and J.D.Robbins. Performance models of statistical multiplexing in packet video communications IEEE Transaction on Communication ,36(7):834-844,july1988
37 V. Paxson and S. Floyd, "Wide-area Traffic: The Failure of Poisson Modeling", IEEE/ACM Transactions on Networking, Jun. 1995.
38 C. Chang, “Stability, queue length, and delay of deterministic and stochastic queueing networks”, IEEE Trans. Automat. Contr., vol. 39 no. 5, pp. 913-931, May 1994
39 D. Ferrariand ,D. Verma “AScheme for Real Time Channel Establishment in Wide Area Networks IEEE Journal On Selected Areas in Communications, 8(3):368-379, April 1990.
40 E. W. Knightly and H. Zhang, “D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic,” IEEE ACM Transactions on Networking, vol. 5, Issue 2, pp. 219- 231, April 1997.
41 Lie Qian , Anand Krishnamurthy , Yuke Wang , Yiyan Tang , Philippe Dauchy , and Alberto Conte “A New Traffic Model and Statistical Admission Control Algorithm for Providing QoS Guarantees to On-Line Traffic” IEEE Communications Society Globecom 2004
 
 
 
 
 
 
 
 
Ahmed M. Mohammed : Colleagues
Adel F. Agamy : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.