Bibliografias temáticas / Distributed packet routing

Literatura científica selecionada sobre o tema "Distributed packet routing"

Autor: Grafiati
Publicado: 31 de agosto de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Índice

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Distributed packet routing".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Distributed packet routing"

1

Al-Jabry, Hanadi, e Hamid Al-Asadi. "Enhancing Packet Reliability in Wireless Multimedia Sensor Networks using a Proposed Distributed Dynamic Cooperative Protocol (DDCP) Routing Algorithm". Iraqi Journal for Electrical and Electronic Engineering 19, n.º 2 (18 de agosto de 2023): 158–68. http://dx.doi.org/10.37917/ijeee.19.2.18.

Texto completo da fonte
Resumo:
Wireless Multimedia Sensor Networks (WMSNs) are being extensively utilized in critical applications such as environmental monitoring, surveillance, and healthcare, where the reliable transmission of packets is indispensable for seamless network operation. To address this requirement, this work presents a pioneering Distributed Dynamic Cooperation Protocol (DDCP) routing algorithm. The DDCP algorithm aims to enhance packet reliability in WMSNs by prioritizing reliable packet delivery, improving packet delivery rates, minimizing end-to-end delay, and optimizing energy consumption. To evaluate its performance, the proposed algorithm is compared against traditional routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), as well as proactive routing protocols such as Optimized Link State Routing (OLSR). By dynamically adjusting the transmission range and selecting optimal paths through cooperative interactions with neighboring nodes, the DDCP algorithm offers effective solutions. Extensive simulations and experiments conducted on a wireless multimedia sensor node testbed demonstrate the superior performance of the DDCP routing algorithm compared to AODV, DSR, and OLSR, in terms of packet delivery rate, end-to-end delay, and energy efficiency. The comprehensive evaluation of the DDCP algorithm against multiple routing protocols provides valuable insights into its effectiveness and efficiency in improving packet reliability within WMSNs. Furthermore, the scalability and applicability of the proposed DDCP algorithm for large-scale wireless multimedia sensor networks are confirmed. In summary, the DDCP algorithm exhibits significant potential to enhance the performance of WMSNs, making it a suitable choice for a wide range of applications that demand robust and reliable data transmission.
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Ke, Yun, e Yan Li. "Distributed Intrusion Detection and Research of Fragment Attack Based-on IPv6". Advanced Materials Research 268-270 (julho de 2011): 1797–801. http://dx.doi.org/10.4028/www.scientific.net/amr.268-270.1797.

Texto completo da fonte
Resumo:
IPv6, the address has to aggregation, thus greatly reducing the length of the routing equipment routing table to improve the efficiency of routing and security, but then there is any possibility of network intrusion attack. This paper used to implement IPv6 Snort intrusion detection software, intrusion detection system is proposed as long as the server itself TCP / IP stack on the handling of data packets are different, the packet will bypass the intrusion detection system from the ground to produce a TCP fragment attack.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

HUC, FLORIAN, IGNASI SAU e JANEZ ŽEROVNIK. "(ℓ, k)-ROUTING ON PLANE GRIDS". Journal of Interconnection Networks 10, n.º 01n02 (março de 2009): 27–57. http://dx.doi.org/10.1142/s0219265909002431.

