Дисертації з теми "Distributed router"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-35 дисертацій для дослідження на тему "Distributed router".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Hidell, Markus. "Decentralized Modular Router Architectures." Doctoral thesis, Stockholm : Laboratory for Communications Networks, Royal Institute of Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4090.
Повний текст джерелаYang, Rena Whei-Ming 1974. "Scalable distributed router mechanisms to encourage network congestion avoidance." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47543.
Повний текст джерелаIncludes bibliographical references (p. 58-60).
by Rena Whei-Ming Yang.
M.Eng.
Rodríguez, Durón Francisco A. "Design and analysis of a new distributed IP router framework." Thesis, Lancaster University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551640.
Повний текст джерелаChan, Yik-Kwan Eric, and 陳奕鈞. "Investigation of a router-based approach to defense against Distributed Denial-of-Service (DDoS) attack." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30173309.
Повний текст джерелаSadhukhan, Gautam, Deepak Vinodia, and Manmohan Sandhu. "PERFORMANCE EVALUATION OF ETHERNET LAN BASED DISTRIBUTED TELEMETRY DATA NETWORK AND ITS EXTENSION USING ROUTER AND BRIDGE." International Foundation for Telemetering, 2004. http://hdl.handle.net/10150/605803.
Повний текст джерелаThis paper evaluates the performance as well as effectiveness of the High Speed Ethernet LANBased Distributed Telemetry Data Network Architecture. It also attempts to obtain a feasible solution for the Extension of LAN over High Performance Digital Modem via Routers and Bridges. With the advent of highly efficient broadband TCP/IP network and rapid growth of data traffic demand in the area of Telemetry Data Acquisition and Processing, one has to adopt a high bit rate PCM Telemetry Data Stream with the strategy of distributed task scheduling in multiprocessor environment. The proposed Telemetry System Architecture is adopted as a milestone to Modern Telemetry system. It incorporates various value added services for the performance evaluation of various flight vehicles providing authenticated data. This paper shows that by configuring the IP addresses of various nodes and router / bridges with V.35 interfaces, it is possible to extend the Telemetry Data on a local LAN to the remote LAN for display and high speed processing in real time. Necessary comparisons of performance of the existing to the proposed systems are presented.
Núñez, Benjamin. "Applying a router-based-distributed bandwidth allocation algorithm to dynamically implement traffic engineering over MPLS-based networks in order to increase the quality of service for non-elastic applications." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1435226.
Повний текст джерелаKosowski, Adrian. "Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network." Habilitation à diriger des recherches, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00867765.
Повний текст джерелаHalwan, Vivek. "Efficient and fault-tolerant communication algorithms in wormhole-routed distributed membory multiprocessors /." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488187049539756.
Повний текст джерелаDixit-Radiya, Vibha. "Mapping on wormhole-routed distributed-memory systems : a temporal communication graph-based approach /." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487863429091928.
Повний текст джерелаPajak, Dominik. "Algorithms for Deterministic Parallel Graph Exploration." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2014. http://tel.archives-ouvertes.fr/tel-01064992.
Повний текст джерелаNeedels, Keith. "Detecting and recovering from overlay routing attacks in peer-to-peer distributed hash tables /." Online version of thesis, 2008. http://hdl.handle.net/1850/8800.
Повний текст джерелаTlig, Mohamed. "Coordination locale et optimisation distribuée du trafic de véhicules autonomes dans un réseau routier." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0049/document.
Повний текст джерелаIn this thesis, we focus on traffic coordination and optimization in road intersections, while accounting for intelligent autonomous vehicles. This thesis is organized in two parts. The first part focuses on the problem of sharing a one-lane road between two opposite flows of vehicles. The state of the art shows few studies addressing this issue. We propose two reactive coordination approaches that minimize vehicle delays and measure their performances statistically through simulations. The second part of the thesis addresses the problem of generic traffic management in a traffic network. We develop a stop-free approach that explores a principle alternating vehicles between flows at intersections, and it provides distributed algorithms optimizing this alternation at each intersection and in the overall network. We present the modeling choices, the algorithms and the simulation study of our approach and we compare its performances with existing approaches
Wang, Bo. "Distributed resource allocation and performance optimization for video communication over mesh networks based on swarm intelligence." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/4666.
Повний текст джерелаThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed Mar. 3, 2008). Vita. Includes bibliographical references.
Garige, Naga Siddhardha. "A Distributed Routing Algorithm for ER-LSP Setup in MLPS Networks." [Tampa, Fla. : s.n.], 2003. http://purl.fcla.edu/fcla/etd/SFE0000086.
Повний текст джерелаNaulin, Jean-Philippe. "Modélisation hydrologique distribuée pour la prévision des coupures de routes par inondation : application au département du Gard." Ecole centrale de Nantes, 2012. http://www.theses.fr/2012ECDN0007.
Повний текст джерелаAbstract With the development of high spatial and temporal resolution rainfall measurements, distributed hydro-meteorological models can provide useful information to anticipate the local consequences of storm events over a region. Nevertheless, the estimation of local consequences through distributed discharge forecasting is not a straightforward purpose: the uncertainties associated to discharge forecasts may be very important, especially in ungauged areas and the consequences highly depend on the local susceptibility to flooding. In this context, a prototype of road inundation warning system, providing a rating of road submersion risk every 15 minutes during a flood event, has been developed. Initially tested in limited areas, the system has been extended to the entire Gard department which represents an application area of 5000 km² including 2000 target points for which warnings are computed. The system combines a distributed rainfall-runoff model and a susceptibility rating model. The system has been validated against reported road inundations. It appeared to perform well, even if the number of generated false alarms is important. The road inundation warning system has been then used to evaluate the usefulness of radar quantitative precipitation estimates for hydrological distributed applications. In order to improve the results, data assimilation techniques have been implemented to correct the susceptibility rating of the road sections as well as the rainfall-runoff model. Finally, this work demonstrated the potential of highly distributed rainfall-runoff model in combination with local exposure models as an innovating and efficient flood forecasting tool
Faye, Sébastien. "Contrôle et gestion du trafic routier urbain par un réseau de capteurs sans fil." Thesis, Paris, ENST, 2014. http://www.theses.fr/2014ENST0061/document.
Повний текст джерелаRoad traffic has a significant effect on metropolitan activities, especially during peak hours when it impacts on areas such as the economy and the environment. Road infrastructure is typically coordinated from a control centre that is responsible for maintaining not only its equipment but also their initial settings and incident management (both material and human). During the past few years, new technologies in the fields of information and communication have led to the introduction of intelligent transportation systems. Using multiple measurement points distributed across a country, an operator can count road users and calculate the network load. However, the centralization of information has a number of drawbacks. The aim of this thesis is to study the use of distributed systems in order to implement intelligent transportation systems via a wireless sensor network. Coupled to a detection unit (e.g., a magnetometer), the interconnected sensors can respond to the passage of a vehicle when deployed, for example, along the road. They can also work together without recourse to a central entity - rendering all or part of an urban area totally independent. Furthermore, these networks can operate autonomously and are less susceptible to breadown, because the overall running of the system is not affected by the failure of individual components. Finally, components are small and cheap, and they operate wirelessly, which means they can be deployed and redeployed both rapidly and densely
Hong, Yi. "Modélisation distribuée à base physique du transfert hydrologique des polluants routiers de l’échelle locale à l’échelle du quartier." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1106/document.
Повний текст джерелаNowadays, the increasing use of separate stormwater systems causes a frequent transport of urban pollutants into receiving water bodies (lakes, rivers). However, current studies still lack of the knowledge of urban build-up and wash-off processes. In order to address urban management issues, better understanding of physical mechanism is required not only for the urban surfaces, but also for the sewer systems. In this context, the modelling of hydrological transfer of urban pollutants can be a valuable tool.This thesis aims to develop and assess the physically-based and distributed models to simulate the transport of traffic-related pollutants (suspended solids, hydrocarbons, heavy metals) in urban stormwater runoffs. This work is part of the ANR "Trafipollu" project, and benefit from the experimental results for model calibration and validation. The modelling is performed at two scales of the urban environment: at the local scale and at the city district scale.At the local scale of urban environment, the code FullSWOF (second-order finite volume scheme) coupled with Hairsine and Rose model (1992a; 1992b) and detailed monitoring surveys is used to evaluate urban wash-off process. Simulations over different rainfall events represent promising results in reproducing the various dynamics of water flows and particle transfer on the urban surfaces. Spatial analysis of wash-off process reveals that the rainfall-driven impacts are two orders of magnitude higher than flow-drive effects. These findings contribute to a significant improvement in the field of urban wash-off modelling. The application of soil erosion model to the urban context is also an important innovation.At the city district scale, the second step consists of coupling the TREX model (Velleux, England, et al., 2008) and the CANOE model, named "TRENOE" platform. By altering different options of model configurations, the adequate numerical precision and the detailed information of landuse data are identified as the crucial elements for achieving acceptable simulations. Contrarily, the high-resolution topographic data and the common variations of the water flow parameters are not equally significant at the scale of a small urban catchment. Moreover, this coupling showed fundamental problems of the model structure such as the numerical scheme of the overland flow (only 4 directions), and the empirical USLE equations need to be completed by raindrop detachment process.To address these shortcomings, the LISEM - SWMM platform is developed by coupling the open-source LISEM model (De Roo, Wesseling, et al., 1996), which is initially developed for soil erosion simulations, and the SWMM model (Rossman, 2010). For the first time, the hydrological model is also supported by the simulations of atmospheric dry deposits of fine particles (PM10), hydrocarbons and heavy metals. The performance of water flow and TSS simulations are satisfying with the calibrated parameters. Considering the hydrocarbons and heavy metals contents of different particle size classes, simulated event mean concentration of each pollutant is comparable to local in-situ measurements. Although the platform at current stage still needs improvements in order to adapt to the operational applications, the present modelling approach contributes to an innovative technology in the field of modelling of hydrological transfer of the traffic-related pollutants in urban environment
Sabbani, Imad. "Optimisation du trafic routier par des modèles distribués à base d'agents embarqués utilisant les technologies des objets connectés." Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCD023.
Повний текст джерелаIn this thesis we present some models of optimization problems in transportation field; The fundamental problem is to define the shortest path bewteen two points through one or many modes of transport. Over the past two decades, logistics chains have raised a large number of combinatorial problems with important economic and environmental issues to be solved: scheduling problems, rooting vehicles, monitoring trafic ... Two original methods are presented in this thesis. First, we propose a meta-heuristic optimization algorithm, to guide the vehicles to make the right decision to choose the optimal route and to promote traffic fluidity. The modeling of our system is based on a new distributed architecture of multi-agent systems and a new communication protocol. Our system is based on a multi-objective function with several parameters (i.e. density, speed, number of cars, ...). The collection of this data plays an important role in ensuring the applicability and effectiveness of our solution.We propose a deep convolutional neural network algorithm to obtain real-time traffic status. The second part of our thesis focuses on a new policy of mobility required by the growth of network size and new high technological developments in transport : the planning of daily activity chains in a multimodal context. The modal choice of transport consists in successively using one or more modes of transport. We propose the ant colony algorithm with time windows involving a new concept of flexibility. The introduction of this aspect introduces new challenges and new constraints that must be resolved.For each problem, experiments are carried out in order to evaluate the performance of our approaches on literature instances. In particular, our algorithms have improved the results obtained by the best existing approaches
Saidi, Mohand Yazid Cousin Bernard Le Roux Jean-Louis. "Méthodes de contrôle distribué du placement de LSP de secours pour la protection des communications unicast et multicast dans un réseau MPLS." Rennes : [s.n.], 2008. ftp://ftp.irisa.fr/techreports/theses/2008/saidi.pdf.
Повний текст джерелаBabicheva, Tatiana. "Machine Learning pour la gestion distribuée et dynamique d’une flotte de taxis et navettes autonomes." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG023.
Повний текст джерелаIn this thesis are investigated methods to manage shared electric autonomous taxi urban systems under online context in which customer demands occur over time, and where vehicles are available for ride-sharing and require electric recharging management. We propose the heuristics based on problem decomposition which include road network repartition and highlighting of subproblems such as charging management, empty vehicle redistribution and dynamic ride-sharing.The set of new methods for empty vehicle redistribution is proposed, such as proactive, meaning to take into account both current demand and anticipated future demand, in contrast to reactive methods, which act based on current demand only.We provide the reinforcement learning in different levels depending on granularity of the system.We propose station-based RL model for small networks and zone-based RL model, where the agents are zones of the city obtained by partitioning, for huge ones. The complete information optimisation is provided in order to analyse the system performance a-posteriori in offline context.The evaluation of the performance of proposed methods is provided in set of road networks of different nature and size. The proposed method provides promising results outperforming the other tested methods and the real data on the taxi system performance in terms of number of satisfied passengers under fixed fleet size
Chera, Catalin-Marian. "Contribution à l'extension de l'approche énergétique à la représentation des systèmes à paramètres distribués." Phd thesis, Ecole Centrale de Lille, 2009. http://tel.archives-ouvertes.fr/tel-00578842.
Повний текст джерелаZgaya, Hayfa. "Conception et optimisation distribuée d'un système d'information d'aide à la mobilité urbaine : Une approche multi-agent pour la recherche et la composition des services liés au transport." Phd thesis, Ecole Centrale de Lille, 2007. http://tel.archives-ouvertes.fr/tel-00160802.
Повний текст джерелаCes travaux de recherche visent à mettre en œuvre un Système d'Information de Transport Multimodal (SITM) pour optimiser la gestion de flux des requêtes utilisateurs qui peuvent être nombreuses et simultanées. Dans ce cas, le SITM doit pouvoir procéder par des processus de décomposition des requêtes simultanées en un ensemble de tâches indépendantes. Chaque tâche correspond à un service qui peut être proposé par plusieurs fournisseurs d'information, en concurrence, avec différents couts, formats et temps de réponse. Un fournisseur d'information voulant proposer ses services via le SITM, doit d'abord y enregistrer son système d'information, en assumant la responsabilité des aspects juridiques et qualitatifs de ses données. Le SITM est donc lié à un Réseau informatique Etendu et distribué de Transport Multimodal (RETM) qui comporte plusieurs sources d'information hétérogènes des différents services proposés aux utilisateurs de transport.
L'aspect dynamique, distribué et ouvert du problème, nous a conduits à adopter une modélisation multi-agent pour assurer au système une évolution continue et une flexibilité pragmatique. Le système multi-agent proposé s'appuie sur les métaheuristiques pour la recherche et la composition des services; la recherche des services se base sur le paradigme Agent Mobile (AM) utilisant un algorithme d'optimisation dynamique de construction des Plans De Routes (PDR). Cette première étape d'optimisation prépare les parcours des AMs en prenant en considération l'état du RETM. La composition des services utilise les algorithmes évolutionnistes pour optimiser les réponses en termes de coût et de temps, sachant qu'une réponse à une requête utilisateur ne doit pas dépasser un temps maximum autorisé et qu'un utilisateur cherche toujours à avoir le meilleur rapport qualité prix pour les services qu'il demande.
Enfin, le SITM prend en considération les éventuelles perturbations sur le RETM (pannes, goulets d'étranglements, etc.) pour satisfaire les requêtes utilisateurs dans tous les cas de figure. Dans ce contexte, nous avons créé un protocole de négociation entre les agents mobiles et les agents responsables des choix des fournisseurs d'information pour les services demandés, ces agents sont appelés agents Ordonnanceurs. Le protocole proposé dépasse les limites d'une communication agent traditionnelle, ce qui nous a incités à associer au système une ontologie flexible qui permet d'automatiser les différents types d'échanges entre les agents grâce à un vocabulaire approprié.
Les résultats expérimentaux présentés dans cette thèse justifient l'utilisation du paradigme agent mobile dans notre système qui remplace parfaitement bien les paradigmes classiques telle que l'architecture client/serveur. Les simulations présentées montrent différents scénarios de gestion d'un nombre des requêtes simultanées plus ou moins important. En effet, quelque soit le nombre de requêtes utilisateurs formulées pendant un court laps de temps , le système se charge de leur décomposition, de l'identification des services demandés et des fournisseurs d'information susceptibles d'y répondre.
Feki, Mohamed Firas. "Optimisation distribuée pour la recherche des itinéraires multi-opérateurs dans un réseau de transport co-modal." Phd thesis, Ecole Centrale de Lille, 2010. http://tel.archives-ouvertes.fr/tel-00604509.
Повний текст джерелаMastio, Matthieu. "Modèles de distribution pour la simulation de trafic multi-agent." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1147/document.
Повний текст джерелаNowadays, analysis and prediction of transport network behavior are crucial elements for the implementation of territorial management policies. Computer simulation of road traffic is a powerful tool for testing management strategies before deploying them in an operational context. Simulation of city-wide traffic requires significant computing power exceeding the capacity of a single computer.This thesis studies the methods to perform large-scale multi-agent traffic simulations. We propose solutions allowing the distribution of such simulations on a large amount of computing cores.One of them distributes the agents directly on the available cores, while the second splits the environment on which the agents evolve. Graph partitioning methods are studied for this purpose, and we propose a partitioning procedure specially adapted to the multi-agent traffic simulation. A dynamic load balancing algorithm is also developed to optimize the performance of the microscopic simulation distribution.The proposed solutions have been tested on a real network representing the Paris-Saclay area.These solutions are generic and can be applied to most existing simulators.The results show that the distribution of the agents greatly improves the performance of the macroscopic simulation, whereas the environment distribution is more suited to microscopic simulation. Our load balancing algorithm also significantly improves the efficiency of the environment based distribution
Scarlato, Michele. "Sicurezza di rete, analisi del traffico e monitoraggio." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3223/.
Повний текст джерелаSun, Kung-Hong, and 孫冠宏. "The Design of a Router in 2D Mesh Distributed Memory Multiprocessors." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/18386988635812312710.
Повний текст джерелаHuang, Ming-Chuan, and 黃銘傳. "The Design of an Intelligent Message Router for Distributed Memory Multicomputer System." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/76413998695567360011.
Повний текст джерела國立交通大學
資訊工程研究所
82
Distributed memory multicomputers have recently offered an effective approach to supercomputing by connecting a large number of low-cost processors. Processes running on these processors of distributed memory multicomputers communicate with each other through message passing to achieve the goals of synchonization and data sharing. Unfortunately, few of the contemporary processors support message transmission mechanisms, thus, the start-up delay dominates the communication latency. Moreover, in a multi-hop topology multicomputer system, the routing processes also severely affect the normal computation jobs of the intermediate processors along the routing path. In this project, we design a hardware intelligent message router which can be used to reduce the message transmission start-up delay and off-load the burden of the processors from the normal computation. Besides, the proposed processor/router interface enables this message router to accommodate to heterogeneous processors in the distributed memory multicomputer system. This intelligent message router is implemented and simulated under the environment of Verilog-XL. The simulation result shows that the message router significantly reduces the start-up delay. And we also show how to prevent the intermediate processors from being interfered by using this intelligent message router.
Chen, Dai-Jyun, and 陳岱君. "Design and Implementation of High Availability Heterogeneous Load Balancers on OpenStack cloud with Distributed Virtual Router." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/4vv4ej.
Повний текст джерела國立交通大學
資訊科學與工程研究所
106
In order to prevent the network node from being the bottleneck and SPOF of the OpenStack architecture, OpenStack proposed the concept of distributed virtual router(DVR). By distributing the virtual router into compute nodes, most of the network traffic no longer needs to go through the network node and thus reduces the load of the network node. However, while using the load balancing service of OpenStack, traffic cannot go directly from the Internet to the computing node where the server is located. Instead, traffic needs go through LBaaS Namespace or Octavia amphorae VM before being distributed to servers by the load balancer. DVR cannot play a part and network node (or one of the compute nodes) will still be the bottleneck of OpenStack. To solve the issue, we refer to Octavia and propose an active-active high availability load balancing architecture. The new architecture will use multiple VM-based load balancers to run simultaneously on each compute node, so traffic visiting load balancers will be distributed to load balancers without centralizing through one node. In this paper we will implement the new load balancing architecture on OpenStack with DVR play in part.
Biswas, Amitava. "Semantic Routed Network for Distributed Search Engines." Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7942.
Повний текст джерелаRupp, Norbert. "Distributed route planning and control of automated handling systems." 1996. http://catalog.hathitrust.org/api/volumes/oclc/36375630.html.
Повний текст джерелаTypescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 154-159).
Huang, Yung-chia, and 黃勇嘉. "Route Assignment for Distributed Leased Lines in Mobile Cellular Network." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/96b387.
Повний текст джерела國立中山大學
資訊管理學系研究所
95
When a large number of base stations fail due to the breakdown of some transmission circuit in a mobile cellular network, base stations located in neighboring areas may take over those malfunctioned base stations and continue to provide the access service of mobile communications for users in surrounding areas, thereby reducing the area in which mobile communications are out of service. Therefore, if leased circuits in base stations could complete the route distribution configuration prior to the onset of malfunction, it could decrease the impact of circuit breakdown and traffic loss. Also, the efficiency would be improved if the circuit assignment personnel could complete the job when the leased lines are less, while avoiding reassignment in the future and enhancing the mobile communications operations. In this study, we use a graph structure to represent the present mobile cellular network and establish the route-selection strategies. We define the "Optimal Route Assignment" for a newly constructed base station, which refers to the route assignment that causes least impact on disconnection area when any circuit in the network is broken. We also propose to use A* algorithm for optimal route assignment. However, the computation for the optimal route is time consuming. Measures such as computation time and least hops are considered in designing other strategies for route assignment. These strategies are parametric and we carried out experiments by adjusting and controlling parameters using real routing data. The experimental results demonstrate that there is no single winner among the proposed strategies. We identify a number of best strategies for different operating regions.
Laksmono, Tinna, and 賴美珍. "Route Optimization using the Distributed Binding Update for Nested Mobile Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/79856198560610903611.
Повний текст джерела國立臺灣科技大學
資訊工程系
97
Many researches on network mobility management nowadays have been done to support movement of a mobile network, including the network mobility basic support protocol (NEMO BSP) [7], the reverse routing header (RRH) [24], and the hierarchical mobile network binding (HMNB) [12]. However, NEMO BSP has many limitations, e.g., pinball routing problem, lack of intra-domain data communication, etc. As for RRH, it suffers from a binding update (BU) storm when the root mobile router (MR) handover occurs. Likewise, a lot of signaling overheads and a long handover delay occur in HMNB. To support route optimization and intra-domain data communication without a BU storm, a too long handover delay, and too many signaling overheads, a solution using subtree list and routing tables is proposed in this paper. This solution uses subtree list tables and a distributed manner to inform all home agents (HAs) associated with the care of address (CoA) of the new root-MR to avoid a BU storm with fewer signaling overheads and a shorter handover delay. Applying the derived analytical results, we demonstrate that the proposed solution can outperform NEMO BSP, RRH, and HMNB.
Hamzeh, Wissam. "Une architecture parallèle distribuée et tolérante aux pannes pour le protocole interdomaine BGP au cœur de l’Internet." Thèse, 2010. http://hdl.handle.net/1866/5072.
Повний текст джерелаThe increasing number of end users has led to an exponential growth in the Internet routing table. The routing table is expected to reach a size of one million prefixes within the coming few years. Besides, current core routers may easily attain hundreds of connected BGP peers simultaneously. In classical monolithic architecture, the BGP protocol runs as a single entity inside the router. This architecture suffers from two drawbacks: scalability and reliability. BGP scalability can be measured in terms of the number of connected peers that can be handled and the size of the routing table. On the other hand, the reliability is a critical issue in core routers. If the BGP instance inside the router fails, all peers’ connections will shutdown and the new reachability state will be propagated across the Internet in a non trivial convergence delay. Although, in current core routers, the resiliency is increased considerably, it’s mainly implemented via a primary-backup redundancy scheme which limits the BGP scalability. In this thesis we address the two mentioned BGP drawbacks by proposing a novel distributed approach to increase both scalability and reliability of BGP without changing the semantic of the protocol. The BGP distributed architecture in the first paper is built to satisfy both requirements: scalability and reliability by adequately exploiting parallelism and module separation. In our model, BGP functionalities are split in a master-slave manner and the RIB (Routing Information Base) is replicated to multiple controller cards, to form a cluster of parallel computing entities. In the second paper, we address the fault tolerance of BGP within the distributed architecture presented in the first paper. We prove analytically that, by adopting the distributed architecture of BGP the availability of BGP will be increased considerably versus a monolithic architecture. In the third paper we propose a distributed parallel scheme called DRTP to partition the BGP routing table on multiple controller cards. DRTP aims at increasing the BGP scalability and the parallelization of the Best Match Prefix algorithm.
Ribeiro, Diogo Pereira. "Implementation of an API for distributed communication between processes in closed contexts." Master's thesis, 2012. http://hdl.handle.net/1822/19880.
Повний текст джерелаExistem atualmente diversas Application Programming Interfaces (APIs) que ajudam na programação de aplicações distribuídas. Na maior parte dos casos, estas utilizam de forma in exível um único tipo de protocolo aplicacional e interface, cando dependente dos protocolos de transporte já existentes e do sistema operativo. Para o programador, a stack de protocolos e o tipo de interface têm que ser decididos explicitamente antes do estabelecimento da comunicação entre os processos. Algumas APIs facilitam a programação ocultando alguns aspetos espec í cos dos mecanismos e protocolos de comunicação utilizados, disponibilizando uma interface mais homogeneizada. No entanto, a programação continua a não ser totalmente transparente e independente dos protocolos de comunicação utilizados, dos sistemas operativos e da localização relativa dos processos comunicantes. Além disso, estas APIs não tomam decisões sobre o mecanismo de comunicação a utilizar quando existem várias alternativas possíveis, sendo esta decisão da responsabilidade do programador. Num contexto de implementação de simuladores distribuídos e modulares para protocolos de redes de computadores e sistemas de comunicação, seria vantajoso poder-se utilizar uma API para comunicação dos processos de simulação que disponibilizasse apenas um único interface de programação e que decidisse de forma transparente o mecanismo ou protocolo comunicacional mais e ciente, tendo em conta a localização relativa dos processos. Nesta dissertação são abordadas as soluções semelhantes já existentes e é estudada uma API que pretende preencher estas lacunas. A arquitetura desta API será depois apresentada, assim como uma solução com base na investigação realizada. Por m, os resultados dos testes serão analizados e a conclusão apresentada. Esta dissertação foi desenvolvida no contexto do projeto RoutUM, um simulador de redes de computadores atualmente a ser desenvolvido pela Universidade do Minho.
There are several Application Programming Interfaces (APIs) available to simplify the development of distributed applications. In most cases, they invariably use one type of application protocol and interface, being dependent of the existing transport protocols and operating system. To the programmer, the protocol stack and the type of interface must be explicitly chosen before initiating communication between processes. Some APIs simplify programming by hiding some speci c aspects about the communication protocols and mechanisms, revealing a more homogenized interface. However, the programming is still not completely transparent and independent from the communication protocols, the operating system and the relative location of the communicating processes. Also, they are unable to decide which communication mechanism to be used when there are several available possibilities, leaving that responsibility to the programmer. On the context of implementation of distributed and modular simulators for network protocols and communication systems, it would be desirable to be able to use an API that would allow communication between the processes while providing only one programming interface. It would then transparently decide the most e cient mechanism or communication protocol from the relative location of the communicating processes. This dissertation will present and discuss the currently available solutions and the problems associated with the development of an API which attempts to ll the missing features indicated above. The API's architecture will then be shown and developed into a solution based on the results from the investigation. In the end, this solution will be tested and the nal results will be presented. This dissertation was developed in the context of the RoutUM project, a network simulator being currently developed in the University of Minho.
Χρυσούλας, Χρήστος. "Ανάπτυξη, σχεδιασμός και υλοποίηση δικτυακών συστημάτων διαχείρισης πόρων και παροχής υπηρεσιών". Thesis, 2009. http://nemertes.lis.upatras.gr/jspui/handle/10889/2968.
Повний текст джерелаOwing to the increase in both heterogeneity and complexity in today’s networking systems, the need arises for new network-based services architectures. They must provide flexibility and efficiency in the definition, deployment and execution of the services and, at the same time, handle the adaptability and evolution of such services. In this paper we present an approach that applies a Web-service-based resource management framework. It enables the provision of parallel applications as QoS-aware applications, whose performance characteristics may be dynamically negotiated between a client application and service providers. Our component model allows context dependencies to be explicitly expressed and dynamically managed with respect to the hosting environment, computational resources and dependencies on other components. In such a model the resource management, in terms of representation, allocation and management of the resources, plays a vital role regarding the efficiency of the entire dynamic service deployment architecture. Network and service management fields nowadays find themselves at crossroads with middleware technologies, new network architectures and emerging research directions. Middleware technologies like Web services have reached maturity and enjoy wide deployment and adoption. Network architectures and infrastructures built for different purposes are well on their way towards IP convergence, giving rise to new integrated and more complex architectures. Finally, recent ambitious research directions like autonomic computing and communications have already made a dynamic appearance in the networking community, increasing the challenges even further. This activity has coincided with the end of an era in network and service management during which vast experience has been accumulated and numerous lessons have been learned. It is based on what constitutes the past state of the art in telecommunications and in data networks, realized by many as CORBA-based distributed management platforms and SNMP-based platforms, respectively. This produces speculation and activity about redefining/reassessing the initial requirements that drove the developments in network and service management in the past and about the ‘shape’ of management when projected into the future. As network infrastructure is shifting towards service-centric networks, a number of architectural characteristics are likely to influence management operations and functionality and dictate specific choices of technologies for the realization thereof. In our opinion, three such characteristics are going to play a crucial role in the coming years: • Federated network architectures. In an effort to provide seamless end-to-end connectivity that meets customer demands, networks/service providers have started forming federations of networks wherein a number of operations, such as AAA (Authentication, Authorization, and Accounting), monitoring and SLA (Service-Level Agreement) support, are treated in a homogeneous way in a heterogeneous environment. • Network architectures with distinct separation of concerns. The most representative example is the separation of control from the forwarding plane, which allows the two to evolve separately. The binding element between the two is a set of open interfaces that abstract functionality and allow access to vendor-independent functionalities and resources. • Distributed network node architectures. Individual network nodes and other devices are clustered together to form more complex and extensible distributed architectures that operate as one integrated node. Such constellations provide the means of adding resources as needed and foster dynamic service deployment, namely the injection of new functionality into the network. In such a context, management faces a number of challenges originating from the increasing complexity and size of networks, the heterogeneity of devices and technologies that must coexist, and the high degree of flexibility required in services. The common denominator is the management functionality that injects services and components on demand and configures the network end-to-end. Unless we address these challenges with sufficient and complete technical solutions first, it is difficult to see how new research initiatives, e.g. autonomic networking, can be brought to a successful outcome. This has been the primary motivation of our research presented in this thesis, which touches upon these issues by exploring potential solutions on the service deployment and network configuration within a network architecture, called FlexiNET, that bears the aforementioned architectural characteristics. We have based our designs on Web services as the de facto standard technology in networks with high integration capability and one of the most promising approaches to future management technologies. Our research has been carried out as part of the FlexiNET European Union IST research project, and we have developed the Dynamic Service Deployment (DSD) functionality, hosted by the FlexiNET Wireless Access Node (FWAN), one of the key architectural components of the FlexiNET architecture.