نتایج جستجو برای: west first routing algorithm

تعداد نتایج: 2181528  

Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...

1997
Hui Xie John S. Baras

In this paper, we investigate the performance issue of PNNl routing for ATM networks. A brief introduction to PNNI routing protocol is given. We extend the reduced load approximation algorithm to ATM networks with PNNI routing. A hierarchical reduced load approximation scheme is proposed The scheme includes two steps: the reduced load approximation algorithm is first applied on the aggregated n...

2017

Deadlocks are an important issue in the design of interconnection networks. A successful approach is to restrict the routing function such that it satisfies a necessary and sufficient condition for deadlock-free routing. Typically, such a condition states that some (extended) dependency graph must be acyclic. Defining and proving such a condition is complex. Proving that a routing function sati...

Journal: :International Journal of Computer Applications 2014

Journal: :DEStech Transactions on Computer Science and Engineering 2018

2016

Deadlocks are an important issue in the design of interconnection networks. A successful approach is to restrict the routing function such that it satisfies a necessary and sufficient condition for deadlock-free routing. Typically, such a condition states that some (extended) dependency graph must be acyclic. Defining and proving such a condition is complex. Proving that a routing function sati...

2014
Tingting WANG

In this paper, we investigated the data fusion routing algorithm and the time synchronization algorithm for the wireless sensor networks. First, we proposed a new data fusion routing algorithm Low Energy Consumption Cluster-Based Routing Algorithm (LECCBRA). Simulation results show that the total energy can be effectively saved, and the balance in energy consumption between clusters can be achi...

H. Bakhshi, M. Bajelan

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

Wireless body Area networks (WBANs) include a number of sensor nodes placed inside or on the human body to improve patient health and quality of life. Ensuring the transfer and receipt of data in sensitive data is a very important issue. Routing algorithms should support a variety of service quality such as reliability and delay in sending and receiving data. Loss of information or excessive da...

2012
Omkar Kulkarni Huaming Zhang Swetha Govindaiah

Greedy routing has drawn a lot of attention in research community. To our best knowledge, stretch factor has not been studied for greedy routing algorithms. In this paper, we propose a new greedy routing algorithm and take the initiative to evaluate its stretch factor. Our algorithm generalizes the algorithm presented in [1]. It embeds an n-vertex connected graph G(V,E) in a semi-metric space. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید