管道流量泄漏监测的传感器网络中拥塞控制协议的研究

针对管道流量泄漏和管网突发性的爆管,以管道流量泄漏为应用对象,将一种协同式拥塞控制协议应用于管道流量泄漏监测中,提出TCP(transmission control protocol)拥塞控制改进协议C3P(cooperant congestion control protocol),通过C3P源端检测RTT(round trip time)延时信息和路由器反馈的1bit显式预测信息来判断网络拥塞状态,自适应地调节拥塞窗口.仿真实验表明C3P协议能够有效地适应高带宽延时网络的传输特性,以保证网络获得更优的链路利用率、TCP友好性以及流与流之间的公平性.     

TCP友好的多媒体通信流控制机制

该文给出了一个端到端的适应性多媒体流控制策略,称为基于丢失延时的算法LDA(loss-delaybasedalgo-rithm),它调整多媒体流的发送行为,以符合网络的当前拥塞状况。LDA算法利用实时传输协议RTP(real-timetransportprotocol)来收集分组丢失和延时统计信息,并用来调整发送端的发送行为,使它和TCP的拥塞控制有类似的统计特性,是TCP友好的。仿真的结果显示LDA算法对于网络资源的利用、拥塞避免和TCP流的公平性都是比较好的。     

高带宽延时网络下拥塞控制协议比较与分析

随着网络技术的飞速发展和接入性能的不断提高,如今全世界的互联主干网络呈现出一种高带宽高延时(High Bandwidth-Delay Product Networks)的网络特性.在这种网络特性下,传统网络中的TCP拥塞控制协议已经开始显现出不适应性,如带宽利用率低下、流量抖动频繁等问题.近些年来,各国学者均提出一些适应这种网络环境变化的拥塞控制协议,基于这些协议中窗口调节机制所采用的反馈信息,本文将其划分为三类:基于丢包反馈的协议、基于路径延时反馈的协议和基于显式反馈的协议,并分析了这些协议的优缺点.在总结了高带宽延时网络下拥塞控制协议研究成果的基础上,进一步分析了网络中的传输延时RTT、瓶颈路由器缓存和路由器队列管理算法对现有拥塞控制协议的影响,并通过NS2对各协议在高带宽延时网络下的性能进行了一次全面的比较和评价.最后文章在总结前人工作的基础上,指出了高带宽延时网络下拥塞控制协议性能优化的研究方向.     

高速网络拥塞控制协议VCP的研究

互联网正在逐步进入一种高带宽延时积的高速网络时代.当网络的带宽或者时延增大时,TCP协议的性能严重下降,最显著的就是网络瓶颈处带宽利用率很低.在高速拥塞控制方面比较理想的XCP协议却存在部署方面的问题.变结构拥塞控制协议(VCP)可有效地解决上述问题.VCP协议联合使用ECN机制的两个二进制来编码拥塞信息.根据来自接收端的拥塞信息,VCP协议的发送端选择控制算法来响应拥塞信号.仿真实验表明VCP协议与TCP协议、XCP协议相比不仅具有较高的链路利用率,并且对现有的协议改动非常小,有利于逐步地实施.     

数据中心网络快速反馈传输控制协议

在数据中心网络中,当多个服务器同时向一个接收端发送数据时,产生的数据流量易在瓶颈交换机的缓冲区溢出,造成丢包事件以及数据重传,导致TCP Incast问题。为此,提出一种可快速反馈的数据中心网络传输控制协议( FFDTCP)。该协议在TCP协议的基础上采用显式拥塞通知机制,利用2个显式拥塞通知位通告4种拥塞级别,发送端根据拥塞信息所表示的拥塞级别快速调整拥塞窗口以减少拥塞,从而避免因瓶颈链路丢包而造成的吞吐量急剧下降问题。 NS2仿真实验结果表明,与传统TCP协议相比,FFDTCP协议可以保证较低的时延和较大的吞吐量,有效缓解TCP Incast问题,提高数据中心网络传输性能。     

混合网络中一种基于拥塞概率预测的TCP协议

现有的TCP协议采用丢包事件、拥塞反馈信息或往返时延等信息启动拥塞控制,而这些基于单个数据包信息的方法进行丢包区分的能力较弱,使得有线/无线混合网络中的非拥塞丢包影响了TCP的拥塞控制行为.本文提出了一种新的TCP协议,PceReno(Probability of Congestion or Error),它通过对最近一段数据的拥塞概率预测来决定如何响应当前丢包事件,从而避免盲目的启动拥塞控制.这种先应式拥塞感知和后应式拥塞响应相结合的拥塞控制方法不需要增加额外的开销,完全依赖于原有的拥塞控制.实验结果表明PceReno能够较好地对抗随机错误,有效提高TCP在混合网络中的吞吐量.     

