计算机高速网络的拥塞控制:一种基于速率的PI方法

本文运用现代控制理论和方法,针对计算机高速互联网中最大服务交通流即能控交通流的调节问题,提出了一种基于速率的具有比例加积分(PI)控制器结构的拥塞控制理论和方法.在单个节点的交通流的模型基础上,运用控制理论中系统稳定性分析方法,讨论如何利用信终端节点缓冲占有量的比例加积分的反馈形式来调节信源节点的能控交通流的输入速率,从而使被控网络节点的缓冲占有量趋于稳定;同时使被控网络节点的稳定队列长度逼近指定的门限值.仿真结果显示,在所设计的PI控制方案下,网络的有关性能较好.     

一种码率自适应信源信道联合编码系统

双LDPC码系统是新近出现的一种信源信道联合编码系统,该系统的性能虽然好但不稳定,在信源熵增加时会产生很高的误码平台。为了解决这一问题,提出了一种码率自适应双LDPC码系统,此系统采用码率自适应LDPC码作为信源码,当信源熵变化时可以灵活地调整信源码率,从而保证系统在高低不同的信源熵情况下都具有优秀、稳定的性能。仿真结果显示,在高低不同的信源熵情况下,所提出的码率自适应双LDPC码系统性能均好于传统双LDPC码系统,而且在误比特率为10-6时都没有出现误码平台。     

一种在宽带无线网络环境下的协作分集方法

协作通信可以使单天线的移动终端共享它们的天线而产生虚拟多发射天线阵列以获得发射分集。提出了一种在频率选择性衰落信道条件下的协作分集方法,信宿不仅利用转接节点转发的信号而且还利用了信源直接传来的信号来进行解码。通过计算机仿真,比较了考虑信源到信宿的直接传输的协作方法和未考虑信源到信宿的直接传输的协作方法的误比特率性能。结果表明,考虑信源到信宿的直接传输可提高系统的协作分集增益。     

中国工程技术电子信息网

中国工程技术电子信息网由原电子工业部科技情报研究所主办，北京市信源电子信息技术公司承办，是中国工程技术信息网的一个主干节点。目前上网的资源有：（１）数据库：电子厂商查询、电子产品查询、声像资料库、《计算机世界》全文检索信息库、《国际电子报》全文检索信...     

基于节点机会角色转换的M2M上行通信策略

针对M2M(Machine-to-Machine,机器通信)网络,终端节点上行通信过程中多网关节点并存的场景,研究了该场景下的一个简化模型:一个终端节点为信源,两个网关节点竞争成为信宿,把接收到信源发送的数据转发至基站。利用角色转换思想,提出了基于本地信道状态信息的节点机会角色转换策略(ORT-L, Opportunistic Role Transition Protocol based on Local Channel State Information),并研究了该场景下协同网络的中断概率和能量效率性能。从蒙特卡罗仿真中,证明了ORT-L角色转换策略仅仅依靠本地信道状态信息的可行性,并在性能相比于传统协同通信网络在可靠性和能量效率上有很大改善。其理论分析值与仿真结果相吻合。     

基于混合信号的放大转发中继系统的物理层安全传输

中继系统可以增强物理层安全算法的系统性能,这种系统一般包含两阶段的通信过程:从信源到中继节点,在从中继节点到目的节点.通常来说,第一阶段的信息传输缺乏保护,如果窃听者距离信源节点比较近的话,系统性能就无法保证了.该文提出了一种基于混合信号的三阶段的传输方法确保整个传输过程中的保密性能,这样,当窃听者接近信源节点的时候,仍可以保证系统的安全性能.这种方法的优化解是一个复杂的非凸优化问题,该文中建议了一种低复杂度的次优解来解决其中的优化问题.理论分析以及方针结果证明,该方法可以有效确保系统的全过程的安全性能.     

CMMB科普问答——术语篇

什么是信源，什么是信道？ 信源是需要传输的信息．CMMB的信源主要为音视频及数据。信道是信息传输的通道，CMMB的传输采用的是无线广播电视信道。     

联合信源信道编码的原理及其在无线通信中的应用

根据香农信源和信道分离编码理论进行的分离信源和信道编码在时变信道时不能充分利用系统资源。正是在这种情况下 ,提出了信源信道联合编码 ,可以跟随信道的变化充分利用通信系统的资源 ,达到最好的端对端的通信效果。本文首先阐述了联合信源信道编码的原理 ,然后介绍了常用的实现方法 ,最后 ,提出了在设计联合信源信道编码系统时的改进方法。     

具有大容量缓存器的ATM网络交换节点的接入允许控制

本文讨论了ＡＴＭ网络交换节点的缓存器容量较大时,如何实现实时接入允许控制的问题。我们从大量的计算机模拟的结果中发现,对于符合负指数分布的马尔可夫ＯＮ／ＯＦＦ单一类型或多类型信源,在信元及系统的其它参数保持不变的条件下,信元丢失概率和丢失率,只取决于缓存器容量与信元平均突发长度的比值。本文从“生灭过程”出发加以了证明。     

核心通信网的光分组交换

文章首先简单说明了新一代通信网需要使用分级交换的由来。接着详细叙述了光分组交换在未来光通信网的应用，包括节点结构、分组格式、输入、输出接口和一些特别重要的技术，如再生、同步、信头处理、缓冲、空间交换和波长转换等。     

一种多播拥塞控制中速率的调节机制

本文针对计算机高速互联网中多播流的速率调节问题,在单点对多点的多播流量模型基础上,提出了一种由发送方驱动的单速率多播拥塞控制器的设计方法。并且运用现代控制理论和方法,讨论如何利用基于多播的单速率拥塞控制方法来对多播发送节点的发送速率进行调节,从而使得发送节点的发送速率趋于稳定。对所提出的拥塞控制方案,本文进行了分类仿真,仿真结果显示,控制方案使网络性能表现良好。     

Delay Models of Single-Source Single-Relay Cooperative ARQ Protocols in Slotted Radio Networks With Poisson Frame Arrivals

In conventional (noncooperative) automatic repeat request (ARQ) protocols for radio networks, the corrupted data frames that cannot be correctly decoded at the destination are retransmitted by the source. In cooperative ARQ protocols, data frame retransmissions may be performed by a neighboring node (the relay) that has successfully overheard the source's frame transmission. One advantage of the latter group of ARQ protocols is the spatial diversity provided by the relay. The first delay model for cooperative ARQ protocols is derived in this paper. The model is analytically derived for a simple set of retransmission rules that make use of both uncoded and coded cooperative communications in slotted radio networks. The model estimates the delay experienced by Poisson arriving frames, whose retransmissions (when required) are performed also by a single relay. Saturation throughput, data frame latency, and buffer occupancy at both the source and relay are quantified and compared against two noncooperative ARQ protocols.     

Message Drop Control Buffer Management Policy for DTN Routing Protocols

In delay tolerant network interruptions will occur continuously because there is no end-to-end path exists for the longer period of time from source to destination. In this context, delays can be immensely large due to its environment contrails e.g. wildlife tracking, sensor network, deep space and ocean networks. Furthermore, larger replication of messages put into the network is to increase delivery probability. Due to this high buffer occupancy storage space and replication result in a huge overhead on the network. Consequently, well-ordered intelligent message control buffer drop policies are necessary to operate on buffer that allows control on messages drop when the node buffers are near to overflow. In this paper, we propose an efficient buffer management policy which is called message drop control source relay (MDC-SR) for delay tolerant routing protocols. We also illustrate that conventional buffer management policy like Drop oldest, LIFO and MOFO be ineffective to consider all appropriate information in this framework. The proposed MDC-SR buffer policy controls the message drop while at the same time maximizes the delivery probability and buffer time average and reduces the message relay, drop and hop count in the reasonable amount. Using simulations support on an imitation mobility models Shortest Path Map Based Movement and Map Route Movements, we show that our drop buffer management MDC-SR with random message sizes performs better as compared to existing MOFO, LIFO and DOA.     

基于图卷积神经网络的软件定义电力通信网络路由控制策略

