Dissertations / Theses: 'Routers'

1

BANTAN, NOUMAN. "A ROUTING PROTOCOL AND ROUTING ALGORITHM FOR SPACE COMMUNICATION." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1172099125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mizrak, Alper Tugay. "Detecting malicious routers." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3274932.

Full text

Abstract:

Thesis (Ph. D.)--University of California, San Diego, 2007.
Title from first page of PDF file (viewed October 10, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 13--140).

APA, Harvard, Vancouver, ISO, and other styles

3

Szczepankiewicz, Peter J. Velazquez Luis E. "Authentication in SAAM routers." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA380178.

Full text

Abstract:

Thesis (M.S. in Information Technology Management) Naval Postgraduate School, June 2000. Peter J. Szczepankiewicz, Luis E. Velazquez.
Thesis advisor(s): Xie, Geoffrey; Buddenberg, Rex. "June 2000." Includes bibliographical references (p. 205-206). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

4

Szczepankiewicz, Peter J., and Luis E. Velazquez. "Authentication in SAAM routers." Thesis, Monterey, California. Naval Postgraduate School, 2000. http://hdl.handle.net/10945/9331.

Full text

Abstract:

Approved for public release, distribution unlimited.
Authentication is particularly important in the SAAM system because SAAM uses mobile codes, called resident agents. These resident agents are loaded onto SAAM routers dynamically, and execute on the destination SAAM router. Mobile code in the SAAM system requires an authentication scheme to prevent an outsider from sending a malicious resident agent. The primary focus of this research is to find the best-fit authentication scheme for the SAAM system. SAAM with authentication can be used as the technical network infrastructure to support Network Centric Warfare (NCW) as described in JV2OlO. The prototype in this thesis authenticates new nodes that join a SAAM network using Kerberos. Signaling data, called control traffic, is authenticated with a dynamic signature key that changes every two minutes. Once a SAAM node is authenticated, its identity is protected throughout the battle.

APA, Harvard, Vancouver, ISO, and other styles

5

Sivaraman, Kaushalram Anirudh. "Designing fast and programmable routers." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113936.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 141-155).
Historically, the evolution of network routers was driven primarily by performance. Recently, owing to the need for better control over network operations and the constant demand for new features, programmability of routers has become as important as performance. However, today's fastest routers, which have 10-100 ports each running at a line rate of 10-100 Gbit/s, use fixed-function hardware, which cannot be modified after deployment. This dissertation describes three router hardware primitives and their corresponding software programming models that allow network operators to program specific classes of router functionality on such fast routers. First, we develop a system for programming stateful packet-processing algorithms such as algorithms for in-network congestion control, buffer management, and data-plane traffic engineering. The challenge here is the fact that these algorithms maintain and update state on the router. We develop a small but expressive instruction set for state manipulation on fast routers. We then expose this to the programmer through a high-level programming model and compiler. Second, we develop a system to program packet scheduling: the task of picking which packet to transmit next on a link. Our main contribution here is the finding that many packet scheduling algorithms can be programmed using one simple idea: a priority queue of packets in hardware coupled with a software program to assign each packet's priority in this queue. Third, we develop a system for programmable and scalable measurement of network statistics. Our goal is to allow programmers to flexibly define what they want to measure for each flow and scale to a large number of flows. We formalize a class of statistics that permit a scalable implementation and show that it includes many useful statistics (e.g., moving averages and counters). These systems show that it is possible to program several packet-processing functions at speeds approaching today's fastest routers. Based on these systems, we distill two lessons for designing fast and programmable routers in the future. First, specialized designs that program only specific classes of router functionality improve packet processing throughput by 10-100x relative to a general-purpose solution. Second, joint design of hardware and software provides us with more leverage relative to designing only one of them while keeping the other fixed.
by Anirudh Sivaraman Kaushalram.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

6

Becker, Matthew E. (Matthew Erin). "Fast arbitration in dilated routers." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39080.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Includes bibliographical references (p. 84-85).
by Matthew E. Becker.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

7

Gavgani, Yashar Ganjali. "Buffer sizing in internet routers /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Feng. "Building scalable next generation Internet routers /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20WANGF.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Egi, Norbert. "Software virtual routers on commodity hardware architectures." Thesis, Lancaster University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539674.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

He, Rongsen. "Indirect interconnection networks for high performance routers/switches." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/R_He_072307.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ruf, Lukas [Verfasser]. "Network Services on Service Extensible Routers / Lukas Ruf." Aachen : Shaker, 2006. http://d-nb.info/1170530850/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Venmani, Daniel Philip. "Multi-operator greedy routing based on open routers." Phd thesis, Institut National des Télécommunications, 2014. http://tel.archives-ouvertes.fr/tel-00997721.

Full text

Abstract:

Revolutionary mobile technologies, such as high-speed packet access 3G (HSPA+) and LTE, have significantly increased mobile data rate over the radio link. While most of the world looks at this revolution as a blessing to their day-to-day life, a little-known fact is that these improvements over the radio access link results in demanding tremendous improvements in bandwidth on the backhaul network. Having said this, today's Internet Service Providers (ISPs) and Mobile Network Operators (MNOs) are intemperately impacted as a result of this excessive smartphone usage. The operational costs (OPEX) associated with traditional backhaul methods are rising faster than the revenue generated by the new data services. Building a mobile backhaul network is very different from building a commercial data network. A mobile backhaul network requires (i) QoS-based traffic with strict requirements on delay and jitter (ii) high availability/reliability. While most ISPs and MNOs have promised advantages of redundancy and resilience to guarantee high availability, there is still the specter of failure in today's networks. The problems of network failures in today's networks can be quickly but clearly ascertained. The underlying observation is that ISPs and MNOs are still exposed to rapid fluctuations and/or unpredicted breakdowns in traffic; it goes without saying that even the largest operators can be affected. But what if, these operators could now put in place designs and mechanisms to improve network survivability to avoid such occurrences? What if mobile network operators can come up with low-cost backhaul solutions together with ensuring the required availability and reliability in the networks? With this problem statement in-hand, the overarching theme of this dissertation is within the following scopes: (i) to provide low-cost backhaul solutions; the motivation here being able to build networks without over-provisioning and then to bring-in new resources (link capacity/bandwidth) on occasions of unexpected traffic surges as well as on network failure conditions for particularly ensuring premium services (ii) to provide uninterrupted communications even at times of network failure conditions, but without redundancy. Here a slightly greater emphasis is laid on tackling the 'last-mile' link failures. The scope of this dissertation is therefore to propose, design and model novel network architectures for improving effective network survivability and network capacity, at the same time by eliminating network-wide redundancy, adopted within the context of mobile backhaul networks. Motivated by this, we study the problem of how to share the available resources of a backhaul network among its competitors, with whom a Service Level Agreement (SLA) has been concluded. Thus, we present a systematic study of our proposed solutions focusing on a variety of empirical resource sharing heuristics and optimization frameworks. With this background, our work extends towards a novel fault restoration framework which can cost-effectively provide protection and restoration for the operators, enabling them with a parameterized objective function to choose desired paths based on traffic patterns of their end-customers. We then illustrate the survivability of backhaul networks with reduced amount of physical redundancy, by effectively managing geographically distributed backhaul network equipments which belong to different MNOs using 'logically-centralized' physically-distributed controllers, while meeting strict constraints on network availability and reliability

APA, Harvard, Vancouver, ISO, and other styles

13

Prado, Alexandre Barcellos. "Auto-configuration of Cisco routers with application software." Thesis, Monterey, California. Naval Postgraduate School, 2003. http://hdl.handle.net/10945/6285.

Full text

Abstract:

Approved for public release, distribution unlimited
The context of this research is to facilitate the control of routers with the Server and Agent based Active Network Management (SAAM), to optimize allocation of network resources, and to satisfy user Quality of Service (QoS) requirements. The SAAM network determines the Quality of Service parameters based on current network conditions and user requirements. These parameters are dynamic, so they must be uploaded into the Cisco routers to take effect. The focus is on determining the most efficient way of communicating between the Cisco routers and the SAAM system. This is accomplished by several key components of the proxy-based solution as the first step for integrating with a legacy network. This thesis develops methods and application software to automatically update the configurations of Cisco routers based on the current network condition. These methods are required by any solution that resolves to upgrade the existing legacy network to provide QoS without expensive equipment replacement. As a result users are provided with a network they can expect to function properly.

APA, Harvard, Vancouver, ISO, and other styles

14

Ruiz, Sánchez Miguel Ángel. "Optimization of packet forwarding in best-effort routers." Nice, 2003. http://www.theses.fr/2003NICE4029.

Full text

Abstract:

La tâche principale d'un routeur est d'acheminer des paquets jusqu'à leur destination finale en passant par les différentes réseaux. Comme chaque paquet est traité individuellement, la performance d'un routeur dépend du temps nécessaire pour traiter chaque paquet. Due à la croissance et à la diversité du trafic dans l'Internet, le traitement nécessaire pour acheminer des paquets doit être optimisé. Cette thèse propose des algorithmes pour optimiser la performance du traitement de paquets lors de leur acheminement dans les routeurs best-effort. Pour acheminer (réexpédier) des paquets, un routeur doit tout d'abord rechercher l'information de routage correspondant à chaque paquet. La recherche d'information de routage est basée sur l'adresse destination du paquet et elle s'appelle consultation d'adresse. Nous proposons dans cette thèse deux mécanismes pour la mise à jour incrémentale des table de routage basées sur des tries multibit. Tout d'abord, nous déterminons les conditions nécessaires pour supporter des mises à jour incrémentales dans les tries multibit. À partir de ces conditions, nous proposons des algorithmes et des structures de données pour effectuer ces mises à jour incrémentales. En particulier, nous proposons une structure de données que nous appelons le vecteur de bits PN (pour prefix nesting en anglais). Le vecteur de bits PN code un ensemble de préfixes et leurs relations d'inclusion, car cette information est nécessaire pour supporter des mises à jour incrémentales. Nous évaluons la performance de nos mécanismes implémentés en langage C. Nous présentons les performances de nos mécanismes pour les opérations de recherche, insertion et suppression. Nous présentons également les besoins en termes de mémoire. Une deuxième contribution de cette thèse est l'introduction d'une taxonomie et un cadre de référence pour les algorithmes de consultation rapide d'adresse IP. Notre taxonomie est basée sur l'observation que la difficulté de trouver le plus long préfixe commun avec l'adresse destination est sa double dimension: valeur et longueur. Lorsque nous présentons et classifions les différents mécanismes, l'accent est mis sur le type de transformation que l'on effectue sur l'ensemble de préfixes pour chaque mécanisme. Cette approche unificatrice que nous proposons nous permet de comprendre et de comparer les compromis des différentes mécanismes. Nous comparons les mécanismes en termes de leur complexité en temps et en espace. Nous comparons aussi leur performance en mesurant le temps de l'opération de recherche. Ces mesures sont réalisées sur une même plateforme et en utilisant une vrai table de routage. Une troisième contribution de cette thèse est un mécanisme qui optimise l'usage des buffers dans les routeurs pour offrir un haut dégrée d'isolation entre flux. Tout d'abord, nous étudions la fonctionnalité des buffers dans les routeurs et nous déterminons les caractéristiques souhaitables des buffers dans les routeurs. Ensuite nous proposons MuxQ un mécanisme qui fournit un haut degré d'isolation entre flux. MuxQ est basé sur l'idée de protéger la fonction de multiplexage de la fonction d'absorption de rafales d'un buffer. Nous évaluons MuxQ en utilisant le simulateur ns-2. En particulier, nous étudions la capacité de MuxQ pour isoler différent types de flux. Nous comparons les performances de notre mécanisme avec celles des mécanismes Drop-Tail, CSFQ, FRED et DRR. Nous présentons les résultats de simulations avec des conditions de trafic différentes. MuxQ est un mécanisme simple, deployable et qui fournit un haut degré d'isolation de flux, tout en gardant une quantité limitée d'état.

APA, Harvard, Vancouver, ISO, and other styles

15

Duder, Matthew. "Session initiation protocol server implementation for Linksys routers /." Click here to view, 2009. http://digitalcommons.calpoly.edu/cscsp/1.

Full text

Abstract:

Thesis (B.S.)--California Polytechnic State University, 2009.
Project advisor: Hugh Smith. Title from PDF title page; viewed on Jan. 13, 2010. Includes bibliographical references. Also available on microfiche.

APA, Harvard, Vancouver, ISO, and other styles

16

Prado, Alexandre B. "Auto-configuration of Cisco routers with application software /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03sep%5FPrado.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

林俊？ and Chun-wing Lam. "Fault-tolerant routing for unidirectional networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29506530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Guild, Kenneth. "Optical packet-switched routers in wavelength division multiplexed networks." Thesis, University of Essex, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

De, Selms Tom. "USING BRIDGES, ROUTERS AND GATEWAYS IN DATA ACQUISITION NETWORKS." International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/606341.

Full text

Abstract:

International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California
Using acquisition networks requires an understanding of the capabilities, design constraints and limitations of each available network device. The proper use of bridges, routers and gateways become extremely important in large networks where dissimilar busses, protocols or applications may be found. As data acquisition networks become a reality, the instrumentation network engineer must understand the benefits of each of these network devices and when to use them.

APA, Harvard, Vancouver, ISO, and other styles

20

Gillella, Santhosh Kumar. "Functional validation model for routers of Networks-on-Chips /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1559856911&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Awad, Ashraf A. "Scalable application-aware router mechanisms." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04052004-180005/unrestricted/awad%5Fashraf%5Fa%5F200312%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Martin, Rovira Julia, and Fructoso Melero Francisco Manuel. "Micro-Network Processor : A Processor Architecture for Implementing NoC Routers." Thesis, Jönköping University, JTH, Computer and Electrical Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-941.

Full text

Abstract:

Routers are probably the most important component of a NoC, as the performance of the whole network is driven by the routers’ performance. Cost for the whole network in terms of area will also be minimised if the router design is kept small. A new application specific processor architecture for implementing NoC routers is proposed in this master thesis, which will be called µNP (Micro-Network Processor). The aim is to offer a solution in which there is a trade-off between the high performance of routers implemented in hardware and the high level of flexibility that could be achieved by loading a software that routed packets into a GPP. Therefore, a study including the design of a hardware based router and a GPP based router has been conducted. In this project the first version of the µNP has been designed and a complete instruction set, along with some sample programs, is also proposed. The results show that, in the best case for all implementation options, µNP was 7.5 times slower than the hardware based router. It has also behaved more than 100 times faster than the GPP based router, keeping almost the same degree of flexibility for routing purposes within NoC.

APA, Harvard, Vancouver, ISO, and other styles

23

Hassan, Karim. "Fabrication and characterization of thermo-plasmonic routers for telecom applications." Phd thesis, Université de Bourgogne, 2013. http://tel.archives-ouvertes.fr/tel-00944210.

Full text

Abstract:

The Dielectric Loaded Surface Plasmon Polariton Waveguides (DLSPPWs) have recently emerged as a possible solution to carry both optical and electrical signals on- chip. However, in the particular context of optical interconnects, advanced functionalities such as filtering, switching, and routing are required in order to replace in the future the equivalent electronic components which are too much power consumer and also to reduce their footprints. After presenting the interest and limitation of the leakage radiation microscopy method used all along this work, we show several active devices using thermo-sensitive polymers as the dielectric load driven electrically by Joule heating. Then we demonstrate the feasibility of all-optical systems by either doping the dielectric with metallic nanoparticles or by plasmo-thermal eect of a second plasmonic mode providing a localized heating of controlled shape. The dynamic activation of our thermo- optical devices is performed using a homemade fiber-to-fiber setup which allows us to investigate the response time of a plasmo-thermal heating as well as true datacom transmission. Some improvements of the original DLSPPWs performances are proposed by adding a metallic wall on one side of the polymer ridge. This system can act as a compact and athermal polarization converter

APA, Harvard, Vancouver, ISO, and other styles

24

Shamim, Imran. "Energy efficient links and routers for multi-processor computer systems." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54650.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
"September 2009." Cataloged from PDF version of thesis.
Includes bibliographical references (p. 95-96).
As multi-processor computer systems become more prevalent in today's computer industry, it is clear that routers and interconnection networks are critical components of these multi-processor systems. Therefore, there is a need to obtain accurate area and power models for these critical components so that we can better understand the area and power tradeoffs as we balance the on-chip and off-chip communication energy given a fixed energy budget. In this thesis, we propose an alternative method to understanding the power and area tradeoffs for routers by not solely relying on analytical models, on which most current studies done on this topic are based. Instead, in this thesis we propose analyzing the area versus power tradeoff for these routers and interconnection networks using an Application Specific Integrated Circuit (ASIC) flow in a commercially available IBM 90nm process technology. This thesis shows that multiplexer routers are more area and power efficient compared to matrix routers since matrix routers quickly exhibit a quadratic-like increase in area and power as the number of ports and port width increases. In addition, we show that there is a real gain in area when the router is shared among 4 or more cores. The savings by sharing the same router among multiple cores does not continue indefinitely, since after a certain port number and port width size, the increase in the crossbar size can no longer be compensated by sharing the router. So for a fixed port-width, there is always a sweet spot for the number of ports where a local minimum can be found for the Router Area Overheard per Core.
(cont.) By examining and analyzing the router design space, we show that for maximum area and power efficiency, it is much better to use a multiplexer router with 8-ports as opposed to matrix routers. Moreover, keeping the flit size to 32-bits or 64-bits results in a larger Router Area Overheard per Core savings as opposed to using a flit size of 128-bits. Even in situations where the core manipulates 128-bits of data, using two 64- bit routers running in parallel at the core frequency will result a larger area and power savings. Most importantly, we show that by looking at the costs and benefits of aggregation, we see that aggregation is only useful for narrow channel routers. This is because successful aggregation is a function of the crossbar complexity versus the bit/port width. By switching from a NoC with 5-port routers to higher radix routers while keeping the network bisection bandwidth approximately constant, the savings in the Router Area Overheard per Core can be up to 63%. The results of this work will allow us to calibrate our existing Orion 1.0 analytical models. We show that the source of the largest discrepancy between the synthesized results and the analytical models is the buffer and not the crossbar as we expected. The crossbar can be further optimized by designing and physically laying it out manually. The buffers were obtained using the Artisan SRAM Register File Memory Generator software, and hence they are expected to be fully optimized for power and area efficiency.
(cont.) Therefore, it appears that our analytical models for the buffer might not be accurate. In addition, the results of this study will be used to narrow down the microarchitecture of a router to be used in the Integrated Photonics Network project at the Integrated Systems Group (ISG) at the Research Laboratory for Electronics.
by Imran Shamim.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

25

Song, Wei. "Spatial parallelism in the routers of asynchronous on-chip networks." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/spatial-parallelism-in-the-routers-of-asynchronous-onchip-networks(3c23e040-0459-4b35-a8c9-1330296b3668).html.

Full text

Abstract:

State-of-the-art multi-processor systems-on-chip use on-chip networks as their communication fabric. Although most on-chip networks are implemented synchronously, asynchronous on-chip networks have several advantages over their synchronous counterparts. Timing division multiplexing (TDM) flow control methods have been utilized in asynchronous on-chip networks extensively. The synchronization required by TDM leads to significant speed penalties. Compared with using TDM methods, spatial parallelism methods, such as the spatial division multiplexing (SDM) flow control method, achieve better network throughput with less area overhead.This thesis proposes several techniques to increase spatial parallelism in the routers of asynchronous on-chip networks.Channel slicing is a new pipeline structure that alleviates the speed penalty by removing the synchronization among bit-level data pipelines. It is also found out that the lookahead pipeline using early evaluated acknowledgement can be used in routers to further improve speed.SDM is a new flow control method proposed for asynchronous on-chip networks. It improves network throughput without introducing synchronization among buffers of different frames, which is required by TDM methods. It is also found that the area overhead of SDM is smaller than the virtual channel (VC) flow control method -- the most used TDM method. The major design problem of SDM is the area consuming crossbars. A novel 2-stage Clos switch structure is proposed to replace the crossbar in SDM routers, which significantly reduces the area overhead. This Clos switch is dynamically reconfigured by a new asynchronous Clos scheduler.Several asynchronous SDM routers are implemented using these new techniques. An asynchronous VC router is also reproduced for comparison. Performance analyses show that the SDM routers outperform the VC router in throughput, area overhead and energy efficiency.

APA, Harvard, Vancouver, ISO, and other styles

26

