Existing multicast models have taken traffic concentration, source-end delay, delay jitter into consideration, while some dynamic application like digital TV delivery poses a new challenge. Users can join/leave multic...
详细信息
ISBN:
(纸本)081946449X
Existing multicast models have taken traffic concentration, source-end delay, delay jitter into consideration, while some dynamic application like digital TV delivery poses a new challenge. Users can join/leave multicast group dynamically and arbitrarily. When all users in a service group have left the multicast group, multicast protocols will delete the corresponding delivery edge in the multicast tree, which leads to great control overhead in delivery network. This overhead comes from several aspects, like forwarding tree maintain, update, membership management. Even if the multicast tree is pre-calculated and cannot delete edges in runtime, the users' leaving action can lead to resource utilization problem, especially when the delivery network's bandwidth is expensive. In this paper we designed an algorithm to find the optimized multicast tree to ensure stability of network under dynamic user behavior. With this algorithm, effect of users' random behavior can be smoothed out, thus increase performance of the delivery network.
The use of peer-to-peer (p2p) applications is growing dramatically. Most p2p applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and re...
详细信息
ISBN:
(纸本)9780769537450
The use of peer-to-peer (p2p) applications is growing dramatically. Most p2p applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing speed with less routing hops, a new routing algorithm named RGAAC based on group-average agglomerative clustering was presented. Structured by k clusters topology, this p2p network has k cluster center nodes. The cluster center nodes ensure the high performance of the RGAAC. Compared to some other p2p overlay routing algorithms, the RGAAC increases the performance in routing efficiency. The conclusions show that the RGAAC is an efficient routing algorithm, but also has some problems waiting for further study.
Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile nodes forming a self configuring network. It does not use any existing infrastructure. The dynamic nature of MANETs and memory and energy constraints of...
详细信息
ISBN:
(纸本)9781509037704
Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile nodes forming a self configuring network. It does not use any existing infrastructure. The dynamic nature of MANETs and memory and energy constraints of mobile nodes require an effective routing algorithm. This paper proposes HEEMCORP routing algorithm. It is a hierarchical, energy efficient on demand routing algorithm. The simulation results prove that the proposed hierarchical routing algorithm provides better packet delivery ratio (in Kbits) and consumes less power than DSR and MTPR with the increase in number of nodes.
WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. routing algorithm performance directly determines sensor nodes how to transfer and c...
详细信息
ISBN:
(纸本)9783037857519
WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. routing algorithm performance directly determines sensor nodes how to transfer and control data, and the effective data rate. The algorithm which affects the energy consumption and lifetime of the whole sensor network is the core content of the network layer. WirelessHART network layer routing algorithm includes Source Route and Graph Route. In this paper, WirelessHART routing algorithm is simulated using nesC language in the TinyOS, and then compares with AODV protocol. And the data of experiment show the application advantage of Wireless HART Graph Route.
In this paper a method of routing of clock distribution circuits will be presented, We first give out the background of the problem we later studied. In this section, we discuss the three constrains of the routing on ...
详细信息
ISBN:
(纸本)078037889X
In this paper a method of routing of clock distribution circuits will be presented, We first give out the background of the problem we later studied. In this section, we discuss the three constrains of the routing on a clock distribution chip. Then we offer an algorithm to solve this problem. The algorithm features in 3 steps, which are called topology generation, cut line generation and the adjustment process. We will further develop the 3 steps into more details in the following 3 sections. And in latter part some application samples are shown to evaluate the algorithm. Finally we concluded the further work we should probe into.
With the rapid growth of multimedia applications, Internet has been becoming crowded. IP multicast was proposed to help this situation, but not widely deployed for its scalability and fundamental network requirement p...
详细信息
ISBN:
(纸本)9781424414468
With the rapid growth of multimedia applications, Internet has been becoming crowded. IP multicast was proposed to help this situation, but not widely deployed for its scalability and fundamental network requirement problem. Application-layer multicast (also called Overlay multicast) is an attractive alternative solution. In this paper, we developed an adapted routing algorithm of overlay networks to provide scalable multicast services on the Internet. The algorithm defines an optimal balance tree to optimize the trade-off between delay and bandwidth consumption with a new metrics: OBDB. Our experimental results demonstrate the scalability, efficiency and performance of our approach.
as a nanometer level network-on-chip with the optical interconnection, the Optical Network-on-Chip (ONoC) was first proposed in 2006 in order to reduce the power consumption of the inter-chip communication. Because ON...
详细信息
ISBN:
(纸本)9781479941469
as a nanometer level network-on-chip with the optical interconnection, the Optical Network-on-Chip (ONoC) was first proposed in 2006 in order to reduce the power consumption of the inter-chip communication. Because ONoC is typically characterized by low latency, high bandwidth and low power consumption, it has become more and more attractive. Compared with the 2-Dimensional (2D) design, the 3D integration technology has a higher packing density, a shorter wire length and the less power consumption. Therefore, the 3D ONoC will have the great potential in the future. In this paper, we first discuss and study the ONoC, and we then design the 3D mesh ONoC from the perspectives of topology, routing and communication protocol, with the help of 3D integration advantages. We setup a simulation platform by using OPNET in order to compare the performances of 2D and 3D mesh ONoCs in terms of the average delay and the data packet loss rate. The simulation results demonstrate that our 3D mesh ONoC is actually effective.
an ad hoc wireless network (AHWN) is a wireless network without any central node to communicate. The network is ad hoc because it doesn't have any fixed infrastructure and the node positions change randomly. In wi...
详细信息
ISBN:
(纸本)9781509010660
an ad hoc wireless network (AHWN) is a wireless network without any central node to communicate. The network is ad hoc because it doesn't have any fixed infrastructure and the node positions change randomly. In wired networks, routers and each node percolate to send the packets. The theme of a routing protocol in ad hoc networks is finding different paths to different nodes. The design of routing algorithm for such networks is difficult. Ant colony optimization (ACO) is a metaheuristic inspired from ants foraging behavior. In ACO algorithms, ants are agents or packets which move in the network for searching the path from sender to destination. Ants place pheromone on each traversed link. A path is constructed quickly which the majority of the ants (packets) follow. The path is based on pheromone concentration. Ant based routing algorithm (ARA) and AntHocNet algorithm depend on ACO. It is a combinational algorithm which includes a reactive route finding setup process with a proactive route maintaining process. Its aim is to keep information about existing routes and finding new routes. Video streaming is a collection of images displayed one after another with a set of frequency to give visibility of motion of frames. Video streaming in ad hoc networks is a challenging problem. In this paper performance of video streaming transmission using AntHocNet is evaluated using ns-2 simulator. This evaluation is compared with video streaming in wired networks using the AntNet routing algorithm. Video streaming support from Evalvid is used.
A Banyan-type network is a typical network topology for optical interconnection networks. In this paper, we propose a routing algorithm to generate the nonblocking connections for any request on a Banyan-type network ...
详细信息
ISBN:
(纸本)9780769548425
A Banyan-type network is a typical network topology for optical interconnection networks. In this paper, we propose a routing algorithm to generate the nonblocking connections for any request on a Banyan-type network with a given crosstalk constraint, in which the number of planes exactly equals to the necessary and sufficient condition derived in our previous results. In addition, we analyze this routing algorithm by relating to the study of graph theory and found it is a polynomial time algorithm.
Network-on-Chips (NoCs) usually use regular mesh-based topologies. Regular mesh topologies are not always efficient because of power and area constraints which should be considered in designing system-on-chips. To ove...
详细信息
ISBN:
(纸本)9781424425983
Network-on-Chips (NoCs) usually use regular mesh-based topologies. Regular mesh topologies are not always efficient because of power and area constraints which should be considered in designing system-on-chips. To overcome this problem, irregular mesh NoCs are used for which the design of routing algorithms is an important issue. This paper presents a novel routing algorithm for irregular mesh-based NoCs called "i-route". In contrast to other routing algorithms, this algorithm can be implemented on any arbitrary irregular mesh NoC without any change in the place of IPs. In this algorithm, messages are routed using only 2 classes of virtual channels. Simulation results show that using only 2 virtual channels, "i-route" exhibits a better performance compared to other algorithms already proposed in the same context.
暂无评论