Texto completo da fonte
Resumo:
The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the (ℓ, k)-routing problem, each node can send at most ℓ packets and receive at most k packets. Permutation routing is the particular case ℓ = k = 1. In the r-central routing problem, all nodes at distance at most r from a fixed node v want to send a packet to v. In this article we study the permutation routing, the r-central routing and the general (ℓ, k)-routing problems on plane grids, that is square grids, triangular grids and hexagonal grids. We use the store-and-forward Δ-port model, and we consider both full and half-duplex networks. We first survey the existing results in the literature about packet routing, with special emphasis on (ℓ, k)-routing on plane grids. Our main contributions are the following: 1. Tight permutation routing algorithms on full-duplex hexagonal grids, and half duplex triangular and hexagonal grids. 2. Tight r-central routing algorithms on triangular and hexagonal grids. 3. Tight (k, k)-routing algorithms on square, triangular and hexagonal grids. 4. Good approximation algorithms (in terms of running time) for (ℓ, k)-routing on square, triangular and hexagonal grids, together with new lower bounds on the running time of any algorithm using shortest path routing. These algorithms are all completely distributed, i.e., can be implemented independently at each node. Finally, we also formulate the (ℓ, k)-routing problem as a WEIGHTED EDGE COLORING problem on bipartite graphs.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Chen, Kang, e Haiying Shen. "Greedyflow: Distributed greedy packet routing between landmarks in DTNs". Ad Hoc Networks 83 (fevereiro de 2019): 168–81. http://dx.doi.org/10.1016/j.adhoc.2018.09.010.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Cavalieri, S., A. Di Stefano e O. Mirabella. "Distributed routing in packet-switching networks by counterpropagation network". Applied Intelligence 4, n.º 1 (março de 1994): 67–82. http://dx.doi.org/10.1007/bf00872056.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Ganesh, E. N. "Analysis of Distributed Packet Receiving in ADHOC Network Using Multicast Routing Protocol". Asian Journal of Computer Science and Technology 5, n.º 2 (5 de novembro de 2016): 17–23. http://dx.doi.org/10.51983/ajcst-2016.5.2.1769.

Texto completo da fonte
Resumo:
The main purpose multicast routing protocol in MANET is to deliver the data to a group of receivers. Several researchers are proposed various multicast routing protocols to achieve the reliability and scalability in MANET. MANET suffers from high overhead and redundant data transmission due to multicasting. We propose a neural network based multicast routing protocol to overcome the highest overhead and delay thereby network life time and packet delivery ratio (PDR) are improved. This is achieved by identifying the probability of optimum forwarding group node based on the information augmented with the JOIN_QUERY packet. The performance evolution shows the proposed approach ensures the PDR and reducing the control overhead significantly.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Batool, Rida, Nargis Bibi, Samah Alhazmi e Nazeer Muhammad. "Secure Cooperative Routing in Wireless Sensor Networks". Applied Sciences 14, n.º 12 (16 de junho de 2024): 5220. http://dx.doi.org/10.3390/app14125220.

Texto completo da fonte
Resumo:
In wireless sensor networks (WSNs), sensor nodes are randomly distributed to transmit sensed data packets to the base station periodically. These sensor nodes, because of constrained battery power and storage space, cannot utilize conventional security measures. The widely held challenging issues for the network layer of WSNs are the packet-dropping attacks, mainly sinkhole and wormhole attacks, which focus on the routing pattern of the protocol. This thesis presents an improved version of the second level of the guard to the system, intrusion detection systems (IDSs), to limit the hostile impact of these attacks in a Low Energy Adaptive Clustering Hierarchy (LEACH) environment. The proposed system named multipath intrusion detection system (MIDS) integrates an IDs with ad hoc on-demand Multipath Distance Vector (AOMDV) protocol. The IDS agent uses the number of packets transmitted and received to calculate intrusion ratio (IR), which helps to mitigate sinkhole attacks and from AOMDV protocol round trip time (RTT) is computed by taking the difference between route request and route reply time to mitigate wormhole attack. MATLAB simulation results show that this cooperative model is an effective technique due to the higher packet delivery ratio (PDR), throughput, and detection accuracy. The proposed MIDS algorithm is proven to be more efficient when compared with an existing LEACH-based IDS system and MS-LEACH in terms of overall energy consumption, lifetime, and throughput of the network.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Yu, Yao, Yuhuai Peng, Xiaoling Li, Jinfeng Gao e Xiaozhu Cong. "Distributed packet-aware routing scheme based on dynamic network coding". China Communications 13, n.º 10 (outubro de 2016): 20–28. http://dx.doi.org/10.1109/cc.2016.7732009.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Saad, Hadeel Noori. "Source routing: Best rout using genetic algorithm". Journal of Kufa for Mathematics and Computer 1, n.º 2 (30 de outubro de 2010): 35–45. http://dx.doi.org/10.31642/jokmc/2018/010204.