Fu, Jing. "On the Design of Next-Generation Routers and IP Networks." Doctoral thesis, Stockholm : Elektro- och systemteknik, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Liu, Jing. "Stable and scalable arbitration algorithms for crossbar-based switches/routers /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20LIUJ.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 92-96). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

28

BHATTACHARYA, PRASUN. "COMPARISON OF SINGLE-PORT AND MULTI-PORT NoCs WITH CONTEMPORARY BUSES ON FPGAs." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1142842819.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Constantinescu, Doru. "Measurements and Models of One-Way Transit Time in IP Routers." Licentiate thesis, Karlskrona : Blekinge Institute of Technology, 2005. http://www.bth.se/fou/Forskinfo.nsf/allfirst2/d5c36dce80974ec3c12570a0003bb150?OpenDocument.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

何偉康 and Wai-hong Ho. "Performance and fault-tolerance studies of wormhole routers in 2D meshes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31214125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Shakya, Rosish. "Optimal Placement of Video Caching Routers for Minimization of Retransmission Delay." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1306429551.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sims, Zack A. "Deployment, Management, & Operations of Internet Routers for Space-Based Communication." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1429033241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ben, Rayana Rayene. "A smart management framework for multihomed mobile nodes & mobile routers." Télécom Bretagne, 2010. http://www.theses.fr/2010TELB0130.

Full text

Abstract:

Le paysage du monde des télécommunications a beaucoup changé ces dernières années. Les nouveaux mobiles, dits de quatrième génération, sont dotés de plusieurs interfaces de communication afin de mieux exploiter les différents réseaux d'accès disponibles. La prochaine étape : utiliser la multi-domiciliation, ou multihoming, pour exploiter cette diversité et assurer une connectivité fiable et peu onéreuse. Cependant, plusieurs problématiques résultent de l'utilisation simultanée de plusieurs réseaux : la consommation d'énergie, préoccupation majeure des équipementiers; l'augmentation du coût, pour la facturation à la durée; le choix des réseaux les plus “utiles” à un moment donné. . . Cette thèse décrit SmartMob6 : une architecture de gestion de la mobilité qui se propose de résoudre ces problématiques. Un algorithme de décision détermine les réseaux les plus “utiles” et désactive les interfaces inutilisées afin de préserver l'énergie et réduire les coûts. Pour le calcul dynamique de l'utilité d'un réseau, l'algorithme combine les besoins en QoS et en sécurité des flux avec les caractéristiques du réseau. La décision prend en compte les préférences de l'administrateur et celles des opérateurs. Si la demande dépasse le niveau de ressources disponibles, l'architecture propose l'utilisation d'applications adaptatives qui réduisent leur besoins en fonction des conditions. Dans ce manuscrit, nous appliquons ces idées à la mobilité IPv6 (Mobile IPv6, NEMO) dans le cadre des transports intelligents (ITS); nous exposons les résultats d'évaluation sur plate-forme réelle et nous présentons NetPyLab : Un simulateur développé afin de tester l'architecture
Mobile communication technologies are now moving toward full heterogeneity support. Fourth-generation mobile devices incorporate multiple interfaces with diverse access technologies. The next step: derive benefit from this heterogeneity to ensure a ubiquitous and inexpensive access to mobile devices through multihoming. However, being multihomed is intrinsically complicated. It raises several issues such as energy overconsumption, additional usage costs and it strongly motivates the proposal of decision mechanisms to choose the « right » access networks among the available ones. This thesis describes SmartMob6: A mobility management framework that addresses these issues. A decision algorithm selects the most « useful » networks and proposes to deactivate the unused interfaces to save energy and money. For the dynamic evaluation of a network utility, it suggests to combine the flow's QoS and security requirements with the network characteristics. Flows are distributed over the remaining interfaces with respect to their compatibility and their priority. This decision takes into account high-level policies coming from the administrator and also from operators as well as ISPs. In addition, the framework supports adaptive applications: When the resource level decreases, applications are asked to reduce their expectations to ensure a minimal service level. In this manuscript, we adapt these ideas to the contexts of IPv6 Mobility (Mobile IPv6, NEMO) and Intelligent Transportation Systems (ITS); we present the results of a testbed experimentation and we introduce NetPyLab: a simulator developed to test the framework

APA, Harvard, Vancouver, ISO, and other styles

34

Al-Amoudi, Ahmed. "Evaluation of virtual routing appliances as routers in a virtual environment /." Online version of thesis, 2008. http://hdl.handle.net/1850/7544.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Joe, In-Sung. "Scalable, high-capacty optical switches for internet routers and moving platforms /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Ho, Wai-hong. "Performance and fault-tolerance studies of wormhole routers in 2D meshes /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19685737.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Muthukumarasamy, Muthulakshmi. "Processor Microarchitecture for Implementation of Ephemeral State Processing within Network Routers." UKnowledge, 2003. https://uknowledge.uky.edu/ece_etds/142.

Full text

Abstract:

The evolving concept of Ephemeral State Processing (ESP) is overviewed. ESP allows development of new scalable end-to-end network user services. An evolving macro-level language is being developed to support ESP at the network node level. Three approaches for implementing ESP services at network routers can be considered. One approach is to use the existing processing capability within commercially available network routers. Another approach is to add a small scale existing ASIC based general-purpose processor to an existing network router. This thesis research concentrates on a third approach of developing a special-purpose programmable Ephemeral State Processor (ESPR) Instruction Set Architecture (ISA) and implementing microarchitecture for deployment within each ESP-capable node to implement ESP service within that node. A unique architectural characteristic of the ESPR is its scalable and temporal Ephemeral State Store (ESS) associative memory, required by the ESP service for storage/retrieval of bounded (short) lifetime ephemeral (tag, value) pairs of application data. The ESPR will be implemented to Programmable Logic Device (PLD) technology within a network node. This offers advantages of reconfigurability, in-field upgrade capability and supports the evolving growth of ESP services. Correct functional and performance operation of the presented ESPR microarchitecture is validated via Hardware Description Language (HDL) post-implementation (virtual prototype) simulation testing. Suggestions of future research related to improving the performance of the ESPR rnicroarchitecture and experimental deployment of ESP are discussed.

APA, Harvard, Vancouver, ISO, and other styles

38

Vishwanathan, Roopa Tate Stephen R. "Power-benefit analysis of erasure encoding with redundant routing in sensor networks." [Denton, Tex.] : University of North Texas, 2006. http://digital.library.unt.edu/permalink/meta-dc-5426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Paul, Indrani. "Switch scheduling in the Multimedia Router (MMR)." Thesis, Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Wallace, Brian T. "Automated system for load-balancing EBGP peers." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0008800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Karamanos, Emmanouil. "Investigation of home router security." Thesis, KTH, Kommunikationssystem, CoS, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-91107.

Full text

Abstract:

Home routers are common in every household that has some kind of Internet connectivity. These embedded devices are running services such as web, file and DHCP server. Even though they have the same security issues as regular computers, they do no run protection software such as anti-virus and they are not updated. Moreover, the importance of these devices is misjudged; all network traffic is passing through them and they control the DNS of the network while, in most cases, they are on-line around the clock. When more and more non-Internet features are implemented into home routers, such as Voice over IP and network storage, their role becomes more special and many security concerns are raising. In this thesis, we investigate the issues resulting from this special role; the importance for these devices to be secure, the attacking vector and how the devices can be compromised to be part of a large home router botnet. We conclude by proposing ways to make the current implementation more secure, suggesting ways to protect routers from botnets without user interaction, that is from the ISP, while respecting the privacy of the end user and we identify what future work needs to be done.
Router är vanliga i hem som har någon slags Internet anslutning. De här inbyggda enheter kör tjänster som t.ex. web, file och DHCP basenheter. Fastän de har samma säkerhetsfrågor som vanliga datorer, så kan de inte använda säkerhets mjukvara som t.ex anti-virus och de är inte uppdaterade. Dessutom har betydelsen av de här apparaterna blivit felbedömmat; hela nätverket passerar genom dem och de kontrolerar nätverkets DNS medan, i de flesta fall, de är on-line dygnet runt. Men, när mer och mer icke-Internet lockvaror fars in i routern, som t.ex Voice över IP och nätverkslagring, blir deras roll viktigare och oron för säkerheten växer. I den här avhandlingen utforskars problemen och frågorna som efterföljer deras speciella roll, hur viktigt det är att de här apparaterna är skyddade, (the attacking vector) och hur de här apparaterna kan bli jämkningad för att bli en del av ett stort router botnet. Vi avsluter med att lägga fram sätt att göra det nuvarande verktyget mer skyddat, föreslå sätt att skydda routern från botnet utan användarinteraktion, som kommer från ISP, medan man respekterar det andra användarens privtaliv och markera vad som behövs ändras i framtiden.

APA, Harvard, Vancouver, ISO, and other styles

42

Lepe, Aldama Oscar Iván. "Modeling TCP/IP software implementation performance and its application for software routers." Doctoral thesis, Universitat Politècnica de Catalunya, 2002. http://hdl.handle.net/10803/5975.

Full text

Abstract:

Existen numerosos trabajos que estudian o tratan la realización software de los protocolos de comunicaciones para el acceso a la Internet-TCP/IP. Sin embargo, no conocemos ninguno que modele de forma general y precisa la ejecución de este software.
La presente tesis aporta una caracterización detallada de la ejecución de la realización software de los mencionados protocolos sobre un computador personal y bajo un sistema operativo UNIX. Esta caracterización muestra cómo varía el rendimiento del sistema en función de la velocidad de operación de la CPU, las características del subsistema de memoria, el tamaño de los paquetes y otras variables de importancia para la remisión, autenticación y cifrado de paquetes IP.
En otros trabajos se proponen adecuaciones o extensiones a la realización software de los mencionados protocolos que permiten que un software router provea de comunicaciones con diversos niveles asegurados de calidad mediante el uso de mecanismos de planificación para la unidad central de procesamiento. Sin embargo, en dichos trabajos no se contempla la planificación del uso del bus de entrada/salida.
Los resultados derivados de nuestro modelo demuestran que, para sistemas que usan CPUs con frecuencias de reloj superiores a 1 GHz, la planificación conjunta de la CPU y el bus de entrada salida es indispensable para la provisión de comunicaciones con diversos niveles asegurados de calidad. Dichas frecuencias de reloj son comunes en los sistemas comerciales actuales, por lo que consideramos que es un problema de gran interés. En la tesis proponemos un mecanismo que consigue garantías de utilización del bus de entrada/salida mediante la modificación de los drivers de los interfaces de red.
Three are the main contributions of this work. In no particular order:
" A detailed performance study of the software implementation of the TCP/IP protocols suite, when executed as part of the kernel of a BSD operating system over generic PC hardware.
" A validated queuing network model of the studied system, solved by computer simulation.
" An I/O bus utilization guard mechanism for improving the performance of software routers supporting QoS mechanisms and built upon PC hardware and software.
This document presents our experiences building a performance model of a PC-based software router. The resulting model is an open multiclass priority network of queues that we solved by simulation. While the model is not particularly novel from the system modeling point of view, in our opinion, it is an interesting result to show that such a model can estimate, with high accuracy, not just average performance-numbers but the complete probability distribution function of packet latency, allowing performance analysis at several levels of detail. The validity and accuracy of the multiclass model has been established by contrasting its packet latency predictions in both, time and probability spaces. Moreover, we introduced into the validation analysis the predictions of a router's single queue model. We did this for quantitatively assessing the advantages of the more complex multiclass model with respect to the simpler and widely used but not so accurate, as here shown, single queue model, under the considered scenario that the router's CPU is the system bottleneck and not the communications links. The single queue model was also solved by simulation.
Besides, this document addresses the problem of resource sharing in PC-based software routers supporting QoS mechanisms. Others have put forward solutions that are focused on suitably distributing the workload of the CPU-see this chapter's section on "related work". However, the increase in CPU speed in relation to that of the I/O bus-as here shown-means attention must be paid to the effect the limitations imposed by this bus on the system's overall performance. We propose a mechanism that jointly controls both I/O bus and CPU operation. This mechanism involves changes to the operating system kernel code and assumes the existence of certain network interface card's functions, although it does not require changes to the PC hardware. A performance study is shown that provides insight into the problem and helps to evaluate both the effectiveness of our approach, and several software router design trade-offs.

APA, Harvard, Vancouver, ISO, and other styles

43

Ohlson, Johan. "Virtual Routing and Forwarding (VRF) - och dess påverkan på en routers processor." Thesis, Linnaeus University, School of Computer Science, Physics and Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6174.

Full text

Abstract:

I dagsläget används VPN allt mer bland företagen för att ansluta till olika nätverk. Detta kan medföra att routingtabellen blir alltför stor och det kan i sin tur påverka processorbelastningen på routern som delar ut alla VPN.Detta arbete hade som syfte att granska om det är några märkbara prestandaskillnader på en routers processor när olika routingprotokoll används tillsammans med VRF. Protokollen som detta arbete tog upp var BGP, OSPF och RIP.Tre olika nätverks-scenarier skapades där olika tester genomfördes för de tre nämnda routingprotokollen. Det gjordes även tester på routrar när ingen VRF användes för att jämföra resultaten. Testerna bestod av att granska processorbelastningen på routrar när det fanns många rutter i nätverket och när nätverket var belastat med trafik.Testernas visade att skillnaden mellan BGP och OSPF inte är särskilt stor, men när RIP användes så steg processorbelastningen markant när nätverket hade många rutter. Om däremot VRF användes tillsammans med RIP så sjönk belastningen avsevärt på vissa routrar.

APA, Harvard, Vancouver, ISO, and other styles

44

Jakobson, Fredrik. "Open source routing software : A comparative study of open source software routers." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-9520.

Full text

Abstract:

As the performance of PCs is increasing it is of great interest to use these cheap devices as routers,which traditionally consisted of more expensive and customized hardware for that purpose. Thesoftware was also traditionally proprietary and thereby costly, but as the open source communityhas grown there have been development of open source solutions that can perform the task ofacting as a router. However as there are so many solutions out there, it can be hard for the potentialusers to choose which particular solution to use, without having to put in too much work intogetting a fully functional router solution. This study achieved this purpose by benchmarking themost popular open source software routers, in terms of performance and scalability as well asproviding a brief analysis of their basic security features. The routers that were studied wasClearOS, Untangle NG Firewall and IPFire, and after the study was complete IPFire was consideredthe superior with ClearOS as the second and Untangle as third and last.

APA, Harvard, Vancouver, ISO, and other styles

45

Sundberg, Simon. "Localization of eNodeBs with a Large Set of Measurements from Train Routers." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-75456.

Full text

Abstract:

This master thesis investigates the possibility of locating LTE base stations, known as eNodeBs, using signal measurements collected by routers on trains. Four existing algorithms for transmitter localization are adopted: the centroid, strongest signal, Monte Carlo path loss simulation and power difference of arrival (PDoA) methods. An improved version of Monte Carlo path loss simulation called logloss fitting is proposed. Furthermore, a novel localization method called sector fitting is presented, which operates solely on the cell identity and geographical distribution of the measurements. The methods are evaluated for a set of manually located eNodeBs, and the results are compared to other external systems that can be used to locate eNodeBs. It is found that the novel sector fitting algorithm is able to considerably improve the accuracy of the logloss fitting and PDoA methods, but weighted centroid is overall the most accurate of the considered methods, providing a median error of approximately 1 km. The Google Geolocation API and Mozilla Location Service still provides estimates that are generally closer to the true location than any of the considered methods. However, for a subset of eNodeBs where measurements from all sectors are available, the novel sector fitting algorithm combined with logloss fitting outperforms the external systems. Therefore, a hybrid approach is suggested, where sector fitting combined with logloss fitting or weighted centroid is used to locate eNodeBs that have measurements from all sectors, while Google Geolocation API or Mozilla Location Service is used to locate the remaining eNodeBs. It is concluded that while the localization performance for those eNodeBs that have measurements from all sectors is relatively good, further improvements to the overall results can likely be obtained in future work by considering environmental factors, the angular losses introduced by directional antennas, and the effects of downlink power control.

