Evaluating performance of two-hop routing in DTN based on Home-MEG model

Performance analysis in delay tolerant networks (DTN) is often based on unrealistic mobility models. Recently, the Home-MEG model is proposed. This model is able to accurately reproduce the power law and exponential decay distribution of inter-contact times between mobile nodes which has been observed in many real motion traces. This letter proposes a theoretical framework to evaluate the performance of two-hop routing based on Home-MEG model for the first time. Simulation results show the accuracy of our theoretical model. Using the model, we explore the impact of some parameters (e.g. the number of relay nodes) on the routing performance.     

容迟网络中基于节点间亲密度的分组路由方法

借鉴MANET中通过分簇来减少冗余副本和社交网络中有关挖掘社交圈的思想,通过分析节点的移动规律,定义了基于节点间亲密度的拓扑结构,并将该亲密度在拓扑图中量化为可以比较的边的权值,依据边的权值大小进行拓扑裁剪,挖掘出相互亲密度较高的节点分组,并且针对源节点和目的节点所在的分组对spray and wait路由方法进行改进,来决定本身的报文副本的分配情况,进而提出了基于节点间亲密度的分组路由方法(PBI)。实验结果表明,该路由方法能够明显地提高投递成功率并且减小网络时延。     

基础设施增强的DTN路由协议

针对间歇性连通的移动网络环境,提出了一种新的DTN路由协议IEDR。其整合以往DTN路由算法中的设计经验,充分利用节点间相遇的机会交换数据,提高数据传达率并降低传输延迟,同时将资源开销控制在可接受的范围内。IEDR 还尝试将无线接入点作为辅助数据传播的有效途径,利用接入点间高速互联的特性为数据在广大地域内的高效传播提供便利。仿真结果表明,与一些经典路由协议相比,IEDR达到了更好的效能。     

Distinguishing social contacts and pass-by contacts in DTN routing

Smallcells deployment in heterogeneous networks (HetNets) introduce uplink (UL) downlink (DL) asymmetry, backhaul bottleneck, cell load imbalances, increased core network signaling, interference and mobility management problems. In order to address these issues, concept of dual connectivity has been introduced in 3rd generation partnership project (3GPP) release 12. In dual connectivity, a given user equipment can consume radio resources of at least two different network points connected through non-ideal backhaul for spectrum aggregation and cooperative access mechanisms in dense 5G HetNets. Alternatively, another concept of downlink and uplink decoupling (DUDe) has also been recently introduced in 3GPP to improve uplink performance, load balancing and cell capacity. In order to take advantage of the strengths of these latest developments, this paper significantly advances prior work by analyzing K-tier 5G HetNets having dual connectivity and decoupled access (joint DUDe dual-connectivity) for spectrum aggregation in UL and DL. In the preceding works, K-tiers as per present-day heterogeneity, uplink power control and receiver noise have not been considered for joint DUDe dual-connectivity. With the use of stochastic geometry, we have developed closed form solutions for association, coverage and outage probabilities along with average throughput for joint DUDe dual-connectivity by considering uplink power control, receiver noise and K-tiers of HetNets. The resultant performance metrics are evaluated in terms of achieved gains over conventional downlink received power access policies. Results show that cell association technique based on joint DUDe dual-connectivity can significantly improve load balancing, mobility management and UL performance for forthcoming 5G HetNets.     

适用于分段运动模式的基于链路维持概率的跨层路由协议

MANET中节点移动造成路由中断带来端到端传输性能下降,为解决这一问题提出了一种适用于分段运动模式的链路稳定概率计算方法,并在此算法的基础上设计了一种适用于分段运动模式的基于链路维持概率的跨层路由协议(LPCP).LPCP跨层结合路由层和传输层,能够兼顾端到端连接的稳定性和最小跳数.制定了"路由切换"、"数据存储转发"、"ACK再确认"等机制尽可能减少路由中断的发生及其带来的端到端传输性能下降.仿真结果表明LPCP能够有效减小路由中断带来的丢包,提高端到端传输吞吐量.     

Performance modeling of DTN routing with heterogeneous and selfish nodes

The performance modeling study of Delay-Tolerant Network routing, in general, assumes the nodes to be homogeneous (in terms of features such as the coverage range) and uncompromised (in terms of forwarding messages). However, in realistic settings this may not be the case. The routing performance modeling of such realistic scenarios that involve multifariously-featured and egotistic nodes would be interesting and insightful. To this end, in this paper, we analytically model the routing behavior of such nodes using Ordinary Differential Equations for two different routing protocols namely, Epidemic Routing and Two-Hop Routing. Furthermore, we also study the degradation in the routing performance caused by an increase in the fraction of selfish nodes present in the heterogeneous node population. The proposed analytical model is validated via extensive simulations.     

跨域场景下的联邦路由机制设计