Texto completo da fonte
Resumo:
The success of distributed multimedia traffic presents many challenges to the network designer, certain bandwidth as well as bounds on delay, loss probability and jitter in order to maintain reception quality are issues of Constraint Base Routing (CBR). Flow routing requires deterministic path coordination in comparison with data routing. This paper presents a new technique for best CBR-rout path computation using genetic algorithm. Available bandwidth, delay jitter, and path availability are the fitness function, the genetic algorithm try to optimize. Source routed packets were established to hold the complete elected path in packet header. All studies made on NS2 simulator, where SARBE approach for rapid on-line estimation of available bandwidth shows performance optimization on OSPF algorithm for multimedia streaming applications.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Jin, Jifeng, Feng Tian, Zijian Yang, Hao Di e Guotong Li. "A Disruption Tolerant Distributed Routing Algorithm in LEO Satellite Networks". Applied Sciences 12, n.º 8 (9 de abril de 2022): 3802. http://dx.doi.org/10.3390/app12083802.

Texto completo da fonte
Resumo:
The low earth orbit (LEO) constellation network has become a promising approach to provide global communication services, due to its advantages in wide global coverage, low transmission delay, and convenient networking. However, the instability of the intersatellite laser terminal and the high relative speed between adjacent satellites cause frequent network topology changing problems for data routing. In this paper, a disruption tolerant distributed routing algorithm (DTDR) is proposed, where the satellites calculate the alternate path for transmission when the network topology changes, which improves the performance of packet loss. Specifically, each satellite maintains the intersatellite link (ISL) information within a specified number of hops. When an ISL state changes within the specified number of hops, the corresponding satellite calculates and switches to the detour path. Furthermore, the traffic is balanced through the detour process. Various simulations were constructed and show that the proposed algorithm outperforms the existing algorithm in terms of packet loss ratio and transmission delay.
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Teses / dissertações sobre o assunto "Distributed packet routing"

1

張治昌 e Steven Cheung. "Packet routing on mesh-connected computers". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B3121020X.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Chong, Kheng Huat. "Dynamic routing algorithms for distributed packet-switched data networks". Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391256.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

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.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

MUBEEN, SAAD. "EVALUATION OF SOURCE ROUTING FOR MESH TOPOLOGY NETWORK ON CHIP PLATFORMS". Thesis, Jönköping University, JTH, Computer and Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-9591.

Texto completo da fonte
Resumo:

Network on Chip is a scalable and flexible communication infrastructure for the design of core based System on Chip. Communication performance of a NoC depends heavily on the routing algorithm. Deterministic and adaptive distributed routing algorithms have been advocated in all the current NoC architectural proposals. In this thesis we make a case for the use of source routing for NoCs, especially for regular topologies like mesh. The advantages of source routing include in-order packet delivery; faster and simpler router design; and possibility of mixing non-minimal paths in a mainly minimal routing. We propose a method to compute paths for various communications in such a way that traffic congestion is avoided while ensuring deadlock free routing. We also propose an efficient scheme to encode the paths.

We developed a tool in Matlab that computes paths for source routing for both general and application specific communications. Depending upon the type of traffic, this tool computes paths for source routing by selecting best routing algorithm out of many routing algorithms. The tool uses a constructive path improvement algorithm to compute paths that give more uniform link load distribution. It also generates different types of traffics. We also developed a simulator capable of simulating source routing for mesh topology NoC. The experiments and simulations which we performed were successful and the results show that the advantages of source routing especially lower packet latency more than compensate its disadvantages. The results also demonstrate that source routing can be a good routing candidate for practical core based SoCs design using network on chip communication infrastructure.

Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Thames, John Lane. "Advancing cyber security with a semantic path merger packet classification algorithm". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45872.

