SKY: efficient peer-to-peer networks based on distributed Kautz graphs

Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base > 2. To address this problem, this paper presents the “distributed Kautz (D-Kautz) graphs”, which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations. Supported partially by the National Natural Science Foundation of China (Grant Nos. 60673167 and 60703072), the Hunan Provincial Natural Science Foundation of China (Grant No. 08JJ3125), and the National Basic Research Program of China (973) (Grant No. 2005CB321801)     

一种面向动态异构网络的容错非对称DHT方法

设计具有更优的"度-直径"折衷关系,并能更好地适应动态、异构的Internet环境的DHT方法是结构化P2P技术研究的重点.提出一种容错、非对称的DHT方法:A-DHT.A-DHT根据接入延迟、带宽和用户行为把节点分成胖节点和瘦节点两类,并以Hyper-de Bruijn图为基础构建非对称的网络拓扑.A-DHT充分利用胖节点的消息转发能力实现了更优的、"平均度-直径"折中.同时,A-DHT又利用瘦节的冗余边得到了比各种基于字母表的DHT方法更好的容错性.介绍了A-DHT的静态拓扑结构、路由算法以及基于A-DHT构建P2P网络的若干算法.理论分析和实验证明,A-DHT在低网络负载条件下能够有效降低路径长度和延迟,在高网络负载条件下能够有效避免胖节点的过载,同时具有较好的容错特性.     

能量优先的无线传感器网络拥塞缓解机制

为适应无线传感器网络大数据量传输的需求,提出一种基于能量优先的拥塞缓解机制(PECR)。根据网络对整体能耗的要求,将节点剩余能量作为一项重要参考指标。节点周期性地检测缓冲区队列占用率来确定当前拥塞度,当拥塞发生时,节点依据拥塞度和剩余能量两项属性,尝试在拥塞节点周围建立临时最佳路径进行分流调节。实验结果表明,采用该机制时,在有节点冗余的网络区域内,可降低节点能耗,提高网络整体生存寿命。     

A congestion-aware search protocol for heterogeneous peer-to-peer networks

Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the scalability problem, because P2P systems typically support millions of users online concurrently. Gnutella suffers from poor scaling due to its flooding-based search, resulting in excessive amounts of repeated query messages. Therefore, a good search protocol plays an important role in a system’s scalability. However, congestion, due to large query loads from users, definitely impacts on the performance of search protocols, and this consideration has received little attention from the research community. In this paper, we propose a congestion-aware search protocol for unstructured P2P networks. Our protocol consists of three parts—Congestion-Aware Forwarding, Random Early Stop and Emergency Signaling. The aim of our protocol is to integrate congestion control and object discovery functionality so that the search protocol can achieve good performance under congested networks and flash crowds. We perform extensive simulations to study our proposed protocol. The results show that our protocol can significantly reduce the hit delay while maintaining the high hit rate and also the congestion problems such as query loss and the peer overloading problem can be effectively alleviated.     

A novel key pre-distribution scheme for wireless distributed sensor networks

A novel key pre-distribution scheme for sensor networks is proposed, which enables sensor nodes to communicate securely with each other using cryptographic techniques. The approach uses the rational normal curves in the projective space with the dimension n over the finite field F q . Both secure connectivity and resilience of the resulting sensor networks are analyzed. By choosing the parameters q and n properly, this key pre-distribution scheme has some advantages over the previous known schemes. In addit...     

Simulation of congestion avoidance and routing in packet switching networks

The development of a flexible computer simulation package for packet switching computer networks that enables the evaluation of different congestion avoidance methods and routing strategies is discussed. The package is presented in terms of the factors involved, the operations required, and the simulation execution considerations. Use of the package for the evaluation of congestion avoidance methods and routing strategies is described. The congestion avoidance methods considered include isarithmic methods with static and dynamic control. In addition, static and dynamic routing strategies are taken into account. The relative differences between the various methods and strategies considered are presented. It has been found that the results obtained agree with previous results, and this confirms the suitability of the package for future investigation. The package would be useful to students and researchers in the field, especially since it uses the widely known computer language Pascal, and is run on an IBM PC(AT).     

语义对等覆盖网中社区结构的发现和评价

最近,通过建立语义覆盖网络来提高大规模分布式网络环境中信息检索服务的性能成为对等计算领域的研究热点.目前,研究者们在语义覆盖协议和搜索算法方面已经做了大量研究,证明了语义覆盖在基于对等网络模型的内容定位应用方面极为有效.然而,分析和评价语义覆盖网络特征的研究工作确非常有限.文中通过建立数学模型和设计启发式回溯-贪婪混合算法、确认了语义覆盖网络的一种主要内在特性——社区结构特性.利用评价模型比较了SemreX语义覆盖网络和Gnutella网络的性能,实验结果显示SemreX覆盖网具有显著的社区结构特征,而Gnutella网络却没有这样的特征.另外,通过分别在两种覆盖网中仿真洪泛协议发现具有显著社区结构特征的覆盖网在内容定位方面效率更高.     

主动网络拥塞控制研究与实现

随着Internet的迅速发展,网络流量急剧增长,网络的拥塞问题日益突出,阐述了拥塞产生的原因,介绍了主动网络的思想和体系结构,着重探讨了主动网络在拥塞控制和网络管理等方面的应用,描述了主动拥塞控制系统中主动节点的内部结构,提出了主动拥塞控制系统的一种实现.实验结果显示,实行主动拥塞控制的网络比实行传统拥塞控制的网络在性能上有了一定程度的提高.     

A novel approach to improving search efficiency in unstructured peer-to-peer networks

The decentralized peer-to-peer (P2P) technique has been widely used to implement scalable file sharing systems. It organizes nodes in a system into a structured or unstructured network. The advantages of the unstructured P2P systems are that they have lower maintenance complexity and can better adapt to node heterogeneity as well as network dynamics. However, the search process in unstructured systems is not as efficient as in structured P2P systems because the same search message may go through a node multiple times. To facilitate the complex search and improve the search efficiency, we propose a novel approach of assigning identifications to nodes in an unstructured system. Our method can prevent a node from receiving duplicate search messages and retain the low maintenance overhead for the system. The performance evaluations demonstrate that the proposed approach can improve the search efficiency of unstructured P2P systems while keeping the maintenance overhead at a comparable or even lower level, compared with the traditional unstructured systems.     

A novel conflict-free parallel memory access scheme for FFT constant geometry architectures

The challenges imposed by environmental issues, such as global warming and the energy crisis, are demanding more responsible energy usage, including in the optical networking field. In optical transmission networks, most of the electrical power is consumed by the optical-electrical-optical conversion in optical repeaters. Modern optical network control plane technologies allow idle optical repeaters to be put into a low-power sleep mode. Inspired by this, we propose a novel power-efficient routing and wavelength assignment (RWA) algorithm, called HTAPE. The HTAPE algorithm exploits the knowledge of the connection holding times to minimize the number of optical repeaters in the active mode, and hence reduce the total electricity consumption of the optical network. We test the new algorithm on the typical CERNET and USNET networks. Compared with traditional RWA algorithms without holding-time-awareness, it is observed that the HTAPE algorithm yields significant reductions in power consumption.     

A novel congestion control in hybrid ATM/TDMA networks

A new congestion control scheme is analyzed for an ATM multiplexer node. This scheme is based on the leaky bucket and virtual leaky bucket techniques, and utilizes the interaction between the ATM and higher layers, in a hybrid asynchronous transfer mode/time division multiple access (ATM/TDMA) network. The transport users are assumed to be generic ATM sources, who modulate their end-to-end flow control parameters, i.e. protocol data unit size in case of video and voice users, and window size in case of data users, based on the congestion status. Simple analytical formulas are derived for congestion criteria, to represent the required bandwidth to support various classes of service, i.e. video, voice, data, etc. with their own performance requirements. An ATM multiplexer node buffer is analyzed using a modulated poisson process queuing model with bulk arrival and bulk service of cells. The ATM multiplexer node congestion performance criteria, i.e. the mean probabilities of ATM multiplexer node congestion, cell generation, cell discarding, buffer content and buffer overflow, are evaluated with and without the congestion control schemes.     

无线传感器网络节能转发策略的改进与实现

基于电池供电的传感器网络的节点电源无法替换,导致能量消耗问题直接影响网络的生命周期,所以节省能源成为关键问题.由于节点沿某路径到达接收点的基于跳数的转发在交付率和节能方面是低效的,尤其在高损耗环境中,因此针对这个问题,根据有损链路模型,对通过折中交付率和能源代价来最大化能源效率的单链和多链的节能转发方法进行了研究.通过数学分析、仿真和实验评价,将该方法和其它的转发策略进行了比较,发现节能转发方案有效节约了能源.     

Efficient and Adaptive Threshold Signatures for Ad hoc networks

In this paper, we propose a secure, flexible, robust and fully distributed signature service, for ad hoc groups. In order to provide the service, we use a new threshold scheme, that allows to share a secret key among the current group members. The novelty of the scheme is in that it easily and efficiently enables dynamic increase of the threshold, according to the needs of the group, so that the service provides both adaptiveness to the level of threat the ad hoc group is subject to, and availability. We prove the correctness of the protocol and evaluate its efficiency. The changes to the threshold are performed by using a protocol that is efficient in terms of interactions among nodes and per-node required resources, resulting suitable even for resource-constrained settings. Finally, the same proposed scheme allows to detect nodes that attempt to disrupt the service, providing invalid contributions to the distributed signature service.     

基于标识的无线传感器网络密钥预分配方案

密钥分配是无线传感器网络中极具挑战性的安全问题之一.为了实现无线传感器网络中的安全通讯,需要对传感器结点间传递的信息进行加密.由于受每个传感器结点自身资源的限制,传统网络中使用的密钥分配策略,并不适用于无线传感器网络.提出了基于结点ID的密钥预分配方案,实现了非对称和对称密钥体制、分布式和集中式密钥管理的结合,有效地提高了传感器网络其安全性和连通性.     

A novel threshold-based quadrature signaling scheme for cooperative networks

Presented is a novel threshold-based quadrature signaling(TQS)scheme for cooperative networks.By assigning different components of the quadrature signaling to different cooperative users and letting each user node decide whether to relay information for the other in the assigned component based on a threshold or not,independently,the TQS scheme effectively integrated the advantages of both quadrature signaling and threshold techniques.The authors investigate the end-to-end bit error rate(BER)performance and obtain its closed-form expression.According to our theoretical analysis,the TQS scheme can enhance the diversity gain of a cooperative system and,meanwhile,reduce the complexity of its implementation to a great extent.In addition,the communication system,using TQS scheme,has the feature of easily switching between cooperative and non-cooperative patterns.Finally,the numerical and simulation results show that the scheme has excellent performance as expected.     

A novel re-authentication scheme based on tickets in wireless local area networks

Fast re-authentication schemes during handover of a mobile station are essential to seamless services for real-time multimedia applications in wireless local area networks. Although much research has been done to reduce re-authentication latency, the schemes developed so far either suffer from heavy burden problems or degrade the security level. In this paper, a novel ticket-based approach is proposed for re-authentication during handover. The mobile station receives handover tickets from the authentication server as a proof of authorization, and it presents the corresponding ticket when associating with a new access point. Our scheme reduces re-authentication delay to the delay of 2-way handshake between a mobile station and an access point. Furthermore, this scheme imposes less burden over the entities compared with other proactive key pre-distribution schemes, while satisfying 802.11i security requirements.     

A novel radio resource allocation scheme for IEEE 802.16e multicell networks

In this paper,we propose a new media access control (MAC) protocol,which is compatible with the IEEE 802.16e-2005 Orthogonal Frequency Division Multiple Access (OFDMA) wireless interface.In this protocol,the same radio resource can be shared by neighboring cells in the wireless mesh network (WMN) and collisions can be reduced in the overlapping areas.This protocol consists of two schemes: a downlink transmission and an uplink transmission.For downlink transmission we use a cross layer adaptive radio resourc...     

A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

The problem of Minimum Congestion Hypergraph Embedding in a Weighted Cycle (MCHEWC) is to embed the hyperedges of a hypergraph as paths in a weighted cycle such that the maximum congestion is minimized. This problem is NP-hard. In this paper, we present a polynomial time approximation scheme (PTAS) for this problem.     

A top-down positioning scheme for underwater wireless sensor networks

In order to increase the localization coverage while keeping the localization error small in a unique network architecture in which there are not evenly distributed anchor nodes with great ability of communication or additional infrastructure,a Top-down Positioning Scheme(TPS)for underwater acoustic sensor networks is proposed.By defining node’s confidence reasonably,TPS insures the quality of the new reference nodes.TPS also refines the nodes which have just been positioned via the gradient method and helps non-localized nodes search for more reference nodes via the new scheme for 3D Euclidean distance estimation.By comparing the new scheme for 3D Euclidean distance estimation with the existing scheme,the new scheme is shown to have greater ability to estimate two-hop Euclidean distance in 3D space.Simulation results show that TPS which integrates node’s confidence defined reasonably,the gradient method,and the new scheme for 3D Euclidean distance estimation can increase the localization coverage ratio,while keeping the localization error small.