Preview

Courseinfo

Powerful Essays
Open Document
Open Document
136227 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Courseinfo
The ns Manual (formerly ns Notes and Documentation)1
The VINT Project A Collaboration between researchers at UC Berkeley, LBL, USC/ISI, and Xerox PARC. Kevin Fall kfall@ee.lbl.gov , Editor Kannan Varadhan kannan@catarina.usc.edu , Editor

November 4, 2011

ns c is LBNL’s Network Simulator [24]. The simulator is written in C++; it uses OTcl as a command and configuration interface. ns v2 has three substantial changes from ns v1: (1) the more complex objects in ns v1 have been decomposed into simpler components for greater flexibility and composability; (2) the configuration interface is now OTcl, an object oriented version of Tcl; and (3) the interface code to the OTcl interpreter is separate from the main simulator. Ns documentation is available in html, Postscript, and PDF formats. See http://www.isi.edu/nsnam/ns/ns-documentation. html for pointers to these.

1 The VINT project is a joint effort by people from UC Berkeley, USC/ISI, LBL, and Xerox PARC. The project is supported by the Defense Advanced Research Projects Agency (DARPA) at LBL under DARPA grant DABT63-96-C-0105, at USC/ISI under DARPA grant ABT63-96-C-0054, at Xerox PARC under DARPA grant DABT63-96-C-0105. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the DARPA.

Contents
1 2 Introduction Undocumented Facilities 12 16

I
3

Interface to the Interpreter
OTcl Linkage 3.1 Concept Overview . . . . . . . . . . . . . . . . . . . . 3.2 Code Overview . . . . . . . . . . . . . . . . . . . . . . 3.3 Class Tcl . . . . . . . . . . . . . . . . . . . . . . . . . 3.3.1 Obtain a Reference to the class Tcl instance . . . 3.3.2 Invoking OTcl Procedures . . . . . . . . . . . . 3.3.3 Passing Results to/from the Interpreter . . . . . . 3.3.4 Error Reporting and Exit . . . . . . . . . . . . . 3.3.5 Hash Functions within the Interpreter . . . . . . 3.3.6 Other Operations on the Interpreter . . . . . . .



Bibliography: [1] C. Alaettino˘ lu, A.U. Shankar, K. Dussa-Zeiger, and I. Matta. Design and implementation of MaRS: A routing testbed. g Internetworking: Research and Experience, 5:17–41, 1994. [2] Sandeep Bajaj, Lee Breslau, Deborah Estrin, Kevin Fall, Sally Floyd, Padma Haldar, Mark Handley, Ahmed Helmy, John Heidemann, Polly Huang, Satish Kumar, Steven McCanne, Reza Rejaie, Puneet Sharma, Kannan Varadhan, Ya Xu, Haobo Yu, and Daniel Zappala. Improving simulation for network research. Technical Report 99-702b, University of Southern California, March 1999. (revised September 1999). [3] Paul Barford and Mark Crovella. Generating representative web workloads for network and server peformance evaluation. In Proceedings of the ACM SIGMETRICS, pages 151–160, June 1998. [4] L.S. Brakmo, S. O’Malley, and L.L. Peterson. TCP vegas: New techniques for congestion detection and avoidance. In Proceedings of the ACM SIGCOMM, pages 24–35, October 1994. [5] L.S. Brakmo, S. O’Malley, and L.L. Peterson. TCP vegas: New techniques for congestion detection and avoidance. Technical Report TR 94 04, Department of Computer Science, The University of Arizona, Tucson, AZ 85721, February 1994. [6] R. Brown. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM, 31(10):1220–1227, October 1988. [7] Pei Cao and Chengjie Liu. Maintaining strong cache consistency in the World-Wide Web. In Proceedings of the IEEE ICDCS, pages 12–21, May 1997. [8] N. Christin, J. Liebeherr, and T. Abdelzaher. A quantitative assured forwarding service. In Proceedings of IEEE INFOCOM 2002, volume 2, pages 864–873, New York, NY, June 2002. [9] S. Deering, D. Estrin, D. Farinacci, V. Jacobson, Ching-Gung Liu, and L. Wei. An architecture for wise-area multicast routing. Technical Report USC-SC-94-565, Computer Science Department, University of Southern California, Los Angeles, CA 90089., 1994. [10] Anja Feldmann, Anna C. Gilbert, Polly Huang, and Walter Willinger. Dynamics of IP traffic: A study of the role of variability and the impact of control. pages 301–313, Cambridge, MA, USA, August 1999. [11] S. Floyd, V. Jacobson, C. Liu, S. McCanne, and L. Zhang. A reliable multicast framework for light-weight sessions and application level framing. In Proceedings of the ACM SIGCOMM, pages 342–356, August 1995. [12] H. T. Friis. A note on a simple transmission formula. Proc. IRE, 34, 1946. [13] H. W. Hethcote. The mathematics of infectious diseases. SIAM Review, 42(4):599–653, October 2000. [14] A. Heybey. Netsim Manual. MIT, 1989. [15] R. Jain. The Art of Computer Systems Performance Analysis. John Wiley and Sons, Inc., 1996. [16] Pierre L’Ecuyer. Good parameters and implementations for combined multiple recursive random number generators. Operations Research, 47(1):159–164, 1999. 432 [17] Pierre L’Ecuyer. Software for uniform random number generation: Distinguishing the good and the bad. In Proceedings of the 2001 Winter Simulation Conference, pages 95–105, December 2001. [18] Pierre L’Ecuyer, Richard Simard, E. Jack Chen, and W. David Kelton. An object-oriented random number package with many long streams and substreams. Operations Research, 2001. [19] A. Legout and E.W. Biersack. PLM: Fast convergence for cumulative layered multicast transmission schemes. In Proceedings of the ACM SIGMETRICS, Santa Clara, CA, U.S.A., June 2000. [20] J. Liebeherr and N. Christin. JoBS: Joint buffer management and scheduling for differentiated services. In Proceedings of IWQoS 2001, pages 404–418, Karlsruhe, Germany, June 2001. [21] J. Liebeherr and N. Christin. Rate allocation and buffer management for differentiated services. Computer Networks, 40(1):89–110, September 2002. [22] M. Mathis and J. Mahdavi. Forward acknowledgement: Refining TCP congestion control. In Proceedings of the ACM SIGCOMM, August 1996. [23] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanov. TCP Selective Acknowledgement Options, RFC 2018 edition, 1996. [24] S. McCanne and S. Floyd. ns—Network Simulator. http://www-mash.cs.berkeley.edu/ns/. [25] S. McCanne and V. Jacobson. The bsd packet filter: A new architecture for user-level packet capture. pages 259–269, January 1993. [26] John Ousterhout. Scripting: Higher-level programming for the 21st century. IEEE Computer, 31(3):23–30, March 1998. [27] S.K. Park and R.W. Miller. Random number generation: Good ones are hard to find. Communications of the ACM, 31(10):1192–1201, October 1988. [28] Peter Pieda, Jeremy Ethridge, Mandeep Baines, and Farhan Shallwani. A Network Simulator, Differentiated Services Implementation. Open IP, Nortel Networks, 2000. [29] T. S. Rappaport. Wireless communications, principles and practice. Prentice Hall, 1996. [30] Kah Leong Tan and Li-Jin Thng. Snoopy calendar queue. In Proceedings of the 32nd conference on Winter simulation Orlando, Florida, pages 487–495, 2000. [31] D. Waitzman, C. Partridge, and S.E. Deering. Distance Vector Multicast Routing Protocol, RFC 1075 edition, 1988. [32] Xiaoliang (David) Wei. A mini-tutorial for TCP-Linux in NS-2. http://netlab.caltech.edu/projects/ns2tcplinux/. [33] Xiaoliang (David) Wei and Pei Cao. NS-2 TCP-Linux: an NS-2 TCP implementation with congestion control algorithms from Linux. In WNS2 ’06: Proceeding from the 2006 workshop on ns-2: the IP network simulator, page 9, New York, NY, USA, 2006. ACM Press. 433

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Cited: Solomon, M., & Kim, D. (2013). Fundamentals of Communications and Networking. Burlington: Jones & Bartlett Learning.…

    • 304 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    NT1210 Mid-Term Exam Study Sheet Chapter 1 1.Kilobye (KB), Megabyte(MB),Gigabyte(GB), Terabyte (TB) –Approx. number of bytes in each 2.Capacitor charge to represent 0 or1 3. Convert binary to decimal 4.Hexadecimal 5.Disk drive – platters, tracks, sectors Chapter 2 6.Digital voice calls 7.Video compression 8.Web address – identify protocol, server, web page 9.Internet core 10.Device drivers 11.Network topologies Chapter 3 12.Networking standards 13.De Facto standard 14.TCP/IP model 15.OSI model 16.Routers role in network 17.…

    • 720 Words
    • 7 Pages
    Satisfactory Essays
  • Satisfactory Essays

    OMNeT++ was designed to support network simulation on a large scale. It consists of modules that communicate with message passing. The active modules are the simple modules which are written in C++ using the simulation class library. Simple modules can be grouped into compound modules. Messages are sent via connections that span the modules or directly to their destination modules. The simple and compound modules are instances of module types. The user creates a system module as a network module which is a special compound module without gates to the external world. These modules can be reused with the help of model frameworks like INET framework and Mobility framework.…

    • 450 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    nt1210 unit 1 lab1

    • 1325 Words
    • 5 Pages

    8. The TCP/IP and OSI models have some obvious differences, like the number of layers. Think about the more commonly used version of the TCP/IP model discussed in this chapter, and then think about how to talk about TCP/IP using OSI…

    • 1325 Words
    • 5 Pages
    Good Essays
  • Powerful Essays

    The 5-layer model serves essentially the protocols regarded as Transmission Control Protocol (TCP) as well as Internet Protocol (IP), or mutually, TCP/IP. The User Datagram Protocol (UDP) is likewise served by this particular model. The 5-layer model was produced alongside with these protocols, anteceding the 7-layer model, and is from time to time known as the TCP Model.…

    • 1263 Words
    • 5 Pages
    Powerful Essays
  • Powerful Essays

    Nt1330 Unit 5 Lab 1 Answers

    • 4778 Words
    • 20 Pages

    Internetworking Basics Internetworking Models The OSI Reference Model Summary Exam Essentials Written Labs Review Questions Answers to Review Questions Answers to Written Lab 1.1 Answers to Written Lab 1.2 Answers to Written Lab 1.3…

    • 4778 Words
    • 20 Pages
    Powerful Essays
  • Best Essays

    Tomsho, G., Tittel, E., & Johnson, D. (2004). Guide to Networking Essentials, 4th Edition. Boston, MA: Course Technology. Retrieved March 18, 2008, from University of Phoenix, rEsource, NTC360—Network & Telecommunications Concepts Course Web site.…

    • 2834 Words
    • 12 Pages
    Best Essays
  • Satisfactory Essays

    Netw420 Week 5

    • 526 Words
    • 3 Pages

    References: * Clemm, A. Network Management Fundamentals Edition 1 (1st ed). Pearson Learning Solutions. Retrieved from http://devry.vitalsource.com/books/9781256084068/id/ch02lev2sec9…

    • 526 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    issues in CRNs, with the objective of satisfying the interference constraints, and maximizing the number…

    • 8009 Words
    • 33 Pages
    Good Essays
  • Powerful Essays

    Lab 12

    • 3059 Words
    • 13 Pages

    In this lab you will use the Wireshark packet analyzer to capture and display the control information and data stored in packets transmitted over a network. Wireshark collects network traffic data and creates files that display packet header information in a layered format like that used by the Internet model. These layers can be expanded to view details that may prove helpful in determining the source of problems that your network might be experiencing. Creating filters that hide unwanted data and facilitate data analysis will also be discussed in this lab.…

    • 3059 Words
    • 13 Pages
    Powerful Essays
  • Powerful Essays

    Type of Service (ToS), now known as Distinguished Services Code Point (DSCP) (usually set to 0, but may specify exact Quality of Service requirements from the network, the DSCP describes the way routers would queue packets although they are waiting to be progressed). Time To Live (Amount of hops /associations which the packet could be routed over, decremented by utmost routers - used to stop unplanned routing loops). Protocol (Service Access Point (SAP) which specifies the kind of transport packet being supported (e.g. 1 = ICMP; 2= IGMP; 6 = TCP; 17= UDP). (IPv4 Packet Header, n.d.)…

    • 1621 Words
    • 7 Pages
    Powerful Essays
  • Better Essays

    References: Comer, D. E. (2009, 2009,2004,2001,1999,1997). Computer Networks And Internets (5th ed.). Upper Saddle River, New Jersey: Pearson Education, Inc.…

    • 1195 Words
    • 5 Pages
    Better Essays
  • Powerful Essays

    Activity 1.7.1

    • 1271 Words
    • 6 Pages

    Throughout the course you will be using a standard lab setup created from actual PCs, servers, routers, and switches to learn networking concepts. This method provides widest range of features and the most realistic experience. Since equipment and time are limited, this experience can be supplemented by a simulated environment. The simulator that is used in this course is Packet Tracer. Packet Tracer provides a rich set of protocols, equipment, and features but only a fraction of what is possible with real equipment. Packet Tracer is a supplement to not a replacement for experience with real equipment. You are encouraged to compare the results obtained from Packet Tracer network models with the behavior of real equipment. You are also encouraged to examine the Help files built into Packet Tracer, which include an extensive "My First PT Lab", tutorials, and information on the…

    • 1271 Words
    • 6 Pages
    Powerful Essays
  • Satisfactory Essays

    This foundational course covers local area network topics including rationale for networking, the open systems interconnection (OSI) model, common network topologies and architecture, client/server concepts, basic hardware devices and usage, and basic networking security concepts.…

    • 2224 Words
    • 9 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Realistic Broadcast Protocol Handler (RBPH) is a departure from previous end to end reliable protocols that exploit Internet Multicast. It has both end system and router elements to the protocol. This is an attempt to overcome the scaling problems of protocol reliability techniques (ACK or NAK, retransmission) when operating them over intermittently lossy IP Networks. RBPH is targeted at one to many applications, but of course could be used for many to many simply by using multiple sessions.…

    • 267 Words
    • 2 Pages
    Satisfactory Essays