Texto completo da fonte
Resumo:
This dissertation investigates and introduces novel algorithms, theories, and supporting frameworks to significantly improve the growing problem of Internet security. A distributed firewall and active response architecture is introduced that enables any device within a cyber environment to participate in the active discovery and response of cyber attacks. A theory of semantic association systems is developed for the general problem of knowledge discovery in data. The theory of semantic association systems forms the basis of a novel semantic path merger packet classification algorithm. The theoretical aspects of the semantic path merger packet classification algorithm are investigated, and the algorithm's hardware-based implementation is evaluated along with comparative analysis versus content addressable memory. Experimental results show that the hardware implementation of the semantic path merger algorithm significantly outperforms content addressable memory in terms of energy consumption and operational timing.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Alliche, Abderrahmane Redha. "Contrôle du réseau cloud basé intelligence artificielle". Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ4022.

Texto completo da fonte
Resumo:
L'explosion du nombre d'utilisateurs d'Internet et du volume de trafic constitue un défi majeur pour la gestion efficace des réseaux de diffusion de contenu (CDN). Bien que ces réseaux aient amélioré leur temps de réponse en exploitant la mise en cache dans des serveurs cloud proches des utilisateurs, les services non mis en cache continuent de poser des problèmes de gestion de trafic. Pour répondre à cette problématique, les réseaux overlay cloud ont émergé, mais ils introduisent des complexités telles que les violations d'inégalités triangulaires (TIV). Dans ce contexte, l'application du paradigme des réseaux à définition logicielle (SDN) combinée aux techniques d'apprentissage par renforcement profond (DRL) offre une opportunité prometteuse pour s'adapter en temps réel aux fluctuations de l'environnement. Face à l'augmentation constante du nombre de serveurs edge, les solutions distribuées de DRL, notamment les modèles d'apprentissage par renforcement profond multi-agent (MA-DRL), deviennent cruciales. Cependant, ces modèles rencontrent des défis non résolus tels que l'absence de simulateurs réseau réalistes, le surcoût de communication entre agents et la convergence et stabilité.Cette thèse se concentre donc sur l'exploration des méthodes MA-DRL pour le routage de paquets dans les réseaux overlay cloud. Elle propose des solutions pour relever ces défis, notamment le développement de simulateurs de réseau réalistes, l'étude du surcoût de communication et la conception d'une solution MA-DRL adaptée aux réseaux overlay cloud. L'accent est mis sur le compromis entre la performance et la quantité d'information partagée entre les agents, ainsi que sur la convergence et la stabilité durant l'entraînement
The exponential growth of Internet traffic in recent decades has prompted the emergence of Content Delivery Networks (CDNs) as a solution for managing high traffic volumes through data caching in cloud servers located near end-users. However, challenges persist, particularly for non-cacheable services, necessitating the use of cloud overlay networks. Due to a lack of knowledge about the underlay network, cloud overlay networks introduce complexities such as Triangle inequality violations (TIV) and dynamic traffic routing challenges.Leveraging the Software Defined Networks (SDN) paradigm, Deep Reinforcement Learning (DRL) techniques offer the possibility to exploit collected data to better adapt to network changes. Furthermore, the increase of cloud edge servers presents scalability challenges, motivating the exploration of Multi-Agent DRL (MA-DRL) solutions. Despite its suitability for the distributed packet routing problem in cloud overlay networks, MA-DRL faces non-addressed challenges such as the need for realistic network simulators, handling communication overhead, and addressing the multi-objective nature of the routing problem.This Ph.D. thesis delves into the realm of distributed Multi-Agent Deep Reinforcement Learning (MA-DRL) methods, specifically targeting the Distributed Packet Routing problem in cloud overlay networks. Throughout the thesis, we address these challenges by developing realistic network simulators, studying communication overhead in the non-overlay general setting, and proposing a distributed MA-DRL framework tailored to cloud overlay networks, focusing on communication overhead, convergence, and model stability
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

"Non-blocking and distributed routing principles in ATM packet switching networks". 1997. http://library.cuhk.edu.hk/record=b6073066.

Texto completo da fonte
Resumo:
by Philip Pak-tung To.
Thesis (Ph.D.)--Chinese University of Hong Kong, 1997.
Includes bibliographical references (p. 126).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Chen, Wei-qun, e 陳偉羣. "Routing-Based Distributed Denial-of-Service Spoofed Packets Filtering". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/81734763733085082213.