传输时延和数据包丢失率是电力通信业务可靠传输重点关注的问题,该文提出一种面向软件定义电力通信网络的最小路径选择度路由控制策略。结合电力通信网络软件定义网络(SDN)集中控制架构的特点,利用图卷积神经网络构建的链路带宽占用率预测模型(LBOP-GCN)分析下一时刻路径带宽占用率。通过三角模算子(TMO)融合路径的传输时延、当前时刻的路径带宽占用率和下一时刻的路径带宽占用率,计算出从源节点到目的节点间不同传输路径的选择度(Q),然后将Q值最小的路径作为SDN控制器下发的流表项。实验结果表明,该文所提出的路由控制策略能有效减小业务传输时延和数据包丢失率。

     

信道公平分配的局部拥塞控制算法

提出基于信道公平分配的局部拥塞控制算法FCA(fair channel allocation),在缓解局部拥塞的同时增强信道分配的公平性。为减少获取邻居节点实时缓存信息的通信开销和提高以单一节点缓存是否溢出为检测模型的准确性,FCA采用以节点实时缓存长度预测为基础的邻居节点缓存总长度和分组平均传输延迟作为检测指标的拥塞检测模型。为避免使用独立拥塞通告消息增加信道负载,FCA采用在ACK控制帧中增加一个节点地址位携带拥塞信息。在去拥塞阶段,FCA采用基于实时缓存长度和队列优先权值的信道分配机制保证公平传输和防止部分节点因缓存增速过快导致溢出分组丢失。实验结果表明,FCA在碰撞次数、分组传递率、吞吐量和公平性等方面相比802.11、CODA和PCCP具有显著优势。     

基于本地缓存的弹性分组环保护机制

本文提出一种基于本地缓存的弹性分组环保护倒换机制(WrapProtectionBasedOnLocalBuffers,简称WP-LB)。其主要思想是当环路上任何位于源节点和故障区域之间的中间节点接收到含有故障信息的控制信令后,就不再向下游转发数据分组,而是在本地缓存这些数据。等到保护通路建立好之后,再把缓存的数据分组经过保护通路发送给目的节点。分析计算表明,与原有的保护倒换(WrapProtection,简称WP)机制相比,WP-LB机制不仅提高带宽利用率,减少平均时延,并且还能避免数据包的丢失和失序。     

A Delay-Aware Congestion Control Protocol for Wireless Sensor Networks

In wireless sensor networks, congestion leads to buffer overflowing, and increases delay. The tradi-tional solutions use rate adjustment to mitigate congestion, thus increasing the delay. A Delay-aware congestion con-trol protocol (DACC) was presented to mitigate congestion and decrease delay. In order to improve the accuracy of the existing congestion detection model which is based on the buffer occupancy of a single node, DACC presents a new model considering both the real-time buffer occupancy and the average transmission time of packets. DACC uses the untapped bits in the IEEE 802.11 Distributed coordination function (DCF) frames header to carry congestion infor-mation. During the congestion alleviation period, DACC presents a channel occupancy mechanism which is based on the real-time buffer occupancy for the purpose of decreas-ing delay and preventing packet loss. Simulation results indicate that in terms of delay, packet delivery ratio, col-lision and buffer load, DACC has comparative advantages than those of 802.11 DCF, Priority-based congestion con-trol protocol (PCCP) and Decoupling congestion control and fairness (DCCF).     

Edge node buffer usage in optical burst switching networks

Optical Burst Switching (OBS) combines the benefits of Optical Packet Switching and Optical Circuit Switching technologies to provide an efficient, yet cost effective, method for data transmission in an all-optical, bufferless, core network. While most studies on OBS has concentrated on the core OBS network, we contribute new studies for the buffer requirement of an OBS edge node. The buffer usage for OBS systems only arises in the edge nodes since they contain an array of assemblers which combines electronic data with a common destination into an OBS burst stream for transmission in an all-optical bufferless core network. Specifically, we present two analytical results for buffer usage in an OBS edge node: one for Poisson traffic and the other for self-similar traffic input. The results show that the aggregated traffic from many assemblers inherits the characteristics of the source input traffic. This means that the output traffic approaches Poisson if the input traffic is Poisson, and the output traffic remains self-similar if the input is self-similar. These results lead to the following important design issues when dimensioning buffer requirements in an OBS edge node: if the traffic input is Poisson, the M/G/m model is the model to use for obtaining the upper bound on buffer usage in an OBS edge node; and for the case of self-similar traffic, Brichet’s method can be used to provide the upper and lower bound.     

Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network

We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. The source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node’s sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e., expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.