Reliability Analysis for Integrated Networks with Application to Burst Switching

System performance and reliability are jointly assessed for highly reliable telecommunication or computer networks. The underlying model assumes that at most a small number of components can be "down" at a time, and that the average repair/replacement time of a failed component is small when compared to the average uptimes of network components. At steady state the system is assumed to follow a regenerative stochastic process. This methodology is used to evaluate highly distributed voice/data integrated networks. The performance measure selected for this application is the traffic loss rate.     

Performance Analysis of Networks with Unreliable Components

In evaluating the performance of a communication network with unreliable components, researchers have traditionally approached the problem by enumerating all possible states of the system. Since the number of states of a communication network withnfailure-prone components is 2ⁿthese methods are restricted to small systems. We present a new solution technique that is not doomed by the "statespace explosion" problem. Instead of enumerating all possible fail states, we consider only the most probable states. Since the network operates in these states most of the time, we can get upper and lower bounds and, hence, a good approximation of the network performance without having to analyze all possible states. We illustrate our solution technique by analyzing network reliability, the expected number of communicating pairs, and network average delay for some particular networks.     

System analysis of power transients in advanced WDM networks

This paper considers dynamical transient effects in the physical layer of an optical circuit-switched wavelength-division-multiplexed network. These transients of the average transmission power have millisecond time scales. Instead of studying detailed nonlinear dynamics of the network elements, such as optical line amplifiers, a linearized model of the dynamics around a given steady state is considered. System-level analysis in this paper uses modern control theory methods and handles nonlinearity as uncertainty. The analysis translates requirements on the network performance into the requirements to the network elements. These requirements involve a few gross measures of performance for network elements and do not depend on the circuit switching state. One such performance measure is the worst amplification gain for all harmonic disturbances of the average transmission power. Another is cross-coupling of the wavelength channel power variations. The derived requirements guarantee system-level performance for all network configurations and can be used for specifying optical components and subsystems.     

Transport performance of an 80-Gb/s WDM regional area transparentring network utilizing directly modulated lasers

The transport performance of a regional area wavelength division multiplexing (WDM) transparent optical network is studied. We present excellent performance results (Q factors for all received signals greater than 10 with small power penalties) for a ring network based on application-optimized cost-effective optical layer components and fiber. The network consists of six network nodes, interconnected with 86.5-km spans of uncompensated negative dispersion fiber, resulting in a maximum transmission distance around the ring of 519 km, and it supports 32 directly modulated channels operating at 2.5 Gb/s (80-Gb/s network capacity). The novel design of the network nodes ensures great flexibility in terms of scalability and transparency, as well as great performance. To our knowledge, the capacity-length product of this transparent network, using cost-effective directly modulated lasers (DMLs) and no dispersion compensation, is the highest ever reported     

TDD场景下小基站蜂窝网络上下行交叉干扰建模及性能分析

针对小基站网络立体分布特性,提出了一种TDD制式下小基站蜂窝网络三维随机几何模型并进行了性能分析。首先,本文根据3-D PPP模型下小基站的空间分布特性推导了TDD制式下小基站网络上下行覆盖概率的数学表达式。接下来,基于覆盖概率的表达式和网络频谱效率的定义,分别推导了上下行交叉干扰场景下,小基站网络上下行频谱效率的一般表达式。仿真结果在验证了本文模型的合理性的同时还说明,随着下行小区占比和功率控制因子的增大,网络的频谱效率都呈下降趋势。除此之外,室内环境也会对网络的覆盖性能产生影响。      

Delay Analysis of All-Optical Packet-Switching Ring and Bus Communications Networks

We study the delay performance of all-optical packet communication networks configured as ring and bus topologies employing cross-connect switches (or wavelength routers). Under a cross-connect network implementation, a packet experiences no (or minimal) internal queueing delays. Thus, the network can be implemented by high speed all-optical components. We further assume a packet-switched network operation, such as that using a slotted ring or bus access methods. In this case, a packet's delay is known before it is fed into the network. This can be used to determine if a packet must be dropped (when its end-to-end delay requirement is not met) at the time it accesses the network. It also leads to better utilization of network capacity resources. We also derive the delay performance for networks under a store-and-forward network operation. We show these implementations to yield very close average end-to-end packet queueing delay performance. We note that a cross-connect network operation can yield a somewhat higher queueing delay variance levels. However, the mean queueing delay for all traffic flows are the same for a cross-connect network operation (under equal nodal traffic loading), while that in a store-and-forward network increases as the path length increases. For a ring network loaded by a uniform traffic matrix, the queueing delay incurred by 90% of the packets in a cross-connect network may be lower than that experienced in a store-and-forward network. We also study a store-and-forward network operation under a nodal round robin (fair queueing) scheduling policy. We show the variance performance of the packet queueing delay for such a network to be close to that exhibited by a cross-connect (all-optical) network.     

