摘要 :
At present, the problem of switching from traditional circuit-switched networks to packet-switched networks (NGN) is one of the most urgent for telecom operators in radiofrequency applications. Perspective developments in the fiel...
展开
At present, the problem of switching from traditional circuit-switched networks to packet-switched networks (NGN) is one of the most urgent for telecom operators in radiofrequency applications. Perspective developments in the field of IP communications are connected with the creation of integrated solutions that allow the development of next-generation networks to maintain existing connections and ensure uninterrupted operation in any telephone access network: on the infrastructure of copper pairs, through optical channels, wireless (WiMAX, WiFi) and wired (ETTH, PLC and etc.) of the network. According to the concept of "non-destructive" transition to NGN, such solutions should allow point-to-point transfer of certain segments to new technologies in radiofrequency applications without drastically changing the entire structure of the network. In particular, solutions for a "nondestructive" transition to NGN must meet the following requirements: 1. Integration into the existing network of the operator, support not only for new transport technology, but also for the familiar management model; 2. Fully modular architecture with the capabilities of geographical distribution and redundancy; 3. The ability to flexibly increase productivity by purchasing licenses and adding servers to the system; 4. The possibility of introducing new types of services in the shortest possible time; 5. Compliance with the requirements of the legislation on network architecture [1-5]. Routing to date is determined not by formal rules and descriptions typical of networks of previous generations, but by customer requirements and economic considerations of the telecoms operator. To optimize the operation of networks in radiofrequency applications, various routing methods are being developed, ensuring a balanced load of all network resources. Among foreign scholars studying this problem, it is worthwhile to highlight D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus, S. Hiroyuki, M. Yasuhiro, Y. Makiko and others. The main requirement in this case is that the new systems are maximally adapted to the transmission of packet traffic and primarily IP-messages. To successfully transmit across the network information flows of various types, it is necessary that the routing algorithm takes into account the requirements of these flows to the level of quality of service (QoS). To do this, all traffic is divided into service classes. And then routing across the network will be carried out in accordance with the service class of each individual thread. In Russia, issues of routing and related problems are handled by B.S. Goldstein, VM Vishnevsky, Yu.A. Semenov, VN Tarasov, AV Roslyakov, and others[1-5]. To obtain the optimal solution, it is necessary to simultaneously examine all the flows on a full set of routes. However, in multiservice networks with a large number of nodes, the size of the routing task can be very significant at the same time, which will not solve it in an acceptable time. Therefore, the task of developing new methods of adaptive routing is relevant. Routing in radiofrequency applications is one of the most important mechanisms for sending packets over computer networks. Routing solves two problems: combating network congestion and finding the shortest paths for transferring packets. The main factors influencing the choice of the router path are faults (when the node or communication channel fails) and overloading (when any part of the network is overloaded and it is desirable to redirect the packets to bypass)[6].
收起
摘要 :
Distributed Routing Model (DRM) and Centralized Routing Model (CRM) are two mainstream routing models for Network-on-Chip (NoC). DRM is scalable and efficient, but its state learning is costly because exchanging network state must...
展开
Distributed Routing Model (DRM) and Centralized Routing Model (CRM) are two mainstream routing models for Network-on-Chip (NoC). DRM is scalable and efficient, but its state learning is costly because exchanging network state must be in flooding form which may consume large amount of bandwidth. CRM monitors and send real-time network state to a central routing node as the basis of routing path computing which can achieve the optimal routing decision for each packet but suffers from huge design complexity and non-scalability. In this work, we propose a novel routing model called Hierarchical Source Routing (HSR) in which a tree-like hierarchical control network is built above the original network. Each non-leaf node in the tree is regarded as a control node that manages the network states and routing decisions of a group of node in the lower level. We propose two state update modes of the non-leaf nodes named HSR-PATH and HSR-PORT, which applies the average minimum path load and weighted port load respectively for the efficacy of optimal path calculation. Their implementation and overhead are also discussed. Our experiment shows that HSR-PATH and HSR-PORT outperform DRM in terms of Saturated Injection Rate by 26.1% and 17.9% on average respectively, and achieves 96.6% performance compared with CRM with much less power consumption. Finally, we use Throughput Energy Ratio (TER) as the comprehensive indicator and HSR-PATH and HSR-PORT outperform CRM by 59.4% and 13.4% respectively and DRM by 13.7% and 17.3% respectively in terms of TER.
收起
摘要 :
Distributed Routing Model (DRM) and Centralized Routing Model (CRM) are two mainstream routing models for Network-on-Chip (NoC). DRM is scalable and efficient, but its state learning is costly because exchanging network state must...
展开
Distributed Routing Model (DRM) and Centralized Routing Model (CRM) are two mainstream routing models for Network-on-Chip (NoC). DRM is scalable and efficient, but its state learning is costly because exchanging network state must be in flooding form which may consume large amount of bandwidth. CRM monitors and send real-time network state to a central routing node as the basis of routing path computing which can achieve the optimal routing decision for each packet but suffers from huge design complexity and non-scalability. In this work, we propose a novel routing model called Hierarchical Source Routing (HSR) in which a tree-like hierarchical control network is built above the original network. Each non-leaf node in the tree is regarded as a control node that manages the network states and routing decisions of a group of node in the lower level. We propose two state update modes of the non-leaf nodes named HSR-PATH and HSR-PORT, which applies the average minimum path load and weighted port load respectively for the efficacy of optimal path calculation. Their implementation and overhead are also discussed. Our experiment shows that HSR-PATH and HSR-PORT outperform DRM in terms of Saturated Injection Rate by 26.1% and 17.9% on average respectively, and achieves 96.6% performance compared with CRM with much less power consumption. Finally, we use Throughput Energy Ratio (TER) as the comprehensive indicator and HSR-PATH and HSR-PORT outperform CRM by 59.4% and 13.4% respectively and DRM by 13.7% and 17.3% respectively in terms of TER.
收起
摘要 :
This paper takes a first step towards generalizing compact routing to arbitrary routing policies that favor a broader set of path attributes beyond path length. Using the formalism of routing algebras we identify the algebraic req...
展开
This paper takes a first step towards generalizing compact routing to arbitrary routing policies that favor a broader set of path attributes beyond path length. Using the formalism of routing algebras we identify the algebraic requirements for a routing policy to be realizable with sublinear size routing tables and we show that a wealth of practical policies can be classified by our results. By generalizing the notion of stretch, we also discover the algebraic validity of compact routing schemes considered so far and we show that there are routing policies for which one cannot expect sublinear scaling even if permitting arbitrary constant stretch.
收起
摘要 :
This paper takes a first step towards generalizing compact routing to arbitrary routing policies that favor a broader set of path attributes beyond path length. Using the formalism of routing algebras we identify the algebraic req...
展开
This paper takes a first step towards generalizing compact routing to arbitrary routing policies that favor a broader set of path attributes beyond path length. Using the formalism of routing algebras we identify the algebraic requirements for a routing policy to be realizable with sublinear size routing tables and we show that a wealth of practical policies can be classified by our results. By generalizing the notion of stretch, we also discover the algebraic validity of compact routing schemes considered so far and we show that there are routing policies for which one cannot expect sublinear scaling even if permitting arbitrary constant stretch.
收起
摘要 :
Opportunistic routing is a new design trend of wireless network routing protocol. It takes good advantages of the broadcast nature of wireless network. The source can use multiple potential paths to deliver the packets to the dest...
展开
Opportunistic routing is a new design trend of wireless network routing protocol. It takes good advantages of the broadcast nature of wireless network. The source can use multiple potential paths to deliver the packets to the destination. The routing metric used for selecting the forwarder lists is very important for designing the opportunistic routing scheme. In this paper, we propose a novel routing metric STR (successful transmission rate) to choose the forwarder list, which is based on total successful transmission rate. It considers multi-links contribution, instead of one "best" link information used in ETX. We also introduce the fair opportunistic routing with linear coding (FORLC) scheme using our STR metric. The extensive simulation results show that the opportunistic routing with our STR metrics can always outperform ETX based ExOR scheme. The maximum benefit of the throughput using the STR based FORLC can be 30% more than the ETX based MORE. It also has at most 10 times throughputs than traditional routing protocol.
收起
摘要 :
The booming industry of location-based services has accumulated a huge collection of users' location trajectories of driving, cycling, hiking, etc. In this work, we investigate the problem of discovering the Most Popular Route (MP...
展开
The booming industry of location-based services has accumulated a huge collection of users' location trajectories of driving, cycling, hiking, etc. In this work, we investigate the problem of discovering the Most Popular Route (MPR) between two locations by observing the traveling behaviors of many previous users. This new query is beneficial to travelers who are asking directions or planning a trip in an unfamiliar city/area, as historical traveling experiences can reveal how people usually choose routes between locations.
收起
摘要 :
Maintaining accurate network state information in the Traffic Engineering Databases of each node along a network is extremely difficult. The BYPASS Based Routing (BBR) mechanism has appeared to reduce the effects produced in the n...
展开
Maintaining accurate network state information in the Traffic Engineering Databases of each node along a network is extremely difficult. The BYPASS Based Routing (BBR) mechanism has appeared to reduce the effects produced in the network performance when selecting paths under inaccurate network state information. The BBR mechanism is based on applying the dynamic bypass concept. In this paper the BBR mechanism is modified to extend its applicability, and therefore to increase the benefits of its implementation.
收起
摘要 :
Maintaining accurate network state information in the Traffic Engineering Databases of each node along a network is extremely difficult. The BYPASS Based Routing (BBR) mechanism has appeared to reduce the effects produced in the n...
展开
Maintaining accurate network state information in the Traffic Engineering Databases of each node along a network is extremely difficult. The BYPASS Based Routing (BBR) mechanism has appeared to reduce the effects produced in the network performance when selecting paths under inaccurate network state information. The BBR mechanism is based on applying the dynamic bypass concept. In this paper the BBR mechanism is modified to extend its applicability, and therefore to increase the benefits of its implementation.
收起
摘要 :
Considered the most common routing protocols with different types of delivery (unicast, multicast) as well as technology and ways of organizing Multipath routing. At this stage, made a comparative analysis of protocols unicast (RI...
展开
Considered the most common routing protocols with different types of delivery (unicast, multicast) as well as technology and ways of organizing Multipath routing. At this stage, made a comparative analysis of protocols unicast (RIP, OSPF and AntNet) and multicast (DVMRP, MOSPF, PIM-DM, CBT and PIM-SM) routing and provide recommendations on their practical application.
收起
原文获取