On storage dynamics of space delay/disruption tolerant network node

Delay/disruption tolerant network (DTN) plays a promising role in prospected information infrastructures for future space activities, such as Interplanetary Internet (IPN) or Solar System Internet (SSI). Over such long-haul and intermittent links, DTN technique makes scientific data return end-to-end reliable by the typical custody transfer and store-and-forward mechanism. Due to lack of enough space spacecrafts deployed for DTN, now and in the near decades, there will be some intermediary nodes which would carry a large proportion of network traffic as DTN routers. Consequently, the behaviors and capabilities of managing bundles in the intermediary nodes would have impacts on the data transport over space DTN. Focusing on the storage dynamics of bundles, in this paper, we propose an analytical framework based on two-dimension Markov chain to evaluate the behaviors of bundles delivery in DTN intermediate nodes. Accordingly, a delay model and a transmission success probability model for bundles delivery over space DTN are developed separately, both dependent closely on the sojourn time in node storages. The evaluation results indicate that: (1) Dividing the source files into bigger bundles for transmission causes a longer storage-occupancy time on intermediary nodes; (2) bundle sizes have more explicit impacts on the storage-occupancy time at a node than segment sizes do; and (3) the transmission success probability of a bundle is more dependent on a DTN bundle size than on a LTP segment size.     

基于AFDX的跨总线ARINC615协议软件设计及实现

ARINC615协议定义了一种基于ARINC429总线的数据加卸载方法,在以AFDX网络为核心的航电网络中,数据加载器一般为基于AFDX通信的端系统设备,为了完成航电网络加载器对ARINC429总线设备的加载,文章提出了一种基于AFDX的跨总线加载结构,采用有穷状态机的方法实现了ARINC615协议的功能,设计并实现了基于ARINC615协议的应用软件,保证了文件传输的有效性和可靠性。     

Design and performance evaluation of LTP enhancements for lossy space channels

This paper deals with the performance of Licklider Transmission Protocol (LTP) in space environment, focusing on the impact of segment losses and the design of possible improvements. The in‐depth analysis of retransmission mechanisms carried out in the paper shows that, while LTP already achieves delivery time performance very close to the theoretical optimum in ideal conditions (no losses) and when losses affect data segments, a substantial improvement is still possible concerning signaling segments, whose loss can result in a significant increase of the LTP block delivery time. To this end, 2 simple enhancements, the Closing State and the proactive retransmission of signaling segments, are proposed and evaluated in the paper. Both enhancements have been added as optional features to the original Interplanetary Overlay Network LTP implementation (ION 3.5.0), in order to evaluate their effectiveness on a GNU/Linux testbed running the full protocol stack. Results presented in the paper confirm the validity of the proposed enhancements, as they significantly reduce the average delivery time in the presence of high losses and provide the additional advantage, even when losses are relatively low, of largely reducing the difference between average and worst cases.     

A DTN approach to satellite communications

Satellite communications pose serious challenges to transport layer performance, mainly because of long propagation delays (especially in geosynchronous systems) and the possi ble presence of random errors on the satellite link. Solutions that cope with these impairments usually rely upon either the adoption of enhanced versions of transport protocols, or the insertion of intermediate agents, like PEPs (Performance Enhancing Proxies). An alternative approach is to adopt the DTN (Delay/Disruption Tolerant Networking) architecture based on the introduction of the new "bundle" layer in the protocol stack. The aim of the paper is to discuss the advantages and disadvantages of the DTN approach compared to the more conventional solutions mentioned. DTN performance is assessed by considering both fully connected networks and networks where continuous connectivity cannot be guaranteed during data transfer and/or at start-up. Performance is evaluated by using the TATPA testbed (Testbed for Advanced Transport Protocols and Architectures), which is based on a cluster of Linux PCs running the DTNperf application, developed to this end by the authors and now included in the official DTN package. Comparative results show that DTN, coupled with TCP Hybla, outperforms NewReno, offering a performance very close to PEPsal and end- to-end Hybla, which are among the most effective solutions on satellite channels. In addition to these encouraging results, DTN offers an intrinsic greater robustness in intermittent or disruptive environments.     

Performance of DTN protocols in space communications

