دانلود و نمایش مقالات مرتبط با Routing::صفحه 7
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Routing

تعداد مقالات یافته شده: 163
ردیف عنوان نوع
61 Simulation-based multi-objective model for supply chains with disruptions in transportation
شبیه سازی مبتنی بر مدل چند هدفه برای زنجیره تامین با اختلال در حمل و نقل-2017
Unpredictable disruptions (e.g., accidents, traffic conditions, among others) in supply chains (SCs) mo tivate the development of decision tools that allow designing resilient routing strategies. The transpor tation problem, for which a model is proposed in this paper, consists of minimizing the stochastic transportation time and the deterministic freight rate. This paper extends a stochastic multi-objective minimum cost flow (SMMCF) model by proposing a novel simulation-based multi-objective optimization (SimMOpt) solution procedure. A real case study, consisting of the road transportation of perishable agricultural products from Mexico to the United States, is presented and solved using the proposed SMMCF-Continuous/SimMOpt solution framework. In this case study, time variability is caused by the inspection of products at the U.S.-Mexico border ports of entry. The results demonstrate that this fra mework is effective and overcomes the limitations of the multi-objective stochastic minimum cost flow problem (which becomes intractable for large-scale instances).
Keywords: Minimum cost flow | Simulated annealing | Simulation optimization | Stochastic multi-objective optimization | Resilient supply chains
مقاله انگلیسی
62 Hybrid of anomaly-based and specification-based IDS for Internet of Things using unsupervised OPF based on MapReduce approach
ترکیبی از IDS مبتنی بر ناهنجاری و مبتنی بر مشخصات برای اینترنت اشیا با استفاده از opf بدون نظارت مبتنی بر رویکرد MapReduce -2017
Internet of Things (IoT) is a novel paradigm in computer networks in which resource-constrained objects connect to unreliable Internet by using a wide range of technologies. The insecure nature of the Inter net and wireless sensor networks, that are the main components of IoT, make IoT vulnerable to different attacks, especially routing attacks (as insider attacks). A novel real-time hybrid intrusion detection frame work is proposed in this study that consists of anomaly-based and specification-based intrusion detection modules for detecting two well-known routing attacks in IoT called sinkhole and selective-forwarding at tacks. For this purpose, the specification-based intrusion detection agents, that are located in the router nodes, analyze the behavior of their host nodes and send their local results to the root node through normal data packets. In addition, an anomaly-based intrusion detection agent, that is located in the root node, employs the unsupervised optimum-path forest algorithm for projecting clustering models by us ing incoming data packets. This agent, which is based on the MapReduce architecture, can work in a distributed platform for projecting clustering models and consequently parallel detecting of anomalies as a global detection approach. The proposed method makes decision about suspicious behavior by us ing a voting mechanism. Notably, the proposed method is also extended to detect wormhole attack. The deployment of the hybrid proposed model is investigated in a smart-city scenario by an existing plat form, as well. The free network’s scale and the ability to identify malicious nodes are two key features of the proposed framework that are evaluated through different experiments in this study. The experi mental results of simulated scenarios showed that the proposed hybrid method can achieve true positive rate of 76.19% and false positive rate of 5.92% when both sinkhole and selective-forwarding attacks were launched simultaneously. These rates in detecting wormhole attack are 96.02% and 2.08%, respectively.
Keywords: Internet of Things | Unsupervised optimum-path forest | Anomaly-based intrusion detection | Specification-based intrusion detection | MapReduce
مقاله انگلیسی
63 Information attacks and security in wireless sensor networks of industrial SCADA systems
حملات و امنیت اطلاعات در شبکه های حسگر بی سیم سیستم های صنعتی SCADA -2017
The effectiveness of automated process control systems (APCS) and supervisory control and data acqui sition systems (SCADA) information security depends on the applied protection technologies of transport environment data transmission components. This article investigates the problems of detecting attacks in wireless sensor networks (WSN) of SCADA systems. As a result of analytical research the authors de veloped the detailed classification of external attacks and intrusion detection in sensor networks and brought a detailed description of attacking impacts on components of SCADA systems in accordance with the selected directions of attacks. The cryptographic encryption tasks in the wireless sensor networks have been resolved by means of the built-in mechanism for symmetric AES encryption with 128 bit keys according to the ZigBee Pro Feature Set specification. However, analysis of the current state in the field of security of wireless sensor networks has shown that the key management problem is almost no solved. The article considers the problems and objectives of key management for data encryption in wireless sensor networks (WSN) of SCADA systems. The structure of the key information in the ZigBee network and methods of keys obtaining are discussed. The use of a hybrid key management schemes is most suit able for WSN. The session symmetric key is used to encrypt the sensor data, asymmetric keys are used to encrypt the session key transmitted from the routing information. Three algorithms of hybrid key man agement using routing information frames determined by routing methods and the WSN topology are presented.
Keywords: Information security | SCADA system | Wireless sensor network | Network attacks | Attacks detection | Intrusion detection system | Key anagement | Data encryption | Routing protocol
مقاله انگلیسی
64 Cognitive routing protocol for disaster-inspired Internet of Things
پروتکل مسیریابی شناختی برای اینترنت اشیاء فاجعه - الهام -2017
In this paper, we propose a framework for data delivery in large-scale networks for disaster management, where numerous wireless sensors are distributed over city traffic-infrastructures, shopping-malls’ parking areas, airports’ facilities, etc. In general, our framework caters for energy-efficient applications in the Internet of Things (IoT) where data is propagated via relays from diverse sensor-nodes towards a gateway connected to a large-scale network such as the Internet. We consider the entire network energy while choosing the next hop for the routed packets in the targeted wireless sensor network. Our delivery approach considers resource limitations in terms of hop count, and remaining-energy levels. Extensive simulations are performed and achieved results confirm the effectiveness of the proposed approach in comparison to other baseline energy-aware routing protocols in the literature.
Keywords: IoT | Data routing | Smart-cities | Energy-efficiency
مقاله انگلیسی
65 A packet priority intimation-based data transmission for congestion free traffic management in wireless sensor networks
اولویت بسته انتقال داده های مبتنی بر نشانه برای مدیریت ترافیک رایگان ناشی از ازدحام در شبکه های حسگر بی سیم-2017
Congestion in Wireless Sensor Networks (WSN) reduces network performance by lowering throughput and increasing delay in transmitting packets. Many WSN applications rely on timely transmission of information to the destination. In such networks congestion con trol mechanisms play an important role to protract network lifetime, improve fairness and Quality of Service(QOS) in terms of throughput, packet delivery ratio and end-to-end de lay. This paper proposes packet priority intimation-based (PPI) congestion control mech anism. We introduce a PPI bit in each packet to reflect its importance. Main objective of this mechanism is to send higher priority packets with minimum delay. The proposed PPI mechanism is deployed in the existing AODV routing protocol to convert the existing rout ing protocol to a congestion aware routing protocol. The performance of the proposed ap proach is simulated in Network Simulator (NS2) software and the efficiency is verified. The simulation results are compared with that of an existing approach.
Keywords: Congestion control | Wireless sensor network | Traffic management | Packet priority | Data transmission
مقاله انگلیسی
66 The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains
مشکل موجودی مسیریابی اقلام حمل و نقل برگشت پذیر با پنجره های زمان و تحویل و تحویل همزمان در زنجیره تامین حلقه بسته-2017
Reducing environmental impact, related regulations and potential for operational benefits are the main reasons why companies share their returnable transport items (RTIs) among the different partners of a closed-loop supply chain. In this paper, we consider a producer, located at a depot, who has to distribute his products packed in RTIs to a set of customers. Customers define a time window wherein the service can begin. The producer is also in charge of the collection of empty RTIs for reuse in the next production cycle. Each partner has a storage area composed of both empty and loaded RTI stock, as characterized by initial levels and maximum storage capacity. As deliveries and returns are performed by a homogeneous fleet of vehicles that can carry simultaneously empty and loaded RTIs, this research addresses a pickup and delivery inventory-routing problem within time windows (PDIRPTW) over a planning horizon. A mixed-integer linear program is developed and tested on small-scale instances. To handle more realistic large-scale problems, a cluster first-route second matheuristic is proposed.
Keywords: Returnable transport item | Closed-loop supply chain | Inventory routing problem | Pickups and deliveries | Time windows
مقاله انگلیسی
67 Collection-disassembly problem in reverse supply chain
مشکل مجموعه جداسازی قطعات در زنجیره تامین معکوس-2017
The reverse supply chain and disassembly processes are getting more and more important for tackling the burden of waste electrical and electronic equipment. The disassemblys complexity and frequent manual operation makes this process relatively expensive compared to its potential profit. The collection of end-of-life product is also a big issue dealing with vehicle routing. Thus, the decisions taken for collection and disassembly of end-of-life products need to be optimised. In this work, an optimisation model is developed for incorporating these problems. Our experimental study shows joint optimisation of collection and disassembly with coordination between them improves the global performance of the reverse supply chain including lower total cost corresponding to the component demand satisfaction.
Keywords: Routing | Production | Collection | Disassembly | Reverse supply chain | Waste electrical and electronics equipment
مقاله انگلیسی
68 A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
جستجوی همسایگی متغیر برای برنامه ریزی قطار سریع و مسیریابی در شرایط ترافیکی ناشی از ترافیک-2017
This paper focuses on the development of metaheuristic algorithms for the real-time traffic management problem of scheduling and routing trains in complex and busy railway networks. This key optimization problem can be formulated as a mixed integer linear program. However, since the problem is strongly NP-hard, heuristic algorithms are typically adopted in practice to compute good quality solutions in a short computation time. This paper presents a number of algorithmic improvements implemented in the AGLIBRARY optimization solver in order to improve the possibility of finding good quality solutions quickly. The optimization solver manages trains at the microscopic level of block sections and at a precision of seconds. The solver outcome is a detailed conflict-free train schedule, being able to avoid deadlock situations and to minimize train delays. The proposed algorithmic framework starts from a good initial solution for the train scheduling problem with fixed routes, obtained via a truncated branch and-bound algorithm. Variable neighbourhood search or tabu search algorithms are then applied to improve the solution by re-routing some trains. The neighbourhood of a solution is characterized by the set of candidate trains to be re-routed and the available routes. Computational experiments are per formed on railway networks from different countries and various sources of disturbance. The new algorithms often outperform a state-of-the-art tabu search algorithm and a commercial solver in terms of reduced computation times and/or train delays.
Keywords: Real-time railway traffic management | Train scheduling and routing | Alternative graph | Disjunctive programming | Branch-and-bound | Variable neighbourhood search | Tabu search
مقاله انگلیسی
69 Design and analysis of optimization algorithms to minimize cryptographic processing in BGP security protocols
طراحی و تجزیه و تحلیل الگوریتم های بهینه سازی برای به حداقل رساندن پردازش رمزنگاری در پروتکل های امنیتی BGP-2017
The Internet is subject to attacks due to vulnerabilities in its routing protocols. One proposed approach to attain greater security is to cryptographically protect network reachability announcements exchanged between Border Gateway Protocol (BGP) routers. This study proposes and evaluates the performance and efficiency of various optimization algorithms for validation of digitally signed BGP updates. In particular, this investigation focuses on the BGPSEC (BGP with SECurity extensions) protocol, currently under consid eration for standardization in the Internet Engineering Task Force. We analyze three basic BGPSEC update processing algorithms: Unoptimized, Cache Common Segments (CCS) optimization, and Best Path Only (BPO) optimization. We further propose and study cache management schemes to be used in conjunction with the CCS and BPO algorithms. The performance metrics used in the analyses are: (1) routing table convergence time after BGPSEC peering reset or router reboot events and (2) peak-second signature veri fication workload. Both analytical modeling and detailed trace-driven simulation were performed. Results show that the BPO algorithm is 330% to 628% faster than the unoptimized algorithm for routing table convergence in a typical Internet core-facing provider edge router.
Keywords: Routing security | Border Gateway Protocol security | BGPSEC | Performance optimization | Route processor efficiency
مقاله انگلیسی
70 A new elastic trickle timer algorithm for Internet of Things
الگوریتم تایمر جدید الاستیک برای اینترنت اشیاء -2017
The term IoT emerging services is used to refer to the modern kinds of services that IoT can provide to enhance service and experience quality by reducing complexity, speeding up requests, and using techniques involved with cloud, Big Data, and protocols to allows services to function seamlessly. Therefore, IoT utilises protocols found within different network layers. RPL or Routing Protocol for Low Power and Lossy Networks is one of the most important routing protocols utilised on the network layer. This protocol is considered an IPV6 distance vector proactive routing protocol. The trickle timer algorithm is one of its major components. This algorithm is used to control and track the control messages’ flow throughout the network. However, one weakness of the trickle algorithm is that it suffers from short listen problem that makes some nodes starve for delay and long latency in propagating transmissions. Based on existing literature, there have been several research studies on this trickle method. Development of the Enhanced Trickle algorithm (E-Trickle) was done to get rid of the listen only period. However, there still is relatively low activity on studying the trickle algorithm’s performance merits. Our proposed elastic trickle timer algorithm will try to fill this gap by dealing only with the listen to only period problems. The power consumption and convergence time are mainly affected. Therefore, our proposed algorithm was incorporated in the Routing Protocol for Low Power and Lossy Networks (RPL). Different network densities were used to evaluate the simulation experiments. Its implementation was done on 20, 40, 60, and 80 nodes using different ratios for reception success (RX) (20%, 40%, 60%, 80%, and 100%), and grid network and random topologies were used. The Cooja 2.7 simulator was used to implement the simulation experiments, and RPL performance was studied through the elastic trickle timer algorithm. Measurement of the simulation experiments was done on various performance metrics such as packet delivery ratio (PDR), convergence time, and power consumption. Comparison of the results was done using the standard trickle timer algorithm. Using random and grid topologies, the results revealed greater enhancements in terms of convergence time. Simulation results revealed that when the network was made up of 20 nodes, there was 35% less convergence time. Moreover, when 40 nodes were randomly placed, there was 62% less convergence time, and 71% less convergence time when 40 nodes were situated in a grid topology. Additionally, there was 70% less convergence time when the network was made up of 60 nodes and approximately 76% less convergence time when there were 80 nodes. Moreover, the simulation results revealed that in terms of energy consumption, the new algorithm exhibited superior performance characteristics.
Keywords: Internet of Things | IoT | Routing protocol for low power and lossy | networks | RPL | Trickle timer algorithm | Emerging services
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 817 :::::::: بازدید دیروز: 3084 :::::::: بازدید کل: 3901 :::::::: افراد آنلاین: 14