针对路面建模的Delaunay三角网格分治算法

为了对路面进行三维建模,使用Delaunay三角网分治算法处理路面点云数据,根据路面点云的特点,对点云进行划分中不考虑z坐标.使用Delaunay三角网分治算法处理不同规模的点云数据并记录生成三角网所需的时间,收集一段路面的点云数据并使用Delaunay三角网算法进行处理,观察生成的三角网是否和扫描的路面匹配.Delaunay三角网分治算法能够较快地生成三角网,但是在处理大规模点云数据时仍需消耗很多时间,同时针对路面三维建模问题,Delaunay三角网分治算法所生成的三角网能够很好地拟合路面.     

Fractal image compression based on Delaunay triangulation andvector quantization

Presents a new scheme for fractal image compression based on adaptive Delaunay triangulation. Such a partition is computed on an initial set of points obtained with a split and merge algorithm in a grey level dependent way. The triangulation is thus fully flexible and returns a limited number of blocks allowing good compression ratios. Moreover, a second original approach is the integration of a classification step based on a modified version of the Lloyd algorithm (vector quantization) in order to reduce the encoding complexity. The vector quantization algorithm is implemented on pixel histograms directly generated from the triangulation. The aim is to reduce the number of comparisons between the two sets of blocks involved in fractal image compression by keeping only the best representative triangles in the domain blocks set. Quality coding results are achieved at rates between 0.25-0.5 b/pixel depending on the nature of the original image and on the number of triangles retained.     

High resolution image formation from low resolution frames using Delaunay triangulation

An algorithm based on spatial tessellation and approximation of each triangle patch in the Delaunay (1934) triangulation (with smoothness constraints) by a bivariate polynomial is advanced to construct a high resolution (HR) high quality image from a set of low resolution (LR) frames. The high resolution algorithm is accompanied by a site-insertion algorithm for update of the initial HR image with the availability of more LR frames till the desired image quality is attained. This algorithm, followed by post filtering, is suitable for real-time image sequence processing because of the fast expected (average) time construction of Delaunay triangulation and the local update feature.     

基于Quad-Edge结构的散乱点集三角剖分并行算法研究及实现

三角剖分算法在计算几何中的地位非常重要,其中三角网格的剖分效率及质量对后续研究有着重要的影响。对Delaunay三角剖分算法的基本原理进行了分析,基于散乱点集研究了基于Quad-Edge结构下的分治算法,并将目前流行的Map-Reduce并行编程模型引入到对散乱点集进行基于Delaunay三角剖分中。实验结果表明基于Map-Reduce编程模型实现的三角剖分并行化在大数据量的情况下大大提高了剖分的效率,速度明显高于基于Quad-Edge结构实现的分治算法以及基于三角形索引的Bowyer-Watson三角剖分算法,并且具有很好的弹性计算能力,这对三角剖分的后续研究有重要的借鉴作用。     

Compression of image block means for non-equal block partition schemes using Delaunay triangulation and prediction

An approach based on applying Delaunay triangulation to the compression of mean values of image blocks that have non-identical shape and size is proposed. It can be useful for image compression methods that require the use of image partition schemes with non-equal block sizes, such as fractal and DCT-based image coding. Some aspects of practical realisation of the proposed method are discussed. Evaluation of the performance of the proposed method is carried out and comparisons with some conventional methods are made, demonstrating the potential of the method.     

Cyclic best-effort multicasting with FEC

Cyclic best-effort multicast supports reliable multicast transport by sending information repeatedly. The authors present forward error correcting (FEC) cyclic best-effort multicast which transmits FEC encoded redundant data as well as original data. FEC cyclic multicasting reduces the number of packet transmissions at least by half compared to plain cyclic multicasting     

IP多播的发展

多播通信已成为网络中的一个热点技术,由于一些互联网服务提供商（ＩＳＰ）的大力提倡,它正加速发展,并提供大规模的互联网应用和服务。因此,多播已发展为最有吸引力的互联网服务之一。 近来,多播的发展主要集中在域间多播协议的发展。当今多播的主要特征是,使用三个一组的选路协议,尽力部署多播（以更大的规模）。这些都在两个Ｉｎｔｅｒｎｅｔ２的主干网中部署──高速主干网络服务（ｖＢＮＳ）和Ａｂｉｌｅｎｅ。将来的多播将以新协议的持续发展、评估和标准化为基础。不但在选路的工作上,还包括如地址分配、管理和记帐等方面。 …     

Resilient multicast using overlays

We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10 000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1%-5%) and high topology change rates (5 changes per second) while incurring very low overheads (<5%).     

Flexible multicasting in high-capacity switches

Since packet switches with input queueing require low-speed buffers and simple cross-bar fabrics, they potentially provide high switching capacities. In these switches, the port that is a source of a multicast session might easily get congested with the increasing popularity of this session. We propose the protocol for scheduling packets in switches with input buffers for varying popularity of different content on the Internet. Copies of a multicast packet are forwarded through the switch, so that multicasting is evenly distributed over switch ports. The performance trade-off between capacity that can be reserved and guaranteed packet delay is discussed.     

IP multicasting over ATM networks

The Internet protocol (IP) multicast model involves a combination of intrasubnet and intersubnet multicast mechanisms. Technologies supporting a given subnet are expected to have native mechanisms for supporting intrasubnet forwarding of packets sent to multicast destinations. Multicast routers attach to subnets and provide intersubnet forwarding of multicast packets, using interdomain multicast routing protocols developed by the Internet Engineering Task Force (IETF). Unfortunately, ATM networks based on UNI 3.0 or UNI 3.1 signaling service do not provide the native multicast support expected by IP. This has led the IETF to develop the “MARS model”-a fairly complex mechanism for emulating intrasubnet multicast support required when running IPs over ATMs. This paper takes a high level look at the IP multicast service, examines the limitations of the ATM point-to-multipoint virtual channel service, and describes the major architectural points of the MARS model     

Virtual topologies for multicasting with multiple originators in WDM networks

In this paper, we consider the problem of multicasting with multiple originators in WDM optical networks. In this problem, we are given a set S of source nodes and a set D of destination nodes in a network. All source nodes are capable of providing data to any destination node. Our objective is to find a virtual topology in the WDM network which satisfies given constraints on available resources and is optimal with respect to minimizing the maximum hop distance. Although the corresponding decision problem is NP-complete in general, we give polynomial time algorithms for the cases of unidirectional paths and rings.     

Web服务器上应用层DDoS检测方法的改进

随着互联网越来越普及,它的弱点也被攻击者们越来越多地加以利用并攻击,由此造成了很大的损失。DDoS攻击是一个危害非常大的攻击方式,传统上的基于网络层的DDoS攻击方式由于技术的进步已经在很大程度上得到了抑制。现在,更多的DDoS攻击发生在应用层。尽管已经有了很多的检测方法,但是这种攻击在现阶段来说并没有得到根本的解决。文章将解释应用层DDoS攻击的原理及常见手段,并归纳总结现阶段主要的防御方法。最后针对这些方法中的不足提出了一种改进措施。     

字幕叠加算法设计

在卡拉OK字幕视频叠加过程中,边缘效果技术能够让文字与背景视频隔离,增强歌词显示的美观效果。文章结合directshow技术,提出了半径边缘检测方法,实现了边缘效果快速处理算法,达到了动态字幕叠加的增强显示效果。     

Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routing

The popularity of broadband streaming applications requires communication networks to support high-performance multicasting at the optical layer. Suffering from transmission impairments in multi-hop all-optical (transparent) WDM multicasting networks, the signal may be degraded beyond the receivable margin at some multicast destinations. To guarantee the signal quality, we introduce a translucent WDM multicasting network to regenerate the degraded signals at some switching nodes with electronic 3R (reamplification, reshaping and retiming) functionality. The translucent network is built by employing three kinds of multicasting capable switching architectures: (1) all-optical multicasting capable cross connect (oMC-OXC), (2) electronic switch and (3) translucent multicasting capable cross connect (tMC-OXC). Among them both the electronic switch and tMC-OXC are capable of electronic 3R regeneration. Furthermore, we propose a multicast-capable nodes placement algorithm based on regeneration weight, and two multicasting routing algorithms called nearest hub first and nearest on tree hub first to provide signal-quality guaranteed routes for the multicasting requests. The numerical simulation on two typical mesh networks shows that it is sufficient to equip 30% of the nodes or less with signal-regeneration capability to guarantee the signal quality.     

Symmetric routing in DHT overlays

In this paper, we propose to extend the DHT topology to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable search support. We consider routing algorithms for a bidirectional variant of the DHT network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.     

On the throughput of multicasting with incremental forward error correction

In this paper, we consider a multicasting model that uses incremental forward error correction (FEC). In this model, there is one sender and r/sup n/ receivers. The sender uses an ideal (n,n(1-p),np) FEC code to code a group of n(1-p) data packets with additional np redundant packets so that any set of n(1-p) packets received by a receiver can be used to recover the original n(1-p) data packets. Packets to the receivers are lost independently with probability q. For this model, we prove several strong laws of large numbers for the asymptotic throughput as n /spl rarr/ /spl infin/. The asymptotic throughput is characterized by the unique solution of an equation in terms of p, q, and r. These strong laws not only provide theoretical justification for several important observations made in the literature, but also provide insights that might have impact on future design of multicasting protocols.     

Online multicasting in WDM networks with shared light splitter bank

We study online multicasting in WDM networks with shared light splitter bank. Our objective is either to maximize the network throughput or to minimize the blocking probability. Due to the nature of dynamic requesting for network resources by online multicast requests, the network usually is unable to allocate the resources needed for each request in advance. Instead, it either accepts the request by building an economic multicast tree for the request, in terms of the utilization of the network resources if it has sufficient resources available, or rejects the request, otherwise. It is desirable that the cost of realizing each multicast request be minimized, and the network throughput will be maximized ultimately through the cost saving on each individual request. Since optical light splitting and wavelength conversion switching in optical networks is cost expensive and its fabrication is difficult, it is assumed that only a limited number of light splitters and wavelength converters are installed at a node, which will be shared by all the incoming signals at the node. In addition, it is further assumed that only a fraction of nodes in the network are installed with such optical switches. In this article we first propose a cost model for realizing an online multicast request under such network environments with limited light splitters and wavelength converters, which models the cost of utilization of network resources, particularly in modeling the light splitting and wavelength conversion ability at nodes. We then show that finding a cost-optimal multicast tree for a multicast request under the proposed cost model is NP-complete, and instead devise approximation and heuristic algorithms for it. We finally conduct experiments to evaluate the performance of the proposed algorithms. The results show that the proposed algorithms are efficient and effective in terms of network throughput.

PCS分层系统切换性能分析

本文讨论了注册微小区PCS分层系统的切换性能,给出了强迫中断概率的通用解析解;分析了软切换对切换性能的影响,给出了它们的解析解;得出注册微小区PCS分层系统的切换性能要好于普通PCS分层系统,普通PCS分层系统的切换性能要好于单层PCS系统。     

Cost-effective implementation of multicasting in wavelength-routednetworks

Multicasting in the optical domain has been recently shown to provide substantial savings in terms of the network-wide average packet hop distance and the total number of transceivers in the network. Current proposed multicasting architectures [e.g., splitter-and-delivery (SaD)] employ power splitting mechanisms which have the side effect of high fabrication cost due to the large number of splitters and the need for optical amplifiers. We propose a low-cost novel architecture called tap-and-continue (TaC) for realizing multicasting. This architecture provides a natural evolution from current unicast cross-connects and is based on tapping devices. We prove that any multicasting session can be feasibly realized in networks employing only TaC cross-connects, and the problem of finding the optimal multiple-destination minimum cost trail in such networks is NP-complete. Therefore, we develop a 4-approximation algorithm for multiple-destination routing. Simulation results demonstrate that the TaC cross-connect provides a realistic, cost-effective approach for implementing multicasting with negligible blocking degradation especially in multifiber networks     

一种改进的EPON系统组播实现方案

在对现有的二层组播协议分析与比较的基础上提出采用IGMP Snooping协议在EPON中实现组播.结合组播逻辑链路标识(LLID)以及操作管理维护(OAM)帧的运用.探讨一种改进的EPoN组播实现方案.