Image fusion based on discrete Chebyshev moments

Though deep learning-based methods have demonstrated strong capabilities on image fusion, they usually improve the fusion performance by increasing the width and depth of the network, increasing the computational effort and being unsuitable for industrial applications. In this paper, an end-to-end network based on fixed convolution module of discrete Chebyshev moments is proposed, which does not need any pre- or post-processing. The proposed network is roughly composed of three parts: feature extraction module, fusion module and feature reconstruction module. In the feature extraction module, a novel fixed convolution module based on discrete Chebyshev moments is proposed to obtain different frequency components in a short time. To improve the image sharpness and fuse more details, a spatial attention mechanism based on average gradient is proposed in fusion module. Extensive results demonstrate that the proposed network can achieve remarkable fusion performance, high time efficiency and strong generalization ability.     

YOLOv5与Deep-SORT联合优化的无人机多目标跟踪算法

针对无人机平台下小目标检测性能差、目标尺度变化较大、复杂背景干扰等导致跟踪失败的问题,该文提出一种联合优化检测器YOLOv5(You Only Look Once)和Deep-SORT(Simple Online and Realtime Tracking with a Deep Association Metric)的无人机多目标跟踪算法。该算法使用改进的CSPDarknet53(Cross Stage Paritial Darknet53)骨干网络重新构建检测器中的特征提取模块,同时通过自顶向下和自底向上的双向融合网络设计小目标检测层,采用无人机航拍数据集训练更新优化后的目标检测网络模型,解决小目标检测性能差问题;在跟踪模块中,提出结合时空注意力模块的残差网络作为特征提取网络,加强网络感知微小外观特征及抗干扰的能力,最后采用三元组损失函数加强神经网络区分类内差异的能力。实验结果表明,优化后的目标检测的平均检测精度相比于原始YOLOv5提升了11%,在UAVDT数据集上相较于原始跟踪算法准确率与精度分别提高了13.288%、3.968%,有效减少目标身份切换频次。     

基于随机Petri网模型的低轨卫星网络性能分析

基于随机Petri网(SPN)模型方法,对LEO单层卫星网络进行了性能分析.首先建立了半双工通信模式下LEO单层卫星网络的SPN模型,并选取平均时延作为网络性能评价指标、采用SPNP6.0软件对该SPN模型进行了性能评价,分析了数据包到达速率、网络负载以及消息数等参数对网络平均时延的变化关系.该建模与性能评价方法将有助于卫星网络的构建和进一步的性能分析.     

基于YOLOv3网络的自然环境下青苹果检测与识别

针对自然环境下青苹果目标与树叶颜色相似导致检测与识别困难的问题,提出一种基于YOLOv3网络的青苹果检测与识别方法.利用YOLOv3网络检测出图像中的青苹果目标区域,对目标区域进行HSV和YUV颜色空间分量下的阈值分割,选取青苹果目标提取效果较好的H、V和Y、U分量下的结果,通过形态学运算去除不连通的小区域得到青苹果目...     

Impact of PCS handoff response time

In a personal communications services (PCS) network, the network delay for a handoff request is limited by a timeout period. If the network fails to respond within the timeout period, the handoff call is forced terminated. We study the effect of the network response time on the performance (the call incompletion probability) of a PCS network. Our study indicates that at a small offered load, the network response time has a significant effect on the call incompletion probability. We also observe that the effect of the network response time is more significant if the mobile residence time distribution at a cell has a smaller variance     

战术数据链时延特性的仿真分析

时延是战术数据链的重要性能指标,时隙分配方案对时延有很大的影响。结合战术数据链L ink 16的通信协议,分析了数据链时延构成的各种因素,并采用概率周期分析方法,对主要构成因素进行了详细的统计分析。最后,采用目前常用的网络仿真软件OPNET对其TDMA组网方式进行了建模与仿真,仿真结果给出了战术数据链的时延与时隙分配方案和业务量的变化关系。     

An architecture for monitoring, visualization, and control ofgigabit networks

We outline a design of a highly scalable network monitoring, visualization, and control (NMVC) system with advanced algorithmic and human-in-the-loop capability. This capability allows network administrators to calibrate and fine-tune network and application parameters in real time according to observed traffic patterns. The goal of the NMVC system is to ensure adequate quality of service to network users, while maintaining high network resource utilization. The main components of our system are: a network probe and an endsystem probe which can probe gigabit/s links, software network management agents that provide extensible multi-attribute event filtering for highly scalable date/event collection, efficient online event ordering algorithms that can help synthesize and display a consistent view of network health, status, and performance and a View Choreographer that allows management applications and administrators to specify the mapping of network events to higher-level events and to visualization objects and updates     

