Scribd Logo
Importer

Bienvenue sur Scribd !

  • 159.201 Algorithms & Data Structures S1 2015 Assignment 3: Join Leave Front

    Transféré par

    Andrew Creevey
    92 vues1 page
    The document describes a simulation of packet routing through a router with N ports. There are four sources of delay: transmission, nodal processing, propagation, and queueing. The simulation models the router with input and output queues for each port and a shared bus that allows only one packet to be copied to an output queue per clock cycle. The task is to complete the simulation code to calculate the maximum congestion across all output queues at any point during packet routing. The output should print the number of packets for each port when congestion was highest.

    Description originale:

    This is assignment 3 from Programming 201

    Titre original

    Assignment3_S1_2015

    Copyright

    © © All Rights Reserved

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    The document describes a simulation of packet routing through a router with N ports. There are four sources of delay: transmission, nodal processing, propagation, and queueing. The simulation models the router with input and output queues for each port and a shared bus that allows only one packet to be copied to an output queue per clock cycle. The task is to complete the simulation code to calculate the maximum congestion across all output queues at any point during packet routing. The output should print the number of packets for each port when congestion was highest.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    92 vues1 page

    159.201 Algorithms & Data Structures S1 2015 Assignment 3: Join Leave Front

    Transféré par

    Andrew Creevey
    The document describes a simulation of packet routing through a router with N ports. There are four sources of delay: transmission, nodal processing, propagation, and queueing. The simulation models the router with input and output queues for each port and a shared bus that allows only one packet to be copied to an output queue per clock cycle. The task is to complete the simulation code to calculate the maximum congestion across all output queues at any point during packet routing. The output should print the number of packets for each port when congestion was highest.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 1

    159.

    201Algorithms&DataStructures
    S12015
    Assignment3
    ConsiderarouterwithNports.Thereare4importantsourcesofdelays,transmission,nodalprocessing,propagationand
    queueing.Thefirst3formsofdelaydependonthehardwareandlowlevelprotocols.However,the queueingdelayonly
    dependsonthetrafficpattern,i.e.,onhowbusythenetworkisandwhattypeoftrafficisinvolved.Wearegoingtomodel
    ourrouterasperFig.1.Everypackethasaspecificporttogoout(e.g.,blueforport1,orangeforport2etc).
    Notethatthereareinputqueuesandoutputqueues,andthatthebottleneckisdefinedbythetransmissionandpropagation
    delaysofthelinksoftherouter.Transmission,propagationandnodalprocessingarefixedfortherouter.Thethroughputof
    eachlinkis1Gbit/sec,andthenodalprocessingissosmallthatitcanbedisregarded(inrealityitisgoingtotakethetime
    toreadthedestinationofthepacket).Notealsothattherouterhasasharedbusbetweentheinputandoutputports.This
    meansthatonlyonepacketatatimecanleavetheinputqueueandbecopiedtotheappropriateoutputqueue.
    Thesimulationworksbymovingpacketsfrominputqueues(startwith1,then2N,thengobackto1)tooutputqueues
    ateveryclockcycle.Youneedtouse Join(),Leave()andFront()intheappropriatequeues.Aftermovingapacket,a
    globalarrayvariableCongestionSize[N]shouldkeepthestateofalloutputports.Thesevaluesshouldbeupdatedonly
    whenthesum ofall packets islarger thanthecurrent sumof all elements ofCongestionSize[N]. At the end ofthe
    simulation,whenallinputportsareempty,CongestionSize[N]willcontaintheinformationtobeprinted.

    Figure1:Statusoftherouterwhentherouterisatits
    maximumcongestion.
    Yourtaskistocompletethesimulationcode,creatingtheappropriatequeuesandcalculatingwhatwasthemaximum
    congestion(innumberofpackets)inallqueuesatsomepointinthesimulation.YourprogramshouldprintNlineswiththe
    stateofeachoutputqueuewhenthecongestionwasatitspeak.Forexample,supposethatyouhavearouterwithN=3.
    After running the simulation, the output should like this (suppose that the drawing above represents the maximum
    congestion):
    outputport1:3packets
    outputport2:6packets
    outputport3:5packets
    Theinputqueuesarefilledatthestartofthesimulation,readingthevariousinputsfromatextfileatonce.Theformatof
    thefilecontainsinformationabouthowmanypackets,packetsizesetc.Please,usethestartupcodegivenonStreamand
    sticktotheinputformatgivenintheexamples,aswellastheoutputformatgivenabove.Themaximumnumberofports
    usedinthesimulationwillbeN=128,thereforeyoucanuseastaticCongestionSize[N]array.However,queuesshouldonly
    becreatedwhenneeded.Duetothesizeofthequeues,youmustusequeuesimplementedwithlinkedlists(please,donot
    useSTLinthisassignment).
    Useourvirtualmachinetotestyoursubmissions(hostname vm000296). Theinput/outputrequirementsareessential,
    pleasefollowthemcarefullytoavoidlosingmarks.Spacesmatterandtextiscasesensitive.
    Afteryouaresatisfiedwiththeperformanceofyourcodeastestedinthevirtualmachine,submitaonesourcefilecodeon
    StreambyFriday20thofMarch2015.YournameandIDnumbermustappearontopofthefileascomments.Ifyou
    areworkinginagroup,thenallnamesandIDsmustappearontopofthefileascomments,butyoustillneedto submit
    individuallyinboththevirtualmachineandStream.

    Vous aimerez peut-être aussi