Texto completo da fonte
Resumo:
碩士
國立屏東商業技術學院
資訊管理系
93
With the popularity of Internet, the variation of the society is amazing. Internet facilitates the information transmission and globalization. However, some risks emerge immediately. The DDoS attack causes the services of internet in danger. The reason why DDoS hard to deal with is because the attacker source is difficult to track. It uses the spoofed packets to confuse the victim making the real attack source hard to find, and the attacker behind the scenes can using the legitimate or illegitimate traffic to crash the victim’s host. In this paper, we propose a packet filter system to determine the truthfulness of the incoming packets to the host in order to defense the DDoS attack.
Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Distributed packet routing"

1

Gao, Xianming, Xiaozhe Zhang, Zexin Lu e Shicong Ma. "Research on an Adaptive Routing Mechanism of Combination of Packet Forward with Virtual Circuit". In Internet and Distributed Computing Systems, 294–306. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41428-2_24.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Bao, Thai Thach, Hiroaki Morino, Hitoshi Aida e Tadao Saito. "Distributed Input and Deflection Routing Based Packet Switch Using Shuffle Pattern Network". In Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, 74–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45551-5_7.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Huang, Tao, Lixiang Liu e Shuaijun Liu. "IPR-SN: Intelligent Packet Routing in Satellite Networks Based on Distributed Deep Reinforcement Learning". In Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 621–32. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79457-6_53.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Lawniczak, Anna T., Hao Wu e Bruno Di Stefano. "Impact of Coupling of Distributed Denial of Service Attack with Routing on Throughput of Packet Switching Network". In Lecture Notes in Computer Science, 322–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15979-4_34.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

El-Basioni, Basma M. Mohammad, Sherine M. Abd El-Kader, Hussein S. Eissa e Mohammed M. Zahra. "Low Loss Energy-Aware Routing Protocol for Data Gathering Applications in Wireless Sensor Network". In Internet and Distributed Computing Advancements, 272–302. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0161-1.ch011.

Texto completo da fonte
Resumo:
But, as the energy-efficiency is critical for periodical data gathering applications in wireless sensor networks, it has the highest priority in algorithms design; also the latency, packet loss, and throughput are important factors and should be addressed. This chapter proposes a routing protocol inspired by an energy-efficient cluster-based routing protocol called Energy-Aware Routing Protocol (EAP). The new enhanced protocol that is called Low Loss Energy-Aware Routing Protocol (LLEAP) enhances the performance of EAP in terms of some quality of service parameters by adding a second iteration for constructing the tree structure for multi-hop communication among cluster heads, by modifying the used weights of the cluster heads and parent node selection, and finally by selecting suitable aggregation method to decrease losses and delay. Simulation results showed that LLEAP significantly outperforms EAP in terms of packet loss percentage by on average 93.4%.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Kalyanaraman, Kswaminathan. "An Artificial Intelligence Model for Effective Routing in WSN". In Advances in Web Technologies and Engineering, 67–88. IGI Global, 2023. http://dx.doi.org/10.4018/978-1-6684-8306-0.ch005.

Texto completo da fonte
Resumo:
In WSN, sensor nodes will be distributed heterogeneity concerning their basic requirements such as location, power backup, and the distance between the nodes. With these metrics, research is carried on energy conservation, media-based problems, packet aggregation, effective routing, quality of link, etc. But the energy consumption and data processing system in WSN makes a scenario for not using an artificial intelligence (AI)-based system in network structure. In this chapter, a heuristic packet routing (HPR) strategy for effective path identification on the packet transmission between the nodes is given. The proposed methodology also improvises the routing process on diffusion and energy management methodology defined in previous research work. A comprehensive study was done with the help of a network simulator. Based on the result, the work is compared with various research work defined previously.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Murugan, Suriya, e Anandakumar H. "Study of Efficient Hybrid Wireless Networks Using QoS-Oriented Distributed Routing Protocol". In Advances in Social Networking and Online Communities, 213–35. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7522-1.ch011.