基于SPN模型的卫星网络性能评价

基于随机Petri网(SPN)模型方法,分别对LEO单层卫星网络和LEO/MEO双层卫星网络进行了性能分析.首先分析了卫星网络的特点,并在此基础上建立了半双工通信模式下LEO单层卫星网络的SPN模型、全双工通信模式下LEO/MEO双层卫星网络的SPN模型.然后,选取平均时延作为网络性能评价指标、采用SPNP6.0软件对上述两个SPN模型进行了性能评价.最后,对两个模型的性能评价结果进行了对比分析,得出了有关在网络负载变化情况下LEO单层卫星网络和LEO/MEO双层卫星网络的性能优劣比较结论.     

A neural network for predicting decoder error in turbo decoders

It is shown that a neural network can be trained to predict the presence of errors in turbo-decoded data. The inputs to the network are samples of the cross entropy of the component decoder outputs at two or more time instants. Such a neural network can be used as a trigger for retransmission requests at either the beginning or at the conclusion of the decoding process, providing improved reliability performance and lower average decoding complexity than turbo decoding with CRC error detection     

Performance analysis of fault-tolerant systems in parallelexecution of conversations

The execution overhead inherent in the conversation scheme, which is a scheme for realizing fault-tolerant cooperating processes free of the domino effect, is analyzed. Multiprocessor multicomputer systems capable of parallel execution of conversation components are considered and a queuing network model of such systems is adopted. Based on the queuing model, various performance indicators, including system throughput, average number of processors idling inside a conversation due to the synchronization required, and average time spent in the conversation, have been evaluated numerically for several application environments. The numeric results are discussed and several essential performance characteristics of the conversation scheme are derived. For example, when the number of participant processes is not large, say less than six, the system performance is highly affected by the synchronization required on the processes in a conversation, and not so much by the probability of acceptance-test failure     

On gracefully degrading multiprocessors with multistageinterconnection networks

The behavior of a multiprocessing system with a multistage interconnection network is studied in the presence of faulty components. Measures for the connectivity and performance of these systems are proposed, including the average number of operational paths, the average number of accessible processors and memories, the average number of fault-free processors (memories) that are connected to an accessible memory (processor), the bandwidth, and the processing power of the system. Based on these measures, a tight upper bound for the maximal fully connected system is suggested. The gracefully degrading system is then compared, through some numerical examples, to a system whose faulty components are repaired upon failure. Based on these comparisons, the anticipated reduction in system performance can be estimated and consequently, appropriate maintenance policies can be determined     

The design and analysis of an ATM multicast switch with adaptivetraffic controller

The paper describes several improvements to a nonblocking copy network proposed previously for multicast packet switching. The improvements provide a complete solution to some system problems inherent in multicasting. The input fairness problem caused by overflow is solved by a cyclic running adder network (CRAN), which can calculate running sums of copy requests starting from any input port. The starting point can change adaptively in every time slot based on the overflow condition of the previous time slot. The CRAN also serves as a multicast traffic controller to regulate the overall copy requests. The throughput of a multicast switch can be improved substantially if partial service of copy request is implemented when overflow occurs. Call-splitting can also be implemented by the CRAN in a straightforward manner. Nonuniform distribution of replicated packets at outputs of the copy network may affect the performance of the following routing network. This output fairness problem due to underflow is solved by cyclically shifting the copy packets in every time slot. An approximate queueing model is developed to analyze the performance of this improved copy network. It shows that if the loading on each output of the copy network is maintained below 80%, the average packet delay in an input buffer would be less than two time slots     

Performance evaluation of large capacity broadcast-and-select optical crossconnects

In this work, two bufferless high capacity broadcast-and-select optical switching node architectures are presented and their performance is evaluated. The architectures are modular permitting the expansion from basic to complex structures by adding new blocks/components in a gradual way, enhancing at the same time the corresponding network functionality. The blocking performance is assessed and scheduling algorithms are proposed to solve contention for a single node. Finally, physical layer modeling is carried out in order to investigate node scalability and node cascadeability. Overall, the proposed solutions are offering modularity, transparency to switching technology, graceful evolution and high performance at an affordable cost.     

A self-routing multistage switching network for broadband ISDN

A switching network that approaches a maximum throughput of 100% as buffering is increased is proposed. This self-routing switching network consists of simple 2×2 switching elements, distributors, and buffers located between stages and in the output ports. The proposed switching requires a speedup factor of two. The structure and the operation of the switching network are described, and its performance is analyzed. The switch has log₂N stages that move packets in a store-and-forward fashion, incurring a latency of log₂ N time periods. The performance analysis of the switch under uniform traffic pattern shows that the additional delay is small, and a maximum throughput of 100% is achieved as buffering is increased