Delay/disruption tolerant networking (DTN) was developed to enable automated network communications despite the long link delay and frequent link disruptions that generally characterize space communications. The performance of DTN convergence layer adapter (CLA) protocols over asymmetric space communication channels has not yet been comprehensively characterized. In this paper, we present an experimental performance evaluation of DTN CLA protocols for reliable data transport over a space communication infrastructure involving asymmetric channel rates, with particular attention to the recently developed Licklider transmission protocol (LTP) CLA (i.e., LTPCL). The performance of LTPCL is evaluated in comparison with other two reliable CLAs, TCP CLA and a hybrid of TCP CLA and LTPCL, for long-delay cislunar communications in the presence of highly asymmetric channel rates. LTPCL is also evaluated and analyzed in a deep-space communication scenario characterized by a very long link delay and lengthy link disruptions.     

Wi‐Fi‐based modeling and hybrid routing scheme for delay‐tolerant public bus network

Delay‐ or Disruption‐Tolerant Networking (DTN) is a communications approach that is utilized in easily disrupted or delayed networks. Examples of such networks are often found in heterogeneous networks, mobile or extreme terrestrial networks, and planned networks in space. In this paper, we examine the metropolitan bus network as a research target of DTN for a public transport network. We analyze the metropolitan bus network through spatial and temporal modeling using an existing Bus Information System (BIS) database. On the basis of the results of our analysis, we propose and design an appropriate DTN routing scheme called Hybrid Position‐based DTN Routing. This scheme uses position‐based routing instead of address‐based routing by soliciting infrastructural help from nearby Access Points for the real‐time BIS location service. We simulated our scheme using a WLAN for the wideband DTN communication and evaluated it by comparing it with traditional Ad hoc flooding, Epidemic routing, and strategic protocol steps in our own algorithm. The results indicate that our scheme achieves reasonably high performance in terms of packet delivery ratio, latency, and resource usage. Copyright © 2013 John Wiley & Sons, Ltd.     

基于LSTM模型的动态转发路由协议