Texto completo da fonte
Resumo:
Hybrid networks are next generation of wireless networks that are increasingly used in wireless communications that highly support real time transmission with a limited quality of service. The study proves that existing systems use QoS-oriented distributed routing protocols to enhance the QoS support capability of hybrid networks and it transforms the packet routing problem to a resource scheduling problem which has five algorithms. They are (1) QoS-guaranteed neighbor election algorithm, (2) distributed packet scheduling algorithm, (3) mobility-based segment resizing algorithm, (4) traffic redundant elimination algorithm, and (5) data redundancy elimination-based transmission algorithm. To increase the performance of hybrid networks in a real mobility model, this chapter analyses and devises a method to authenticate data streams for transmission. Data transparent authentication without communication overhead is an approach which reduces breakdown of original data or sends out-of-band authentication information.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Gupta, Sachin Kumar, Aabid Rashid Wani, Santosh Kumar, Ashutosh Srivastava e Diwankshi Sharma. "Wireless Mesh Network Security, Architecture, and Protocols". In Security and Privacy Issues in Sensor Networks and IoT, 1–27. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-0373-7.ch001.

Texto completo da fonte
Resumo:
Due to suppression of central administration in WMN, network functioning like network controls, management, routing, switching, packet forwarding etc. are distributed among nodes, either collectively or individually. So, cooperation among nodes is highly solicited. However, there may exist node's malicious activities because of its open characteristics and limited available battery power. The nodes may misbehave by refusing to provide service or dropping down the packets because of its selfishness and malicious activity. The identification of misbehaving nodes and prevention from them can be one of the biggest challenges. Hence, the prime target of the chapter is to provide an overview of existing intrusion detection and prevention approaches, and secure routing or framework that can recognize and prevent from the malicious activities. The digital signature-based IDS to offer secure acknowledgment and an authentication mechanism has also been discussed. The expectation is the digital signature-based IDS will overcome the weakness of existing IDS.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Alshaer, Hamada, Thierry Ernst e Arnaud de La Fortelle. "A Novel Distributed QoS Control Scheme for Multi-Homed Vehicular Networks". In Transportation Systems and Engineering, 1667–85. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-8473-7.ch079.

Texto completo da fonte
Resumo:
Resource availability in vehicular mobile networks fluctuates due to wireless channel fading and network mobility. Multi-homed mobile networks require a Quality-of-Service (QoS) control scheme that can select a routing path to guarantee high quality of communications with Correspondent Nodes (CNs) while using the maximum available bandwidth of wireless and radio communication technologies. In this chapter, the authors develop an intelligent distributed QoS control scheme which inter-operates between mobile routers, managing vehicular networks mobility, and Road Communication Gateways (RCGs). This proposed scheme manages Vehicle-to-Infrastructure (V2I) communications through enabling multi-homed vehicular networks to optimally distribute traffic among egress links of their mobile routers based on vehicular communication policies and available bandwidth and performance metrics of selected routing paths. This scheme considers the data control plane as a collaborative entity and specifies detailed operations to be performed in the mobile routers and RCGs. Simulation experiments show that the proposed scheme can improve the Congestion Window (CWND) of TCP and the e2e packet loss of video traffic, despite network mobility. It also guarantees the service parameter settings of uplink and downlink connections while achieving reasonable utilization efficiency of network resources and fairly sharing them.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

JayavigneshThyagarajan, Suganthi K e Rajesh G. "A Joint Congestion Control Mechanism Through Dynamic Alternate Route Selection Algorithm in IoT Based Wireless Sensor Network". In Advances in Parallel Computing Algorithms, Tools and Paradigms. IOS Press, 2022. http://dx.doi.org/10.3233/apc220013.