随着多网融合的发展,独立自治域网络之间的高效互联互通已成为一个关键理论技术问题。由于域内信息的私密性,各自治域之间不会共享相关的数据,传统的域间路由协议无法提供高效的跨域路由机制。为克服现有协议存在的不足,提出了一种基于机器学习的联邦路由机制,该机制通过各自治域的神经网络模型和参数隐式地共享域内信息,不仅可打破现存的数据孤岛问题,还可极大地减少域间信息共享所需要传输的数据量,进而降低全网路由信息收敛时延,基于该联邦路由机制,边界路由器也能够根据全网状态信息制定全局的优化路由转发策略。     

DTN routing for quasi‐deterministic networks with application to LEO constellations

We propose a novel DTN routing algorithm, called DQN, specifically designed for quasi‐deterministic networks with an application to satellite constellations. We demonstrate that our proposal efficiently forwards the information over a satellite network derived from the Orbcomm topology while keeping a low replication overhead. We compare our algorithm against other well‐known DTN routing schemes and show that we obtain the lowest replication ratio with a delivery ratio of the same order of magnitude than a reference theoretical optimal routing. We also analyze the impact of terrestrial gateways density and analyze DQN performances in heterogeneous cases. Copyright © 2015 John Wiley & Sons, Ltd.     

The PIM architecture for wide-area multicast routing

