SHKEMBIMI I INFORMACIONIT SWITCHING SHTRESA E RRJETIT • TRANSMETIM NGA BURIMI NE DESTINACION ◼ ◼ KALON ROUTERA MERR NE KONSIDERATE DESTINACIONIN • TOPOLOGJIA E RRJETIT ◼ ◼ ROUTERS, LINKS GJEN RRUGEN E PERSHTATESHME PRINCIPET E PROJEKTIMIT ◼ ◼ SHERBIMET NDAJ TRANSPORTIT STRUKTURA E BRENDESHME STORE AND FORWARD PACKET SWITCHING ◼ BUFERIZIM NE ROUTER – DERI NE MBERRITJE NE ROUTERIN TJETER SHERBIMET ◼ PRINCIPET • TE PAVARURA NGA TEKNOLOGJIA E ROUTERIT • SHTRESA E TRANSPORTIT – IZOLUAR NGA NUMRI/LLOJI/TOPOLOGJIA E ROUTERAVE • ADRESAT E RRJETIT – STRUKTURE UNIFORME NE LAN/WAN LLOJI I SHERBIMIT? ◼ CONNECTION-ORIENTED apo CONNECTIONLESS • CONNECTIONLESS – RRJET I PASIGURTE (INTERNETI) – ERROR CONTROL/FLOW CONTROL • CONNECTION ORIENTED –QoS ◼ ◼ X.25, FRAME RELAY, IP, ATM, INTERNET – zhvillon CONNECTIONORIENTED FEATURES – QoS--MPLS, VLANS NDERTIMI I NETORK LAYER ◼ ◼ ◼ DY SHERBIME I OFROHEN USER-it CONNECTIONLESS CONNECTION-ORIENTED CONNECTIONLESS ◼ ◼ ◼ ◼ PAKETAT INJEKTOHEN INDIVIDUALISHT NE RRJET RRUGEZOHEN INDIVIDUALISHT PAKETAT – DATAGRAMS RRJETI – DATAGRAM NETWORK CONNECTION ORIENTED ◼ ◼ ◼ VENDOSET PATH-i VLC (Virtual circuit) Virtual circuit network DATAGRAMs CONNECTION ORIENTED ◼ ◼ ◼ VIRTUAL CIRCUIT NETWORK VENDOSET PATH-i BURIM DESTINACION CDO PAKETE PERMBAN IDENTIFKUESIN E VLC VLC LABEL SWITCHING ◼ MPLS • PERDORET BRENDA ISP PER INTERNET ME PAKETA IP ME MPLS LABEL – 20 BIT IDENTIFIKUES KONEKSIONI VLC vs DATAGRAM TRADE-OFF ◼ SETUP TIME vs ADDRESS PARSING TIME • PROCEDURE PER TE GJETUR DESTINACIONIN ◼ ◼ ◼ ◼ ADRESAT DESTINACION ME TE MEDHA SE VLC NUMBER PERMASA E TABELES SE RRUGEZIMIT QoS ROUTER CRASH ALGORITMI I RRUGEZIMIT ◼ DETYRE E NETWORK LAYER • ALGORITMET E RRUGEZIMIT DHE STRUKTURA E TE DHENAVE ◼ PERCAKTON LINJEN DALESE • DATAGRAM – PER CDO PAKETE • QARKU VIRTUAL – ON SETUP ◼ SESSION ROUTING (VPN) FORWARDING vs ROUTING ◼ ◼ ARDHJA E PAKETES – PERCAKTIMI I LINJES DALESE – FORWARDING FILLING/UPDATING ROUTING TABLES – ROUTING ALGORITHM ROUTING - VETITE ◼ ◼ ◼ ◼ ◼ ◼ correctness, simplicity, robustness, - perballon problemet ne rrjet stability, - konvergon shpejt fairness, efficiency DY KLASAT E RRUGEZIMIT ◼ NONADAPTIVE ALGORITHMS • NUK BAZOHEN NE TOPOLOGJINE AKTUALE DHE TRAFIKUN • STATIC ROUTING • RRUGEZIME TE QARTA ◼ ADAPTIVE ALGORITHMS • REFLEKTOJNE NDRYSHIMET NE TOPOLOGJI DHE TRAFIK • DYNAMIC ROUTING PRINCIPI I OPTIMALITETIT ◼ ◼ ◼ ◼ RRUGA I-K OPTIMALE ROUTERI J NDERMJET I DHE K RRUGA J-K OPTIMALE RRJEDHIM • RRUGET OPTIMALE NGA TE GJITHA BURIMET NE NJE SINK – SINK TREE • ALGORITMI DUHET TE PERCAKTOJE/PERDORE SINK TREES FOR ALL ROUTERS SINK TREES DAG ◼ ◼ ◼ SINK TREES NUK JANE UNIKE – ME TE NJEJTIN NUMER HOPESH TE GJITHA PEMET – GRAF JOCIKLIK I DREJTUAR PEMET NUK INTERFEROJNE – TRAFFIC JAM SHORTEST PATH ALGORITHM ◼ ◼ NDERTOHET GRAFI I RRJETIT PERCAKTOHET SHORTEST PATH • NUMBER OF HOPS, • GEOGRAPHIC DISTANCE • MEAN DELAY FOR STANDARD TEST PACKETS • ETIKETAT NE NYJE FUNKSION I DISTANCES, BANDWIDTH, AVERAGE TRAFFIC, DELAY, COST …. DIJKSTRA ◼ ◼ FILLIMISH NYJET ETIKETOHEN INFINIT ETIKETA TENTATIVE/PERMANENT SHEMBULL FLOODING ◼ ◼ ◼ CDO ROUTER MERR VENDIME BAZUAR VETEM NE INFORMACIONIN LOKAL CDO PAKETE NE HYRJE DERGOHET NE TE GJITHA LINJAT DALESE PRODHOHET NJE NUMER SHUME I MADH PAKETASH TE DUBLIKUARA • PENGIM I PROCESIT METODAT E NDALIMIT TE FLOODING ◼ ◼ HOP COUNTER NE HEADER TE PAKETES INICIALIZOHET ME GJATESINE NGA BURIMI NE DESTINACION • WORST CASE – FULL DIAMETER OF NETWORK • DUPLIKOHEN PAKETA TE TRANSMETUARA ME PARE METODAT E NDALIMIT TE FLOODING ◼ ◼ ◼ GJURMON PAKETAT E DERGUARA ME PARE NUK I RIDERGON PAKETAT E DERGUARA ME PARE ROUTER-i BURIM VENDOS NUMER SEKUENCIAL NE CDO PAKETE RENDESIA E FLOODING ◼ CDO PAKETE DERGOHET TEK CDO NYJE E RRJETIT • EFEKTIVE NE BROADCASTING ◼ ALGORITEM ROBUST • GJEN TE PAKTEN NJE RRUGE NESE SHUME ROUTERS JANE DOWN • KERKON PAK SETUP – VETEM FQINJET • GJEN RRUGEN ME TE SHKURTER • METRIKE PER ALGORITMET E TJERA DISTANCE VECTOR ROUTING ◼ DYNAMIC ROUTING ALGORITHMS • DISTANCE VECTOR ROUTING • LINK STATE ROUTING DISTANCE VECTOR ROUTING ◼ CDO ROUTER – TABELE • BEST DISTANCE TO EACH DESTINATION • LINKUN PER TE SHKUAR NE DESTINACION ◼ ◼ TABELAT UPDATE-HEN DUKE SHKEMBYER INFORMACION ME ROUTERAT FQINJE BELLMAN-FORD -- RIP DVR ◼ ◼ ◼ CDO ROUTER – TABELE INDEKSUAR, ENTRY PER CDO ROUTER ENTRY – DY PJESE: • PREFERRED OUTGOING LINE FOR THE DESTINATION • ESTIMATE DISTANCE TO DESTINATION ◼ HOPS, MSECs, ETC VLERESIMI I DISTANCES ◼ ROUTER-i DI DISTANCEN NGA SECILI FQINJ • HOPs - NJE HOP NGA CDO FQINJ • DELAY – PAKETA ECHO ◼ ◼ ◼ ROUTERs SHKEMBEJNE TABELAT NDERMJET TYRE PER TE SHKUAR TEK ROUTER i DUHEN Xi + m APLIKOHET PER CDO ROUTER – BEST ESTIMATE SHEMBULL ◼ DISTANCA E J NGA G? (18ms) COUNT TO INFINITY PROBLEM ◼ ◼ ◼ ◼ VENDOSJA E ROUTERs NE BEST PATHS – CONVERGENCE DVR – SIMPLE TECHNIQUE – DRAWBACK – CONVERGES SLOWLY REAGON SHPEJT TO GOOD NEWS NGADALE NE BAD NEWS SHEMBULL ◼ ◼ ◼ INFINITY – LONGEST PATH + 1 RFC 1058 X TELLS Y – KA NJE PATH, Y NUK E DI QE ESHTE NE PATH LINK STATE ROUTING ◼ ◼ ◼ ◼ ◼ ◼ ◼ PROBLEMI KRYESOR I DVR– KONVERGJENCA (COUNT-TOINFINITY) 5 HAPA 1. Discover its neighbors and learn their network addresses. 2. Set the distance or cost metric to each of its neighbors. 3. Construct a packet telling all it has just learned. 4. Send this packet to and receive packets from all other routers. 5. Compute the shortest path to every other router. Learning about the Neighbors ◼ ◼ ◼ ROUTER-i NE BOOT – DERGON HELLO NDAJ FQINJEVE CDO ROUTER – EMER UNIK LIDHJA NE BROADCAST E ROUTERs • -DESIGNATED ROUTER Setting Link Costs ◼ COST PER FQINJET • AUTOMATIKISHT • KONFIGURIM NGA OPERATORI I RRJETIT • INVERS PROPORCIONAL ME BANDWIDTH ◼ 1 Gbps –- 1, 100Mbps –10 • RRJETA ME DISTANCA GJEOGRAFIKE – COST METRIC -- ESHTE DELAY ◼ ECHO – KOHA ROUND TRIP/2 Building Link State Packets ◼ ROUTERs NDERTOJNE PAKETAT PER SHKEMBIM • IDENTITETI • NUMER SEKUENCIAL • MOSHA • LISTA E FQINJEVE + COST Distributing the Link State Packets ◼ ◼ TRICIKING PART LINK STATE PACKETS: • QUICKLY • RELIABLY • DIFFERENT VERSIONs OF TOPOLOGY – LOOPS, UNREACHABLE MACHINES, … ◼ SHPERNDARJA E PAKETAVE FLOODING FLOODING CHECK ◼ ◼ NUMRI SEKUENCIAL I PAKETES INKREMENTOHET PER CDO PAKETE TE RE TE DERGUAR ROUTERs KONTROLLOJNE (SOURCE ROUTER, SEQUENCE) • NEW SEQUENCE – FORWARD • OLD SEQUENCE – DISCARD • SEQUENCE LOWER THAN THE HIGHEST ONE - REJECT PROBLEMATIKA ◼ ◼ ◼ ◼ NUMRI SEKUENCIAL – WRAP AROUND – 32 BIT ROUTER CRASH – LOOSE TRACK OF SEQUENTIAL NUMBER – FILLON NGA 0 – PAKETA REJECT DEMTIM I NUMRIT SEKUENCIAL – PAKETE OBSOLETE ZGJIDHJA – AGE OF PACKET • DEKREMENTIM CDO SEKONDE PERMIRESIME TE ALGORITMIT ◼ ◼ PAKETAT NUK DERGOHEN MENJEHERE NESE VJEN PAKETE NGA I NJEJTI BURIM – KRAHASOHEN NUMRAT SEKUENCIALE: • TE NJEJTA – DUPLIKATA FSHIHET • TE NDRYSHME – ME VJETRA FSHIHET ◼ TE GJITHA PAKETAT ACKNOWLEDGMENT SHEMBULL ◼ ◼ PAKETA E VJEN – EAB, EFB NESE VJEN KOPJE – NDRYSHOJNE BITET – KOPJE C NGA F – BITET NDRYSHOJNE NE 100011 Computing the New Routes ◼ ◼ ◼ ◼ ROUTERs NJOHIN TOPOLGJINE E RRJETIT CDO LINK PARAQITET 2 HERE – 2 DREJTIME 2 DREJTIMET MUND TE KENE KOSTO TE NDRYSHME DIJKSTRA PER TE GJETUR SHORTEST PATH LSR vs DVR ◼ ◼ MORE MEMORY, MORE COMPUTATION PER n ROUTERS, k FQINJE SECILI • MEMORJA PROPORCIONALE ME kn • KOHA RRITET KUNDREJT kn ◼ LSR WORKS WELL, NO SLOW CONVERGENCE LSR IMPLEMENTATIONS ◼ IS –IS (Intermediate System-Intermediate System) • MODIFIKUAR PER TE PERDORUR IP ◼ OSPF (Open Shortest Path First) • PERMIRESIMET E IS-IS ◼ ◼ ◼ ◼ ◼ SELF-STABILIZING FOR FLOODING DESIGNATED ROUTER ON LAN PATH SPLITTING MULTIPLE METRICS IS-IS BART INFORMACIONIN NE MULTI PROTOCOLS, OSPF NOT PROBLEME ◼ ◼ ◼ HW or SW DEKLARON NJE LINK QE NUK E KA HARRON NJE LINK QE E KA • INCORRECT GRAPH ◼ ◼ ◼ FAIL TO FORWARD PACKETS CORRUPT PACKETS RUN OUT OF MEMORY RRUGEZIMI HIERARKIK ◼ RRITJA E NUMRIT TE ROUTERS – • RRITJE E PERMASES SE TABELES SE RRUGEZIMIT ◼ ◼ ◼ ◼ ◼ KONSUM MEMORIE CIKLE CPU RRIT BANDWIDTH PER SHKEMBIM TABELASH NUK MUND TE RRITET PA FUND RRUGEZIM HIERARKIK STRUKTURA ◼ ◼ ◼ GRUPIM NE REGIONS ROUTER NJEH ROUTERS NE REGIONIN E TIJ DHE REGIONET E TJERA JO STRUKTURAT E BRENDESHME TE TYRE NIVELET E HIERARKISE ◼ ◼ ◼ DY NIVELE HIERARKIE NUK JANE TE MJAFTUESHEM REGIONS – CLUSTERS – ZONES – GROUPS - …… BERKELEY (CALIFORNIA ) – MALINDI (KENYA) • LOS ANGELOS, NEW YORK, NAYROBI SHEMBULL RRITET GJATESIA E RRUGES (1A – 5C) NUMRI I NIVELEVE ◼ ◼ ◼ 720 ROUTERS PA HIERARKI – TABELA 720 REKORDE 24 REGIONS – 30 ROUTERS SECILI • 30 + 23 ◼ 8 CLUSTERS – 9 REGIONS – 10 ROUTERS • 10 + 8 (REGIONS) + 7 (CLUSTERS) ◼ OPTIMAL lnN BROADCAST ROUTING ◼ ◼ DERGIM I NJEKOHSHEM I PAKETAVE NE RRJET ROUTER DERGON PAKETA TE VECANTA NE CDO DESTINACION • WASTE BANDWIDTH, SLOW, COMPLETE LIST OF DESTINATIONS MULTIDESTINATION ROUTNG ◼ ◼ PAKETA PERMBAN LISTEN E DESTINACIONEVE CDO ROUTER I NDERMJETEM PERCAKTON LINJAT DALESE PER FORWARD • SHFRYTEZIM ME I MIRE I BANDWIDTH • KERKON NJOHJE TE DESTINACIONEVE FLOODING ◼ EFIKAS NE BROADCAST • RREGULL I THJESHTE • PERCAKTON SHORTEST PATH REVERSE PATH FORWARDING ◼ ◼ ◼ ◼ ARDHJA E NJE PAKETE BROADCAST – MUND TE DERGOHEN PAKETA DREJT BURIMIT ? PAKETA PERCAKTON BEST ROUTE – PAKETA E PARE QE MBERRIN NE ROUTER ROUTER-i FORWARD PAKETAT NE LINJAT E TJERA DUPLIKIM PAKETE - DISCARD SHEMBULL ◼ ◼ PREFERRED PATH – CIRCLE AROUND LETTER 5 HOPE/24 PAKETA --- 4 HOPE/14 PAKETA REVERSE PATH FORWARDING ◼ ◼ ◼ ◼ ◼ METODE EFIKASE LEHTESISHT E IMPLEMENTUESHME PAKETA DERGOHET VETEM NJE HERE NE CDO LINK DUHET TE NJOHE SI TE ARRIJE DESTINACIONET NUK MEMORIZON NUMRAT SEKUENCIALE TE PAKETAVE REVERSE + SINK TREE ◼ ◼ ◼ ◼ ◼ PERDOR SINK TREE (SPANNING TREE) NO LOOPS PERDORIM OPTIMAL I BANDWIDTH GJENERON NUMRIN MINIMAL TE PAKETAVE DUHET TE NJIHEN SPANNING TREE • NE LSR NJIHET TOPOLOGJIA • NE DVR NUK NJIHET TOPOLOGJIA MULTICAST ROUTING ◼ ◼ DERGON PAKETA SHUME USERS DERGON PAKETE PER CDO PERDORUES • EXPENSIVE • BROADCASTING ◼ ◼ JO E PERSHTATESHME PER GRUPE TE VEGJEL NE RRJET TE MADH INFORMACIONI NUK DUHET DERGUAR TEK TE GJITHE ROUTERS MULTICAST ROUTING ◼ ◼ ◼ ◼ KRIJIM/ELEMINO GRUPIN IDENTIFIKOHEN ROUTERS NE GRUP ROUTERS NJOHIN GRUPIN KU BEJNE PJESE Si realizohet ????? MULTICAST SCHEMES ◼ ◼ ◼ DERGOJNE PAKETA NEPERMJET SPANNING TREEs SHFRYTEZIM EFIKAS TE BREZIT BEST SPANNING TREE VARET NGA DENSITETI I GRUPIT • MARRESAT PERBEJNE PJESEN ME TE MADHE TE RRJETIT • PJESE TE VOGEL NE RRJET DENSITETI I GRUPIT ◼ GRUPI I DENDUR • BROADCAST • REDUKTIM (HEQJE) E LINK-EVE QE NUK JANE NE GRUP • PRUNE BROADCAST SPANNING TREE SHEMBULL PRUNE SPANNING TREE NDERTIMI ◼ ◼ ◼ DISA MENYRA ME E THJESHTA – LSR + TOPOLOGJIA E RRJETIT CDO ROUTER NDERTON SPANNING TREE TE TIJ • DUKE NDERTUAR SINK TREE – LINK-et E NON GROUP ROUTERS • MOSPF ( MULTICAST OSPF) SPANNING TREE ME DVR ◼ ◼ ◼ ◼ MENYRA TE NDRYSHME SIMPLEST – REVERSE PATH FORWARDING ROUTERS JO PJESE E GRUPIT – PERGJIGJEN ME PRUNE MESSAGE – MOS DERGO ME MULTICAST MESSAGES DVMRP (DISTANCE VECTOR MULTICAST ROUTING PROTOCOL) DVMRP - DISAVANTAZH ◼ ◼ LOT WORK TO – SIDOMOS NE LARGE NETWORKS SHEMBULL • n GRUPE ME m ROUTERS MESATARISHT • CDO ROUTER MEMORIZON m SPANNING TREES • TOTAL nm SPANNING TREES TE MEMORIZUARA CORE-BASED TREE ◼ ◼ ◼ SINGLE SPANNING TREE PER CDO ROUTER TE GJITHE ROUTERS BIEN DAKORT PER ROOT (CORE or RENDEZVOUS POINT) OPTIMIZIM – PAKETAT NUK SHKOJNE NE ROOT KUR KEMI MULTICAST SHEMBULL ANYCAST ROUTING ◼ ◼ PAKETA SHKON TEK NEAREST MEMBER OF THE GROUP SKEMA E RRUGEZIMIT – DVR OSE LSR Routing for Mobile Hosts ◼ ◼ ◼ PERDORIMI I KOMPJUTERAVE NE LEVIZJE MOBILE HOST ROUTE A PACKET TO A MOBILE HOST – RRJETI FILLIMISHT DUHET TA GJEJE ATE PERMANENT ADDRESS ◼ ◼ ◼ SUPOZIM – PERMANENT HOME LOCATION – NUK NDRYSHON RECOMPUTE NEW ROUTES – TOPOLOGY CHANGES • NUMER I MADH MOBILE HOSTS – SHUME LLOGARITJE PROVIDE MOBILITY ABOVE NETWORK LAYER • NEW INTERNET ADDRESS – RELOGIN TO SKYPE • HOST IS MOVING? HOME AGENT ◼ ◼ ◼ TELL HOST AT HOME WHERE IT IS NOW FORWARD PACKET TO MOBILE HOST LOCAL ADDRESS –CARE OF ADDRESS TRIANGLE ROUTING TRIANGLE ROUTING ◼ ◼ ◼ ◼ ENCAPSULATES PACKETS WITH A NEW HEADER TUNNELING HUMBJA E LIDHJES – HOME AGENT I USED TO REACH MOBILE SECURITY ??? • SECURITY INFORMATION IS INCLUDED – TO BE VERIFIED BY CRYPTOGRAPHIC PROTOCOLS ROUTING IN AD HOC NETWORKS ◼ ◼ ◼ ◼ ◼ MOBILE HOSTS + FIXED ROUTERS ROUTERS ARE MOBILE ??? NYJET KOMUIKOJME ME WIRELESS – JANE EDHE HOST EDHE ROUTER RRJETI I NYJEVE QE JANE PRANE – MANET (MOBILE AD HOC NETWORKS) TOPOLOGJIA E RRJETIT NDRYSHON MANET ◼ ◼ ◼ ◼ NDRYSHON NUMRI I NYJEVE NDRYSHON TOPOLOGJIA ME SFIDUES SE RRJETAT FIKSE SHUME ALGORITMA RRUGEZIMI • PAK ZBATUESHMERI NE PRAKTIKE • CILET PROTOKOLLE JANE ME EFIKASE ? AODV ◼ DVR PER MANET • NYJE ME BANDWIDTH TE KUFIZUAR • BATERI ◼ ◼ ROUTE DISCOVERY ROUTE MAINTENANCE ROUTE DISCOVERY ◼ ◼ ◼ ROUTE TO DESTINATION – ON DEMAND TOPOLOGJIA PERSHKRUHET SI GRAF RRJETAT REALE – ME TE KOMPLIKUARA • NDERTESA, PENGESA, • KOMUNIKIMI I A ME B DHE B ME A – FUQI TE NDRYSHME? SHEMBULL ◼ ◼ ◼ ◼ “A” DERGON PAKETE “I” DVR NE CDO NYJE “A” NUK E NJEH “I” – ON DEMAND ROUTE REQUEST – FLOODING – ROUTE REPLY TTL ◼ ◼ ◼ ◼ NE RRJETA TE MEDHA – BROADCAST EDHE CLOSED DESTINATIONS TO REDUCE OVERHEAD “TIME TO LIVE” – REDUKTOHET NE CDO HOP – 0 – DISCARD PER TE GJETUR DESTINACIONIN – TIME TO LIVE 1, 2, 3, …. ROUTE MAINTENANCE ◼ ◼ ◼ TOPOLOGJIA E RRJETIT NDRYSHON “G” SWITCH OFF – RRUGA ADGI NOT VALID CDO NYJE PERIODIKISHT DERGON MESAZH “HELLO” • NO RESPONSE – NODE IS OFF • HEQ RRUGET QE NUK JANE DISPONIBEL • RUTERAT SHKEMBEJNE MESAZHE – PASTROJNE TABELAT COUNT TO INFINITY PROBLEM ◼ ◼ DVR – SLOW CONVERGENCE PAS NDRYSHIMIT TE TOPOLOGJISE RAPID CONVERGENCE – NUMER SEKUENCIAL QE KONTROLLOHET NGA DESTINACIONI • DERGUESI VENDOS LAST SEQUENCE NUMBER NE CDO “ROUTE REQUEST” • INKREMENTOHET NE CDO “ROUTE REPLY” ON DEMAND ◼ INTERMEDIATE NODES RUAJNE VETEM NYJET QE JANE AKTIVE • INFORMACIONET E TJERA - TIME OUT ◼ ◼ KURSIM – BANDWIDTH DHE BATERI ROUTE OVERLAP • “B” KOMUNIKON ME “I” ALGORITME TE TJERA ◼ ◼ DSR - DYNAMIC SOURCE ROUTING GPSR – GREEDY PERIMETER STATELESS ROUTING • NJIHEN POZICIONET GJEOGRAFIKE TE NYJEVE CONGESTION CONTROL ALGORITHMS ◼ ◼ ◼ ◼ SHUME PAKETA – NE (PJESE) RRJET • VONESE • HUMBJE • ULJE TE PERFORMANCES • DYNDJE PERGJEGJES – NETWORK, TRANSPORT LAYERS SHTRESA E RRJETIT – CFARE DUHET BERE ME PAKETAT E TEPERTA? ZGJIDHJA - UL NGARKESEN NE RRJET??? CONGESTION CONGESTION COLLAPSE ◼ ◼ ◼ VONESE E PAKETAVE – JO ME TE VLEFSHME – MAX TTL – DELETE RITRANSMETIM I PAKETAVE TE VONUARA – HUMBJE KAPACITETI GOODPUT – SHPEJTESIA E PAKETAVE TE VLEFSHME NE RRJET HOW TO AVOID CONGESTION ◼ ◼ SHTIM I MEMORIES - ???? – GET WORSE – VONESE E PAPRANUESHME – TIME OUT REDUKTIM NGARKESE ose A BETTER NETWORK CONVERGENCE vs FLOW CONTROL ◼ ◼ FLOWCONTROL - SUPERCOMPUTER 1 Gbps – RRJET 100Gbps – SLOW COMPUTER CONGESTION - SHUME KOMPJUTERA KOMUNIKOJNE NJEKOHESISHT APPROACHES FOR CONGESTION CONTROL APPROACHES ◼ ◼ ◼ ◼ ◼ PROVISIONING – UPGRADE ROUTERS/LINES – MONTHS TRAFFIC –AWARE ROUTING – SHPERNDAN TRAFIKUN NE DISA LINJA ADMISSION CONTROL – DECREASE LOAD TRAFFIC THROTTLING SHED – BLACK OUT