Texto completo da fonte
Resumo:
Internet of Things (IoT) based Wireless Sensor Networks (WSN) comprises several miniaturized sensor nodes limited in terms of transmission range, available battery power and data rate. These nodes work collaboratively to monitor physical/environmental conditions and provide appropriate control action. Congestion has become one of the key issues in WSN because of the increase in multimedia traffic and IoT proliferation in WSN. The higher traffic load can easily lead to link-level or node-level congestion in the network. A joint layer 4/layer 3 driven congestion control distributed algorithm is proposed to detect congestion and thereby avoid congestion through alternate routing. In this work, congestion detection and avoidance method are presented which uses Random Early Discard (RED) scheme, instead of the Droptail Queue. This scheme computes a threshold to avoid further congestion and uses Location Aided Energy Efficient Routing protocol (LAEER) to find the alternate path for routing data packets. As a result, this approach achieves load balancing as it spreads traffic throughout the network. Also, simulation results infer that LAEER shows better results in terms of Quality of Service (QoS) metrics such as PDR in comparison with AODV as it has avoided further packet drops proactively through alternate forwarding neighbor selection.
Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Distributed packet routing"

1

Liboiron-Ladouceur, Odile, e Keren Bergman. "Optical Packet Routing in Distributed Grid Computing Architectures". In 2006 32nd European Conference on Optical Communications - (ECOC 2006). IEEE, 2006. http://dx.doi.org/10.1109/ecoc.2006.4801329.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Chen, Kang, e Haiying Shen. "GreedyFlow: Distributed Greedy Packet Routing between Landmarks in DTNs". In 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, 2015. http://dx.doi.org/10.1109/mass.2015.67.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

You, Xinyu, Xuanjie Li, Yuedong Xu, Hui Feng e Jin Zhao. "Toward Packet Routing with Fully-distributed Multi-agent Deep Reinforcement Learning". In 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT). IEEE, 2019. http://dx.doi.org/10.23919/wiopt47501.2019.9144110.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Lu, Ning, Yulong Wang, Fangchun Yang e Maotong Xu. "A Novel Approach for Single-Packet IP Traceback Based on Routing Path". In 2012 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2012. http://dx.doi.org/10.1109/pdp.2012.40.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Khan, Inam Ullah, Ijaz Mansoor Qureshi, Muhammad Asghar Khan, Syed Bilal Hussain Shah, Imran Shafique Ansari e Muhammad Hamza Akhlaq. "Ant colony based optimization technique to mitigate dynamic routing challenges in packet based networks". In ICFNDS'18: International Conference on Future Networks and Distributed Systems. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3231053.3231117.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Katanekwa, Nicholas, Neco Ventura, Dragos Vingarzan, Marius Corici e Thomas Magedanz. "Enhanced gateway selection for optimal routing in a distributed Evolved Packet Core (EPC) network". In 2013 10th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON 2013). IEEE, 2013. http://dx.doi.org/10.1109/ecticon.2013.6559549.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Khalid, Nor Azimah, Quan Bai e Adnan Al-Anbuky. "An Adaptive Agent-Based Partner Selection for Routing Packet in Distributed Wireless Sensor Network". In 2016 IEEE International Conference on Agents (ICA). IEEE, 2016. http://dx.doi.org/10.1109/ica.2016.019.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Eltaras, Tamer Ahmed, William Fornaciari e Davide Zoni. "Partial Packet Forwarding to Improve Performance in Fully Adaptive Routing for Cache-Coherent NoCs". In 2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2019. http://dx.doi.org/10.1109/empdp.2019.8671582.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Kumari, Priya, e Nitin Jain. "Deep Learning Based QoE-Driven Packet Scheduling and Multipath Routing Using Fractional Coati Optimization". In 2024 Third International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE). IEEE, 2024. http://dx.doi.org/10.1109/icdcece60827.2024.10548281.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Fujiwara, Shohei, Tomoyuki Ohta e Yoshiaki Kakuda. "An Inter-domain Routing for Heterogeneous Mobile Ad Hoc Networks Using Packet Conversion and Address Sharing". In 2012 32nd International Conference on Distributed Computing Systems Workshops (ICDCS Workshops). IEEE, 2012. http://dx.doi.org/10.1109/icdcsw.2012.14.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Você também pode estar interessado nas extensas listas de trabalhos sobre o assunto "Distributed packet routing":
Artigos de revistas
Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!

Vá para a bibliografia