The purpose of multicast routing is to reduce the communication costs for applications that send the same data to multiple recipients. Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing architecture that efficiently establishes distribution trees across wide area internets, where many groups will be sparsely represented. Efficiency is measured in terms of the router state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our protocol independent multicast (PIM) architecture: (a) maintains the traditional IP multicast service model of receiver-initiated membership, (b) supports both shared and source-specific (shortest-path) distribution trees, (c) is not dependent on a specific unicast routing protocol, and (d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and scaling properties of this architecture make it well-suited to large heterogeneous internetworks     

Cache agent based location aided routing using distance and direction for performance enhancement in VANET

Telecommunication Systems - Vehicular ad hoc networks are a vibrant technology for future intelligent transport system. Vehicular ad hoc networks are a sub-level of wireless sensor network which...     

SDN‐based wireless body area network routing algorithm for healthcare architecture

The use of wireless body area networks (WBANs) in healthcare applications has made it convenient to monitor both health personnel and patient status continuously in real time through wearable wireless sensor nodes. However, the heterogeneous and complex network structure of WBANs has some disadvantages in terms of control and management. The software‐defined network (SDN) approach is a promising technology that defines a new design and management approach for network communications. In order to create more flexible and dynamic network structures in WBANs, this study uses the SDN approach. For this, a WBAN architecture based on the SDN approach with a new energy‐aware routing algorithm for healthcare architecture is proposed. To develop a more flexible architecture, a controller that manages all HUBs is designed. The proposed architecture is modeled using the Riverbed Modeler software for performance analysis. The simulation results show that the SDN‐based structure meets the service quality requirements and shows superior performance in terms of energy consumption, throughput, successful transmission rate, and delay parameters according to the traditional routing approach.     

层次化架构仿真平台AODV路由算法仿真

现代系统仿真技术和综合性仿真系统已经成为任何复杂系统不可缺少的分析、研究、设计、评价和决策的重要手段。物联网系统规模庞大、整体验证复杂度高,要求其大规模建设之前必须开展仿真验证工作,因此,层次化架构仿真平台应运而生。阐述了基于项目研发的层次化仿真平台架构,并在此基础上重点开展其中网络层无线自组网按需平面距离向量路由协议的算法分析研究与代码实现方法介绍。最后,在层次化架构仿真平台中,利用不同网络规模开展针对无线自组网按需平面距离向量路由协议的各节点接收分组数据参数仿真,并给出分析结论。     

An architecture for stable, analyzable Internet routing

In today's Internet, individuals, campuses, and organizations obtain IP connectivity from transit providers. Internet interprovider routing is governed by bilateral traffic exchange agreements between providers. Such independently established policies can adversely impact the stability and analyzability of Internet routing. We describe an architecture for coordinating Internet routing policies. This architecture allows providers to publish high-level specifications of their policies, and to analyze the effects of their policies on Internet routing. Several pieces of the architecture have been implemented and are in production use; we also discuss the experiences gleaned from these deployments     

一种SDN架构下业务属性相关的多径路由算法

面对当前网络中流量的增长、业务种类的增多,SDN中多数的路由算法只支持一种QoS参数,没有兼顾对系统调度服务公平性的考虑,然而多参数限制的QoS 明显是NP 难问题,该问题用普通的路由算法难以解决,引进蚁群算法,在蚁群算法的基础上,将链路的时延、分组丢失率引入蚁群算法中,作为算法选择路径的依据,提出一种新的路由算法。该算法在对不同业务属性的数据流分类的基础上,根据网络的实时状况,为不同业务属性的数据流选择合适的路径,对网络中的数据流进行多路径传输。仿真实验表明,该算法能有效地降低数据流的时延、分组丢失率。     

A routing architecture for mobile integrated services networks

A drawback of the conventional Internet routing architecture is that its route computation and packet forwarding mechanisms are poorly integrated with congestion control mechanisms. Any datagram offered to the network is accepted; routers forward packets on a best-effort basis and react to congestion only after the network resources have already been wasted. A number of proposals improve on this to support multimedia applications; a promising example is the Integrated Services Packet Network (ISPN) architecture. However, these proposals are oriented to networks with fairly static topologies and rely on the same conventional Internet routing protocols to operate. This paper presents a routing architecture for mobile integrated services networks in which network nodes (routers) can move constantly while providing end-to-end performance guarantees. In the proposed connectionless routing architecture, packets are individually routed towards their destinations on a hop by hop basis. A packet intended for a given destination is allowed to enter the network if and only if there is at least one path of routers with enough resources to ensure its delivery within a finite time. Once a packet is accepted into the network, it is delivered to its destination, unless resource failures prevent it. Each router reserves resources for each active destination, rather than for each source–destination session, and forwards a received packet along one of multiple loop-free paths towards the destination. The resources and available paths for each destination are updated to adapt to congestion and topology changes. This mechanism could be extended to aggregate dissimilar flows as well. This revised version was published online in June 2006 with corrections to the Cover Date.     

A novel and efficient routing architecture for multi-FPGA systems

Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing architecture which is the manner in which wires, FPGAs and field-programmable interconnect devices (FPIDs) are connected. Several routing architectures for MFSs have been proposed, and previous research has shown that the partial crossbar is one of the best existing architectures. In this paper, we propose a new routing architecture, called the hybrid complete-graph and partial-crossbar (HCGP) which has superior speed and cost compared to a partial crossbar. The new architecture uses both hard-wired and programmable connections between the FPGAs. We compare the performance and cost of the HCGP and partial crossbar architectures experimentally, by mapping a set of 15 large benchmark circuits into each architecture. A customized set of partitioning and interchip routing tools were developed, with particular attention paid to architecture-appropriate interchip routing algorithms. We show that the cost of the partial crossbar (as measured by the number of pins on all FPGAs and FPIDs required to fit a design), is on average 20% more than the new HCGP architecture and as much as 25% more. Furthermore, the critical path delay for designs implemented on the partial crossbar were on average 20% more than the HCGP architecture and up to 43% more. Using our experimental approach, we also explore a key architecture parameter associated with the HCGP architecture-the proportion of hard-wired connections versus programmable connections-to determine its best value     

An IP transport and routing architecture for next-generationsatellite networks

Over the past several years, a number of new satellite systems have been proposed to provide high-speed Internet and multimedia services to businesses and home users. These proposals have been driven by the desire of network operators to reach end users that do not have cost effective access to other alternatives such as fiber, DSL, and cable, and by the availability of new spectrum (Ka-band) for use by new satellite services. The proposed systems generally employ multiple high-power spot beams, an onboard fast packet switch, and a demand-assigned multiple access scheme to provision IP-based services. In this article we concentrate on a geosynchronous satellite system where packet transport and switching within the satellite system are based on ATM. We describe an IP/ATM interworking and IP routing architecture that is driven by three main requirements: (1) the ability to support ATM SVCs between hundreds of thousands of satellite terminals by a single ATM switch located onboard; (2) a scalable IP routing architecture that does not result in large volumes of routing traffic to be transported over the satellite; and (3) the ability to segment the satellite terminals for routing and administrative control by ISPs and enterprise networks     

基于SDN架构的数据中心网络路由算法需求分析

软件定义网络是一种新型化的网络架构形式,是促成网络实现自动化部署安排的重要手段。对软件定义网络技术的应用能够实现数据与控制平面的分隔,进而达到对网络流量的精准化控制。文章在软件定义网络架构的基础上对数据中心网络路由算法展开具体分析,以期能够通过更低的网络成本与最短安全路径来实现对网络路由效率与资源的充分应用。     

Performance analysis of hop‐limited epidemic routing in DTN with limited forwarding times

Because of the uncertainty of transmission opportunity in delay tolerant networks (DTN), routing algorithms in DTN often need nodes to serve as relays for others to carry and forward messages. One classic policy is the Epidemic routing (ER) algorithm. To reduce the overhead, the hop‐limited ER protocol is proposed. This method can get better performance through controlling the message hop count. However, because of the energy constraint or other factors, each node may forward only limited times, that is, both the message hop count and the forwarding times may be limited. This paper proposes a unifying framework to evaluate the performance of ER with the aforementioned constraints. Simulations based on both synthetic and real motion traces show the accuracy of the framework. In addition, we explore the impact of many parameters (e.g., message hop count) through extensive numerical results. For example, numerical results show that both the message hop count and the forwarding times can have certain impact on the routing performance, but their impact is related with many other factors (e.g., the number of nodes). Copyright © 2014 John Wiley & Sons, Ltd.