文中将容忍延迟网络(Delay Tolerant Network,DTN)应用于船舶通信,提出了一种基于长短时记忆网络(Long Short-Term Memory,LSTM)模型的动态转发路由协议LSTM-DRA(Dynamic Distri-bution Routing Algorithm Based on LST...     

基于分层时间有色Petri网的支付协议公平性分析

电子支付协议是一种重要的电子商务协议,公平性是其重要的安全属性之一。该文提出一种基于分层时间有色Petri网(HTCPN)的电子支付协议形式化分析方法。该方法在进行公平性分析时,充分考虑了两个环境因素:主体是否诚实和通信信道是否可靠,与其他形式化方法相比,可以更有效地分析协议公平性。使用该方法对典型支付协议IBS协议进行分析,分析结果验证了所提模型和方法的有效性。     

基于稳定闭域的异构无线网络混合路由策略

分析了异构的网络模型,并提出了一种基于MANET稳定闭域的混合路由策略,使得基于该路由策略设计的路由协议能够实时地根据本地拓扑状态进行转换,在稳定闭域内使用AODV提高路由转发的效率。当数据分组转发到闭域边界后,将转换为改进的Prophet路由继续在非连通区域内寻路,以充分利用MANET与DTN路由的优势。仿真实验证明了该路由策略的可行性,通过比较多种路由算法验证了在特定的异构网络环境下该路由策略的高效性。     

An adaptive end‐to‐end RTO calculation framework for DTNs with scheduled connectivity

In this work, we propose an end‐to‐end retransmission framework for dynamically calculating efficient retransmission time‐out intervals in delay‐tolerant networks (DTNs) with scheduled connectivity. The proposed framework combines deterministic and statistical information about the network state to calculate worst‐case estimates about the expected round trip times. Such information includes connectivity schedules, convergence layer protocols specifics, communication link characteristics, and network statistics about the maximum expected packet error rates and storage congestion. We detail the implementation of the proposed framework within the end‐to‐end application data conditioning layer proposed for the DTN architecture, realized by the Delay‐Tolerant Payload Conditioning protocol, as part of the Interplanetary Overlay Network–DTN reference implementation, and evaluate its performance in a complex deep‐space emulation scenario in our DTN testbed. Our results show that our approach achieves great accuracy in round‐trip time estimations and, therefore, faster retransmissions of lost data, in comparison to the statically configured retransmission mechanism of the original Delay‐Tolerant Payload Conditioning protocol. As a result, in‐order data reception rate and storage requirements on the receiver side are significantly improved, at minimum or even zero extra cost in transmission overhead due to duplicate transmissions.     

Performance modeling of data transmission by using random linear network coding in DTNs

In Delay Tolerant Networks (DTNs), mobile nodes exploit encounter chances to transmit data via the established opportunistic link between encounter nodes. The transmission capacity between two encounter nodes is constrained by the duration of opportunistic links. How to transmit data efficiently is one of the fundamental and most important issues in DTNs. Recently, Random Linear Network Coding (RLNC) is proposed as a promising approach to improve data transmission efficiency in DTNs. To facilitate the development of deployment of RLNC based routing protocols, it is imperative to quantify the performance gain brought by RLNC in a rigorous and systematic way. In this paper, we develop an analytical model to evaluate the data transmission performance of RLNC based epidemic routing in DTNs. In the model, we consider that multiple unicast communication sessions compete for limited \capacity. Numerical results validate the effectiveness of our analytical model and demonstrate the significant performance improvement for data transmission in DTNs brought by RLNC. Our work of this paper provides a general tool for performance evaluation and useful guidelines for designing RLNC based routing protocols in DTNs. Copyright © 2015 John Wiley & Sons, Ltd.     

基于内容流行度差异性的CDN-P2P融合分发网络缓存替换机制研究

现有的CDN-P2P缓存替换机制没有关注内容文件中各片段的个体流行度差异性,而无法提高预缓存内容片段的访问命中率。鉴于此,提出了基于流行度差异性的缓存替换机制Diff-Attribute。同时考虑了内容文件的整体流行度和文件中各个片段的个体流行度。此外,基于分布熵,定义了一种内容流行度均衡性度量方法：若流行度均衡,就提前缓存各文件的前缀片段;否则提前缓存热门文件或其中最热门的内容片段。仿真结果表明：在缓存命中率和字节命中率方面,Diff-Attribute机制分别高出LFU、LRU等传统机制约6%和8%;在访问延迟启动率和传输成本消耗率方面,Diff-Attribute机制则降低了约13%和7%。     

Dimensioning bandwidth for elastic traffic in high-speed datanetworks

Simple and robust engineering rules for dimensioning bandwidth for elastic data traffic are derived for a single bottleneck link via normal approximations for a closed-queueing network (CQN) model in heavy traffic. Elastic data applications adapt to available bandwidth via a feedback control such as the transmission control protocol (TCP) or the available bit rate transfer capability in asynchronous transfer mode. The dimensioning rules satisfy a performance objective based on the mean or tail probability of the per-flow bandwidth. For the mean objective, we obtain a simple expression for the effective bandwidth of an elastic source. We provide a new derivation of the normal approximation in CQNs using more accurate asymptotic expansions and give an explicit estimate of the error in the normal approximation. A CQN model was chosen to obtain the desirable property that the results depend on the distribution of the file sizes only via the mean, and not the heavy-tail characteristics. We view the exogenous “load” in terms of the file sizes and consider the resulting flow of packets as dependent on the presence of other flows and the closed-loop controls. We compare the model with simulations, examine the accuracy of the asymptotic approximations, quantify the increase in bandwidth needed to satisfy the tail-probability performance objective as compared with the mean objective, and show regimes where statistical gain can and cannot be realized     

HFC网VOD系统视频传输技术实现

简要介绍了基于ＨＦＣ网视频点播系统,重点讨论了其视频传输实现技术,分析并描述了视频传输协议最后给出了该系统视频传输的具体实现。     

Performance analysis of prioritized parallel transmission MAC protocol in all‐IP wireless WAN

Prioritized parallel transmission MAC (PPTM) protocol is proposed for all‐IP wireless wide area network (WAN). In this paper, we analyse its performance and compare it with modified channel load sensing protocol (MCLSP). We model PPTM as a non‐preemptive priority queueing system and obtain a close form of transmission time delay for each priority class, throughput of the scheme, and number of packets in the queue in the Poisson arrival case. We find that PPTM achieves less transmission time delay than MCLSP does for high priority data. Hence, the overall performance of the system using PPTM is significantly improved. We verify the conclusions with simulation via a simplified all‐IP wireless WAN. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance analysis of a file delivery system based on the FLUTE protocol

This paper presents the results of performance tests carried out for a file delivery system based on the file delivery over unidirectional transport (FLUTE) protocol. FLUTE is a file transport protocol used to deliver files over IP networks, including the Internet and unidirectional systems, from a sender to one or more receivers. FLUTE uses UDP, an unreliable transport protocol, and so reliable delivery must be guaranteed by other means. This paper shows how FLUTE manages to recover from packet losses using forward path redundancy (forward error correction (FEC) and repeat transmissions in a data carousel), and a simple HTTP‐based point‐to‐point file repair scheme which is specified in 3GPP and DVB standards. The results presented in this paper show that careful optimization of FEC overhead, and the number of repeat transmissions, gives the best system performance in most cases. Based on the simplified error reception and distribution model depicted in this study, it is illustrated that the simple client‐server point‐to‐point file repair is optimal only for small groups. Several options to improve the configuration of FLUTE senders are provided, to deliver reception guarantees with optimal data expense from the system point of view. Copyright © 2006 John Wiley & Sons, Ltd.     

IEEE 802.11 medium access control enhancements based on simultaneous multiple‐input multiple‐output bandwidth sharing

The demand for higher data rate has spurred the adoption of multiple‐input multiple‐output (MIMO) transmission techniques in IEEE 802.11 products. MIMO techniques provide an additional spatial dimension that can significantly increase the channel capacity. A number of multiuser MIMO system have been proposed, where the multiple antenna at the physical layer are employed for multiuser access, allowing multiple users to share the same bandwidth. As these MIMO physical layer technologies further evolve, the usable bandwidth per application increases; hence, the average service time per application decreases. However, in the IEEE 802.11 distributed coordination function‐based systems, a considerable amount of bandwidth is wasted during the medium access and coordination process. Therefore, as the usable bandwidth is enhanced using MIMO technology, the bandwidth wastage of medium access and coordination becomes a significant performance bottleneck. Hence, there is a fundamental need for bandwidth sharing schemes at the medium access control (MAC) layer where multiple connections can concurrently use the increased bandwidth provided by the physical layer MIMO technologies. In this paper, we propose the MIMO‐aware rate splitting (MRS) MAC protocol and examine its behavior under different scenarios. MRS is a distributed MAC protocol where nodes locally cooperate with one another to share bandwidth via splitting the spatial channels of MIMO systems. Simulation results of MRS protocol are obtained and compared with those of IEEE 802.11n protocol. We show that our proposed MRS scheme can significantly outperform the IEEE 802.11n in medium access delay and throughput. Copyright © 2012 John Wiley & Sons, Ltd.     

车载自组织网中基于蚁群算法的延迟感知路由协议

针对城市道路环境下车载自组织网( VANETs)中通信性能下降以及数据传输失败的问题,提出了一种基于蚁群算法的延迟感知路由( ACDR)协议。首先,建立双向车道的数学延迟模型;然后,根据提出的端点十字路口( EI)的概念,ACDR利用蚁群优化( ACO)寻找最佳路线,其中前向蚂蚁根据本地路段延迟以及当前十字路口与目的节点的端点十字路口之间的全局时延来选择路径,后向蚂蚁则负责在返回路径时更新信息素,同时,相邻十字路口之间利用贪婪转发算法进行数据包的传递。最后仿真比较了ACDR协议与连通性感知路由( CAR)协议的性能,结果表明提出的ACDR协议的数据包的传输延迟小,丢包率低,通信性能好。     

基于多特征Mean Shift的人脸跟踪算法

该文把局部三值模式(Local Ternary Patterns, LTP)纹理特征引入Mean Shift跟踪算法,提出了基于多特征的Mean Shift人脸跟踪算法以解决Mean shift跟踪算法的鲁棒性问题。通过对LTP纹理特征的分析、研究,提出了一个LTP关键纹理模型,既增强了目标的关键纹理信息,又简化了LTP纹理模型。在此基础上,提出一种基于LTP关键纹理特征和肤色特征的Mean Shift人脸跟踪算法,有效地解决了Mean Shift算法的鲁棒性问题。为进一步提高对快速运动目标的跟踪速度和跟踪性能,该文引入了卡尔曼滤波器对目标进行预测。实验结果表明,该文的算法在目标定位的准确性和跟踪性能上比Mean Shift算法均有明显的提高。     

基于VC^＋＋6.0的网络通信设计

网络通信是通过因特网进行数据交换的过程。伴随着因特网技术的不断发展,网络通信技术已应用于各个行业的远程控制以及各种即时通信中。设计了一个基于VC^＋＋6.0的网络通信系统,采用UDP协议,利用VC^＋＋6.0内置的Socket实现了网络的即时通信;并实现了基于FTP协议的文件传输。系统操作直观,可靠性高,文件传送过程中几乎不会发生数据的丢失,具有广泛的实际应用价值。