MANET中TCP数据包的乱序问题及其解决方案

在MANET中,节点的移动性会导致不同的TCP数据包沿不同的路径到达接收端,进而在接收端产生大量的乱序数据包,影响TCP协议的性能.提出了一种延时响应TCP协议(TCP-D),通过延时触发拥塞控制算法来提高TCP协议在MANET中的性能.对延时响应TCP协议的吞吐量分析表明,增加延时定时器后,TCP_D协议仍能保证对标准TCP协议的友好性.仿真实验表明,TCP_D算法可以明显减少乱序数据包的数量,获得较标准TCP协议更高的网络吞吐量.而在网络结构稳定、无乱序数据包的情况下,改进协议仍具有很好的公平性和友好性.     

基于SDN数据中心网络的时限感知的拥塞控制算法

当前SDN的数据中心发展迅速,针对数据中心网络存在的长短流竞争和TCP Incast引起的短流高延迟问题,提出SDN-D2TCP方案。该方案借助SDN的集中控制优势,利用控制器侦测多对一的网络流通信行为,预测交换机的TCP Incast发生瓶颈,并考虑时延敏感流的特性要求,结合D2TCP的时限感知和显式拥塞通知机制,调整拥塞窗口,增强短流竞争力。通过NS2实验仿真,相较于DCTCP与D2TCP,SDN-D2TCP能够有效降低TCP Incast的发生概率,保证短流低延时。     

FAST TCP稳定性研究

拥塞控制机制是一种分布式算法,本文分析和证明了一种在高速度高延时的TCP协议(FAST TCP)的拥塞控制机制的稳定性.在研究中,使用了一种基于时钟自同步分离时间模型.通过试验证明和理论分析,证明了FAST TCP在单瓶颈链路中拥有的反馈延时可以通过调整参数来达到稳定.     

基于TCP友好的无线网络拥塞控制机制研究

网络实时多媒体业务的广泛应用对传统传输层协议提出了新的挑战:拥塞控制机制的缺乏使得UDP严重抢占TCP应用的共享带宽,从而降低网络的公平性,甚至导致网络拥塞.针对无线网络的高误码特性,将传输延时抖动引入到TFRC控制机制中,提出了一种基于速率控制的TCP友好拥塞控制算法TFRC-JI.该算法基于传输延时抖动有效区分无线链路的拥塞和误码,并以此反馈至发送端,实现不同的速率控制机制.实验结果表明,与传统的TFRC相比,改进的TFRC-JI在保持对TCP业务友好性的同时实现了链路的高效使用,并降低了传输时延抖动,从而较好地适应多协议共存的无线网络实时业务传输.     

面向流媒体基于蚁群的副本选择算法

本文针对流媒体Cloud-P2P存储模式中的副本选择,提出一种基于蚁群算法的改进算法（replica selection algorithm in Cloud-P2P based on ant colony algorithm,C²P²RSA²）,建立副本选择度量标准（副本节点的网络带宽、网络延时等）与蚁群信息素的映射,定义了副本信息素概率,最后得到一组副本资源的最优解.实验表明,与PARSA算法（Pheromone-base Ant colony Replica adaptive Selection Algorithm in cloud storage）和最佳副本选择算法比较,在平均访问时间增加2%–5%的情况下,本文的算法对云副本节点的负载率减少15%–25%.     

A relationship between difference hierarchies and relativized polynomial hierarchies

Chang and Kadin have shown that if the difference hierarchy over NP collapses to levelk, then the polynomial hierarchy (PH) is equal to thekth level of the difference hierarchy over ₂ ^p . We simplify their poof and obtain a slightly stronger conclusion: if the difference hierarchy over NP collapses to levelk, then PH collapses to (P _(k–1) ^NP )^NP, the class of sets recognized in polynomial time withk – 1 nonadaptive queries to a set in NP^NP and an unlimited number of queries to a set in NP. We also extend the result to classes other than NP: For any classC that has _m ^p -complete sets and is closed under _conj ^p -and _m ^NP -reductions (alternatively, closed under _disj ^p -and _m ^co-NP -reductions), if the difference hierarchy overC collapses to levelk, then PH ^C = (P _(k–1)–tt ^NP ) ^C . Then we show that the exact counting class C_P is closed under _disj ^p - and _m ^co-NP -reductions. Consequently, if the difference hierarchy over C_P collapses to levelk, then PH^PP(= PH^C_P) is equal to (P _(k–1)–tt ^NP )^PP. In contrast, the difference hierarchy over the closely related class PP is known to collapse.Finally we consider two ways of relativizing the bounded query class P _k–tt ^NP : the restricted relativization P _k–tt ^{NP C} and the full relativization (P _k–tt ^NP ) ^C . IfC is NP-hard, then we show that the two relativizations are different unless PH ^C collapses.Richard Beigel was supported in part by NSF Grants CCR-8808949 and CCR-8958528. Richard Chang was supported in part by NSF Research Grant CCR 88-23053. This work was done while Mitsunori Ogiwara was at the Department of Information Science, Tokyo Institute of Technology, Tokyo, Japan.     

Single quantum dot-micelles coated with gemini surfactant for selective recognition of a cation and an anion in aqueous solutions

The synthesis of quantum dot coated with cetyltrimethyl ammonium bromide (CTAB) and gemini surfactant [C₁₂H₂₅N⁺(CH₃)₂(CH₂)₄(CH₃)₂N⁺C₁₂H₂₅]·2Br⁻ (C_12-4-12) in aqueous solution have been described. It is characterized by photoluminescent spectroscopy, UV–vis spectroscopy and transmission electron microscopy (TEM), etc. In comparison with CTAB-coated QDs, the QDs coated with C_12-4-12 respond selectively to both transition metal ion copper and fluoride ion in aqueous media. When Cu²⁺ is bound to C_12-4-12-coated QD micelles, the fluorescence intensity is quenched. Linear relationships are found between the relative fluorescence intensity and the concentration of Cu²⁺ in the range 0–500 μM, which is best described by a Stern–Volmer-type equation. Meanwhile, it is found that F⁻ enhanced the luminescence of the C_12-4-12-coated QD micelles in a concentration dependence that is described by a Langmuir binding isotherm equation in the range 0–300 μM. The limits of detection of Cu²⁺ and F⁻ are 1.1 and 0.68 μM, respectively. The possible mechanism is discussed.     

An analytical C3 continuous tool path corner smoothing algorithm for 6R robot manipulator

Tool path smoothness is important to guarantee good dynamic and tracking performance of robot manipulators. An analytical C³ continuous tool path corner smoothing algorithm is proposed for robot manipulators with 6 rotational (6R) joints. The tool tip position is smoothed directly in the workpiece coordinate system (WCS). The tool orientation is smoothed after transferring the tool orientation matrix as three rotary angles. Micro-splines of the tool tip position and tool orientation are constructed under the constraints of the maximum deviation error tolerances in the WCS. Then the tool orientation and tool tip position are synchronized to the tool tip displacement with C³ continuity by replacing the remaining linear segments using specially constructed B-splines. Control points of the locally inserted micro-splines are all evaluated analytically without any iterative calculations. Simulation and experimental results show that the proposed algorithm satisfies constraints of the preset tool tip position and the tool orientation tolerances. The proposed corner smoothing algorithm achieves smoother and lower jerks than C² continuous corner smoothing algorithm. Experimental results show that the tracking errors associated to the execution of the C³ continuous tool path are up to 10% smaller than C² continuous path errors.     

Validation of SeaWiFS chlorophyll a concentrations in the Southern Ocean: A revisit

Surface chlorophyll a concentrations (C_a, mg m^− 3) in the Southern Ocean estimated from SeaWiFS satellite data have been reported in the literature to be significantly lower than those measured from in situ water samples using fluorometric methods. However, we found that high-resolution (∼ 1 km²/pixel) daily SeaWiFS C_a (C_a^SWF) data (SeaDAS4.8, OC4v4 algorithm) was an accurate measure of in situ C_a during January-February of 1998-2002 if concurrent in situ data measured by HPLC (C_a^HPLC) instead of fluorometric (C_a^Fluor) measurements were used as ground truth. Our analyses indicate that C_a^Fluor is 2.48 ± 2.23 (n = 647) times greater than C_a^HPLC between 0.05 and 1.5 mg m^− 3 and that the percentage overestimation of in situ C_a by fluorometric measurements increases with decreasing concentrations. The ratio of C_a^SWF/C_a^HPLC is 1.12 ± 0.91 (n = 96), whereas the ratio of C_a^SWF/C_a^Fluor is 0.55 ± 0.63 (n = 307). Furthermore, there is no significant bias in C_a^SWF (12% and − 0.07 in linear and log-transformed C_a, respectively) when C_a^HPLC is used as ground truth instead of C_a^Fluor. The high C_a^Fluor/C_a^HPLC ratio may be attributed to the relatively low concentrations of chlorophyll b (C_b/C_a = 0.023 ± 0.034, n = 482) and relatively high concentrations of chlorophyll c (C_c/C_a = 0.25 ± 0.59, n = 482) in the phytoplankton pigment composition when compared to values from other regions. Because more than 90% of the waters in the study area, as well as in the entire Southern Ocean (south of 60° S), have C_a^SWF between 0.05 and 1.5 mg m^− 3, we consider that the SeaWiFS performance of C_a retrieval is satisfactory and for this C_a range there is no need to further develop a “regional” bio-optical algorithm to account for the previous SeaWiFS “underestimation”.     

Characterizing r-perfect codes in direct products of two and three cycles

An r-perfect code of a graph G=(V,E) is a set C⊆V such that the r-balls centered at vertices of C form a partition of V. It is proved that the direct product of Cm and Cn (r?1, m,n?2r+1) contains an r-perfect code if and only if m and n are each a multiple of ²(r+1)+r² and that the direct product of Cm, Cn, and C? (r?1, m,n,??2r+1) contains an r-perfect code if and only if m, n, and ? are each a multiple of r³+³(r+1). The corresponding r-codes are essentially unique. Also, r-perfect codes in C2r×Cn (r?2, n?2r) are characterized.     

Estimating east Mediterranean forest parameters using Landsat ETM

The conservation of Jordan's Mediterranean forest requires the use of remote sensing. Among the most important parameters needed are the crown-cover percentage (C) and above-ground biomass (A). This study aims to: (1) identify the best predictor(s) of C using Landsat Enhanced Thematic Mapper (ETM) bands and the derived transformed normalized difference vegetation index (TNDVI); (2) determine if C is a good predictor of A, volume (V), Shannon diversity index (S) and basal area (B); and (3) generate maps of all these parameters. A Landsat ETM image, aerial photographs and ground surveys are used to model C using multiple regression. C is then modelled to A, V, S and B using linear regression. The relationship between C and Landsat ETM bands (1 and 7) plus the TNDVI is significantly high (coefficient of determination R ² = 0.8) and is used to produce the C map. The generated C map is used to predict A (R ² = 0.56), V (R ² = 0.58), S (R ² = 0.50) and B (R ² = 0.43). Cross validation for the predicted C map (cross-validation error = 5.3%) and for the predicted forest-parameter maps (cross-validation error = 13.7%–19.9%) shows acceptable error levels. Results indicate that Jordan's east Mediterranean forest parameters can be mapped and monitored for biomass accumulation and carbon dioxide (CO₂) flux using Landsat ETM images.     

Steiner Triple Systems of Order 21 with a Transversal Subdesign TD(3, 6)

A Steiner triple system (STS) contains a transversal subdesign TD(3, w) if its point set has three pairwise disjoint subsets A, B, C of size w and w² blocks of the STS intersect with each of A, B, C (those w² blocks form a TD(3,w)). We prove several structural properties of Steiner triple systems of order 3w + 3 that contain one or more transversal subdesigns TD(3, w). Using exhaustive search, we find that there are 2 004 720 isomorphism classes of STS(21) containing a subdesign TD(3, 6) (or, equivalently, a 6 × 6 Latin square).

     

A local and global classification machine with collaborative mechanism

As an advanced local and global learning machine, the existing maxi–min margin machine (M⁴) still has its heavy time-consuming weakness. Inspired from the fact that covariance matrix of a dataset can characterize its data orientation and compactness globally, a novel large margin classifier called the local and global classification machine with collaborative mechanism (C²M) is constructed to circumvent this weakness in this paper. This classifier divides the whole global data into two independent models, and the final decision boundary is obtained by collaboratively combining two hyperplanes learned from two independent models. The proposed classifier C²M can be individually solved as a quadratic programming problem. The total training time complexity is \(O(2N^3)\) which is faster than \(O(N^4)\) of M⁴. C²M can be well defined with the clear geometrical interpretation and can also be justified from a theoretical perspective. As an additional contribution, it is shown that C²M can robustly leverage the global information from those datasets with overlapping class margins, while M⁴ does not use such global information. We also use the kernel trick and exploit C²M’s kernelized version. Experiments on toy and real-world datasets demonstrate that compared with M⁴, C²M is a more time-saving local and global learning machine.