APA, Harvard, Vancouver, ISO, and other styles

46

Khan, Jamal Ahmad. "Improving TCP Data Transportation for Internet of Things." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/84946.

Full text

Abstract:

Internet of Things (IoT) is the idea that every device around us is connected and these devices continually collect and communicate data for analysis at a large scale in order to enable better end user experience, resource utilization and device performance. Therefore, data is central to the concept of IoT and the amount being collected is growing at an unprecedented rate. Current networking systems and hardware are not fully equipped to handle influx of data at this scale which is a serious problem because it can lead to erroneous interpretation of the data resulting in low resource utilization and bad end user experience defeating the purpose of IoT. This thesis aims at improving data transportation for IoT. In IoT systems, devices are connected to one or more cloud services over the internet via an access link. The cloud processes the data sent by the devices and sends back appropriate instructions. Hence, the performance of the two ends of the network ie the access networks and datacenter network, directly impacts the performance of IoT. The first portion of the our research targets improvement of the access networks by improving access link (router) design. Among the important design aspects of routers is the size of their output buffer queue. %Selecting an appropriate size of this buffer is crucial because it impacts two key metrics of an IoT system: 1) access link utilization and 2) latency. We have developed a probabilistic model to calculate the size of the output buffer that ensures high link utilization and low latency for packets. We have eliminated limiting assumptions of prior art that do not hold true for IoT. Our results show that for TCP only traffic, buffer size calculated by the state of the art schemes results in at least 60% higher queuing delay compared to our scheme while achieving almost similar access link utilization, loss-rate, and goodput. For UDP only traffic, our scheme achieves at least 91% link utilization with very low queuing delays and aggregate goodput that is approx. 90% of link capacity. Finally, for mixed traffic scenarios our scheme achieves higher link utilization than TCP only and UDP only scenarios as well as low delays, low loss-rates and aggregate goodput that is approx 94% of link capacity. The second portion of the thesis focuses on datacenter networks. Applications that control IoT devices reside here. Performance of these applications is affected by the choice of TCP used for data communication between Virtual Machines (VM). However, cloud users have little to no knowledge about the network between the VMs and hence, lack a systematic method to select a TCP variant. We have focused on characterizing TCP Cubic, Reno, Vegas and DCTCP from the perspective of cloud tenants while treating the network as a black box. We have conducted experiments on the transport layer and the application layer. The observations from our transport layer experiments show TCP Vegas outperforms the other variants in terms of throughput, RTT, and stability. Application layer experiments show that Vegas has the worst response time while all other variants perform similarly. The results also show that different inter-request delay distributions have no effect on the throughput, RTT, or response time.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

47

Dawra, Gaurav. "Terrain based routing protocol for sparse ad-hoc intermittent network (TRAIN)." Thesis, Montana State University, 2005. http://etd.lib.montana.edu/etd/2005/dawra/DawraG1205.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Ojeda, Meléndez José Eduardo. "Proyecto de Interconexión entre el nodo de telefónica y el cliente mediante un radioenlace." Bachelor's thesis, Universidad Ricardo Palma. Programa Cybertesis PERÚ, 2008. http://cybertesis.urp.edu.pe/urp/2008/ojeda_je/html/index-frames.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chonbodeechalermroong, Yongyut School of Electrical Engineering UNSW. "Simple star multihop optical network." Awarded by:University of New South Wales. School of Electrical Engineering, 2001. http://handle.unsw.edu.au/1959.4/20328.

Full text

Abstract:

A new multihop wavelength-division multiplexed (WDM) optical network designed for uniform traffic with two wavelengths per node that can give the maximum throughput and minimum delay is proposed. It is called a 'Simple Star' multihop optical network. This network has good characteristics in traffic balance and small average number of hops. Moreover, Simple Star can be used together with multiple star couplers to reduce the number of wavelength used. Furthermore, unlike most existing networks, this network does not impose an upper limit to the number of nodes. Another interesting pattern is Simple Star with Center Node (Simple Star CN) particularly for prime numbers of nodes. It can be shown that the average number of hops of Simple Star (normal plus CN) is in between those of Shufflenet and Kautz, but the throughput and delay are better. An associated network called Simple Star Shared Channel (Simple Star SC) for two transceivers per node is also presented and it can be used together with multiple star couplers to reduce the number of wavelengths. An example of a 16-node Simple Star SC shows that the number of wavelengths used can be 8 times less than that in the normal Simple Star network. The Shared Channel simulation model is based on the concept of CSMA/CD (Carrier Sense Multiple Access with Collision Detection).

APA, Harvard, Vancouver, ISO, and other styles

50

Zhou, Brian Dazheng. "Steiner tree optimization in multicast routing." online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?MQ71842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Routers'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles