Address Allocation Research Articles

Simulation and analytical approaches for estimating the performability of a multicast address dynamic allocation mechanism

The specification of the Multicast Address Dynamic Client Allocation Protocol (MADCAP) includes a mechanism to assign multicast addresses to the hosts in the Internet environment. MADCAP servers provide multicast address allocation services. A MADCAP client (that is, a host requesting multicast address allocation services via MADCAP) identifies a suitable MADCAP server and sends appropriate messages to the MADCAP server in order to request a multicast address. The mechanism makes the reuse of multicast addresses available with the MADCAP server, through the application of the lease-time concept. Estimating the performance measures of such a system, accurately and reliably, is very important for efficient use of resources and for achieving the QoS (Quality of Service) requirements. This paper proposes two approaches to estimate performability measures of the MADCAP dynamic allocation mechanism. They are essentially, an accurate one by simulation and a fast but approximate one by analytical solution. While the accuracy of the simulation method is limited by the length of the simulation, the analytical method is an approximate one but fast in computation. The detailed simulation model and the analytical method of the MADCAP dynamic allocation mechanism are presented, and the results are compared. Fairly good agreement is established between the simulation and the analytical results, giving rise to accurate and dependable computation of the performability measures. A solution approach using the QBD model for the performability analysis of the MADCAP mechanism is proposed, which has the computational complexity of the order O ( c ) . Besides possessing the capability of tackling the problem with large c (the number of available IP multicast addresses is of the order of tens of thousands in the MADCAP server) in a very short time, it also gives numerically stable solution. The impact of the lease-time parameter on the performability of the MADCAP dynamic allocation mechanism is also investigated through a numerical study, and illustrated by graphs.

A secure coverage area expansion scheme for public wireless LAN services

An ad-hoc network style connection can be utilised to expand the coverage area of public wireless LAN (WLAN) services. By relaying the messages among user nodes, a node can obtain an internet connection, even though the node is located outside the AP's direct wireless communication area. This concept has been realised by using the ad-hoc on-demand distance vector (AODV) routing protocol and mobile IP. However, it has some drawbacks in terms of security. The AODV has no functions for confirming the validity of routing messages; therefore, there are many threats due to faked or forged routing messages. In contrast, if a secure ad-hoc routing protocol is used for message routing in the WLAN service, the message route can be appropriately maintained. However, in order to employ secure ad-hoc routing protocols, a key and IP address have to be securely delivered to each WLAN node in advance. For this purpose, in this paper, the authors propose a secure address and public key certificate allocation scheme for WLAN services.

Content-Based Bi-Directional Shared Multicast Routing Protocol

PDF HTML阅读 XML下载 导出引用 引用提醒 一种基于内容的双向共享组播路由协议 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant Nos.60473113, 60533080,60773049 (国家自然科学 基金) Content-Based Bi-Directional Shared Multicast Routing Protocol Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:针对组播协议在大规模分布式交互系统应用中面临的可扩展性问题,提出一种基于内容的双向共享组播路由协议CBSMRP(content-based bi-directional shared multicast routing protocol).该协议结合运用了主动路由思想和基于内容的发布-订购模式,在基于CBT(core-based tree)结构的双向共享组播树中,根据数据包的内容实现主动路由和双向过滤,不仅解决了组播地址的维护和分配等问题,而且能够有效地减轻系统的网络负载.仿真实验及实际应用表明,该协议具有较好的扩展性,能够满足大规模分布式交互系统的网络通信要求. Abstract:In order to improve the scalability of multicast protocol in large-scale distributed interactive systems, a content-based bi-directional shared multicast routing protocol is presented, which is called CBSMRP (content-based bi-directional shared multicast routing protocol). Combined with active routing methods and content-based publish/subscribe pattern, this new protocol supports active routing and bi-directional filtering according to the content of packages in a bi-directional shared multicast tree based on CBT (core-based tree) structure, which cannot only solve the problems in the allocation and maintenance of multicast addresses, but also efficiently reduce the network load. Experimental results and application show that the protocol is scalable enough to meet network communication requirements of large-scale distributed interactive systems. 参考文献 相似文献 引证文献

Distributed address auto configuration protocol for Manet networks

Mobile ad hoc networks are wireless networks characterized by: limited bandwidth, shared transmission channel and the lack of central processing unit of administration and configuration. Most research related to Manet assures that host IP address is configured as the node joins the network. However, it is impossible to ensure that because there is no infrastructure. Therefore, an auto configuration scheme is needed to perform network management and to attribute connection parameters. Hence, we present a new distributed IP address configuration approach for Manet networks. Our solution provides a unique address allocation for each node in the network. The address assignment is assured under different network conditions including node failures, network partitioning and merging.

Evaluating Geographic Imputation Approaches for Zip Code Level Data: An Application to a Study of Pediatric Diabetes

ISEE-0287 Background and Objective: There is increasing interest in the study of place effects on health, facilitated in part by geographic information systems. Incomplete or missing address information reduces geocoding success. Several geographic imputation methods have been suggested to overcome this limitation. Accuracy evaluation of these methods can be focused at the level of individuals, and at higher group-levels (e.g., spatial distribution). Methods: We evaluated four geo-imputation methods for address allocation from ZIP codes to Census tracts at the individual and group level. Two fixed (deterministic) and two random allocation methods were evaluated, using land area or population under age 20 as weighting factors. Data included 2,126 geocoded cases of incident diabetes mellitus among youth aged 0-19 between 2002 and 2003 in four U.S. regions. The imputed distribution of cases across tracts was compared to the true distribution using a chi-squared statistic. Results: At the individual level, population-weighted fixed allocation showed the greatest level of accuracy, with correct census tract assignments averaged 30.45% across all regions, followed by the populated-weighted random method; 21.07%. Distribution of cases across Census tracts was: 58.2% of tracts exhibited no cases, 26.2% had one case, 9.5% had two cases, and less than 3% had three or more. True distribution was best captured by random allocation methods, with no significant differences (P-value > 0.90). However, significant differences in distributions based on fixed allocation methods were found (P-value < 0.0003). Conclusion: Results indicate fixed imputation methods yield greatest accuracy at the individual level, thus indicating their use for studies focusing on distances to exposure sites. Fixed methods result in artificial clusters in single Census tracts. For studies focusing on spatial distribution of disease, random methods seemed superior, as they most closely replicated the true spatial distribution. When selecting an imputation approach, researchers should consider carefully the study aims.

Evaluating geographic imputation approaches for zip code level data: an application to a study of pediatric diabetes.

BackgroundThere is increasing interest in the study of place effects on health, facilitated in part by geographic information systems. Incomplete or missing address information reduces geocoding success. Several geographic imputation methods have been suggested to overcome this limitation. Accuracy evaluation of these methods can be focused at the level of individuals and at higher group-levels (e.g., spatial distribution).MethodsWe evaluated the accuracy of eight geo-imputation methods for address allocation from ZIP codes to census tracts at the individual and group level. The spatial apportioning approaches underlying the imputation methods included four fixed (deterministic) and four random (stochastic) allocation methods using land area, total population, population under age 20, and race/ethnicity as weighting factors. Data included more than 2,000 geocoded cases of diabetes mellitus among youth aged 0-19 in four U.S. regions. The imputed distribution of cases across tracts was compared to the true distribution using a chi-squared statistic.ResultsAt the individual level, population-weighted (total or under age 20) fixed allocation showed the greatest level of accuracy, with correct census tract assignments averaging 30.01% across all regions, followed by the race/ethnicity-weighted random method (23.83%). The true distribution of cases across census tracts was that 58.2% of tracts exhibited no cases, 26.2% had one case, 9.5% had two cases, and less than 3% had three or more. This distribution was best captured by random allocation methods, with no significant differences (p-value > 0.90). However, significant differences in distributions based on fixed allocation methods were found (p-value < 0.0003).ConclusionFixed imputation methods seemed to yield greatest accuracy at the individual level, suggesting use for studies on area-level environmental exposures. Fixed methods result in artificial clusters in single census tracts. For studies focusing on spatial distribution of disease, random methods seemed superior, as they most closely replicated the true spatial distribution. When selecting an imputation approach, researchers should consider carefully the study aims.

Hierarchical Numbering Based Addressing and Stateless Routing Scheme for Wireless Sensor Networks

Due to energy and other relevant constraints, addressing of nodes and data routing techniques in sensor networks differ significantly from other networks. In this article, we present an energy-efficient addressing and stateless routing paradigm for wireless sensor networks. We propose a dynamic and globally unique address allocation scheme for sensors in such a way that these addresses can later be used for data routing. We build a tree like organization of sensors rooted by the sink node based on their transmission adjacency and then set labels on each sensor with a number according to the preorder traversal of the tree from the root. In this addressing process, each sensor keeps necessary information so that they can later route data packets to the destination depending on these addresses, without keeping the large routing table and running any no route discovery phase. Moreover, the scheme does not use location information as well (as done by geo-routing) and can be used in the indoor environment. We conduct simulations to measure the soundness of our approach and make a comparison with another similar technique TreeCast. Simulation results reveal that our approach performs better than its counterpart in several important performance metrics like address length and communication energy.

Security in next generation wireless networks

In the past decades, the evolution of wireless technologies has brought significant changes in modern communication networks through its wireless extension of wired networks. Wireless communications offer organizations and users many benefits such as portability and flexibility, increased productivity, and lower installation costs. However, risks are inherent in any wireless network. As the technologies of next generation wireless networks are emerging, security has become a primary concern in order to provide dependable and secure communication between the wireless nodes in a hostile environment. The next generation wireless networks face many unique challenges in security such as open network architecture, shared wireless medium, limited resource constraints, and highly dynamic network topology. This special issue in Security and Communication Networks presents current research focusing on the standard or protocol related security, attacks and defense applications, security architecture and frameworks, and theories and methodologies in security in next generation wireless networks. In view of this, we selected eight papers on security in next generation wireless networks to this special issue. The papers are either selected from open submissions or the best paper in 2008 International Workshop on Network and System Security (NSS 2008), held on 18–19 October 2008, in Shanghai, China. All the papers were selected on the basis of their originality, technical quality, and significance. Each paper was under rigorous technical review by at least three international reviewers. The selected papers are summarized below. Routing security contexts via an IP network imposes new challenging requirements of secure crosshandover services and security context management. In the first paper, Kim and Shin present a context router that manages security contexts in an all-IP network, providing seamless and secure handover services for the mobile users that carry multimediaaccess devices. The proposed predictive routing mechanism improves seamless and secure cross-handover services. Trust establishment and management are essential for any security framework of MANETs. In the second paper, Dahshan and Irvine propose a robust self-organized, public key management for MANETs. The proposed scheme relies on establishing a small number of trust relations between neighboring nodes during the network initialization phase. Simulation results show that the proposed scheme is robust and efficient in the mobility environment of MANET and against malicious node attacks. A mobile node in a MANET must be assigned a free IP address before it may participate in unicast communications. This is a fundamental and difficult problem in the practical application of any MANET. In the third paper, Zhou, Mutka, and Ni propose a secure autoconfiguration algorithm, namely secure prophet address allocation, to perform prophet address allocation while considering the requirements of communication overhead, latency, and scalability. It is demonstrated that the proposed approach is able to maintain uniqueness of address assignment in the presence of IP spoofing attacks, ‘state pollution’ attacks, and Sybil attacks. In the fourth paper, Babu and Venkataram present a security techniques selection scheme for mobile transactions, called the Transactions-Based Security Scheme (TBSS). The TBSS identifies a suitable level

SubCast: A distributed addressing and routing system for large scale wireless sensor and actor networks

Wireless sensor and actor networks (WSANs) are made up of a large number of sensing devices which are resource-impoverished nodes and powerful actuation devices: both are equipped with computation and communication capabilities. These devices cooperate to manage sensing and perform acting tasks. Numerous work conducted in the field of WSANs assumes the existence of addresses and routing infrastructure to validate their proposals. However, assigning addresses and delivering detected events in these networks remains highly challenging, specifically due to the sheer number of nodes. To address these issues, this paper proposes SubCast, a novel distributed address assignment and routing scheme based on a topic clustering system and fractal theory iterated function systems . In order to minimize data delivery costs among actors, the proposed architecture first builds an actor overlay network before allocating addresses to network nodes. Location information in the allocated addresses allows establishing data delivery paths. Simulation results confirm that the proposed system efficiently guarantees the allocation of unique addresses and performs efficient data delivery while reducing communication costs, delays as well as the impact of imprecise locations.

Secure prophet address allocation for MANETs

AbstractA mobile node in a MANET must be assigned a free IP address before it may participate in unicast communications. This is a fundamental and difficult problem in the practical application of any MANET. There have been several solutions proposed, among which prophet address allocation outperforms others in terms of communication overhead, latency, and scalability. However, none of the approaches can survive attacks in an insecure environment. Although there are a few secure autoconfiguration schemes proposed, they all have some disadvantages. Based on studies of insecure scenarios, attack schemes, and our previous work, a secure autoconfiguration algorithm, namely secure prophet address allocation, is proposed in the paper. The proposed approach is able to maintain uniqueness of address assignment in the presence of IP spoofing attacks, [state pollution] attacks, and Sybil attacks. The invulnerability of the scheme is supported by both theoretical analysis and simulation results. Copyright © 2009 John Wiley &amp; Sons, Ltd.

An Approach to Improve the State Scalability of Source Specific Multicast

Problem statement: Source Specific Multicast (SSM) is an acceptable solution for current multicast applications; since the driving applications to date are one to many, including Internet TV, distance learning, file distribution and streaming media. Approach: It was useful for billing, address allocation and security. SSM still had serious state scalability problem when there were a large number of simultaneous on-going multicast groups in the network. Results: In this study, a scheme had been devised to improve the state scalability of source specific multicast. The scheme consisted of two stages: Conclusion/Recommendations: The first stage was to cluster the receivers based on their IP addresses and the second stage was to reduce the multicast state at routers. In order to prove the correctness of the proposed scheme, it had been applied to multicast trees built by other researchers. The results of the comparison approved our statement.

Establishing Multiple Paths for Multihoming on SCTP in MANET

In this letter, we propose new modifications of current routing protocol to fully utilize the multihoming functionality of SCTP over MANET. To achieve this, multiple address allocation and disjoint path setup schemes in a reactive routing protocol are developed under a cross-layer concept. We demonstrate that two newly added features contribute to higher SCTP throughput than original one.

Modeling and Performance Analysis of Address Allocation Schemes for MobileAd HocNetworks

Address allocation is an essential part in maintaining a mobile ad hoc network (MANET) effectively, and several address allocation schemes have been proposed. In this paper, we present a set of analytical models to evaluate the efficiency of address allocation schemes. The derived models quantitatively characterize the efficiency of four popular address allocation schemes in terms of latency and communication overhead. Through the analysis, we achieve numerical results that show the impact of network parameters on the efficiency of these schemes. We also conduct simulations and compare with analytical results to validate our models. The analytical model developed in this paper is able to more accurately predict the performance of address allocation schemes over a various range of loss rates and would be useful in providing more insights for the study of an efficient address allocation scheme in MANETs. To our understanding, this is the first attempt in mathematically investigating the performance of addressing schemes in ad hoc networks.

DART: Dynamic Address RouTing for Scalable Ad Hoc and Mesh Networks

It is well known that the current ad hoc protocol suites do not scale to work efficiently in networks of more than a few hundred nodes. Most current ad hoc routing architectures use flat static addressing and thus, need to keep track of each node individually, creating a massive overhead problem as the network grows. Could dynamic addressing alleviate this problem? In this paper, we argue that the use of dynamic addressing can enable scalable routing in ad hoc networks. We provide an initial design of a routing layer based on dynamic addressing, and evaluate its performance. Each node has a unique permanent identifier and a transient routing address, which indicates its location in the network at any given time. The main challenge is dynamic address allocation in the face of node mobility. We propose mechanisms to implement dynamic addressing efficiently. Our initial evaluation suggests that dynamic addressing is a promising approach for achieving scalable routing in large ad hoc and mesh networks

Dynamic address allocation for self-organised management and control in sensor networks

Several data-centric communication paradigms have been proposed in the domain of Wireless Sensor Networks (WSN). Therefore, the principles of operation and maintenance in such networks are changing to control massively distributed systems. Previous addressing schemes fail or produce too much overhead if only locally unique addresses of sensor nodes are required. In this paper, we present a dynamic address allocation scheme for localised address assignments in WSN. We developed a round-based address assignment with subsequent duplicate address detection that operates in a self-organised manner. It inherently allows busy-sleep periods and does not assume always awake nodes. To verify the approach, we implemented the algorithm on Mica2 sensor motes and tested it in a WSN maintenance scenario. The results demonstrate that our method works well for operation and maintenance of WSN without prior address assignments.

Advances in IP Micromobility Management Using a Mobility-Aware Routing Protocol

Several micromobility schemes have been proposed to augment Mobile IP and provide a faster and smoother handoff than what is achievable by Mobile IP alone, the majority of which can be categorized into either “network prefix-based” or “host-specific forwarding” mobility management protocols, depending on the routing method used. This letter proposes a mobility-aware routing protocol (MARP) which makes use of both of these routing methods using dynamic IP address allocation. Its performance is evaluated and compared against hierarchical Mobile IP (HMIP) and Cellular IP based on handoff performance, end-to-end delivery delay, and scalability. The results demonstrate that MARP is a more robust, flexible, and scalable micromobility protocol, minimizes session disruption, and offers improvements in handoff performance.

IP addressing: the next frontier of internet governance debate

PurposeThe purpose of this article is to broaden our understanding of internet governance policy options by reviewing and assessing proposals for reforming the institutional mechanisms used to allocate and assign IPv6 addresses.Design/methodology/approachThe paper begins by identifying the two main economic and technical constraints on IP addressing: route aggregation and address conservation. It then reviews the reform proposals that have been made and assesses the debates that have occurred around those proposals, bearing in mind the key issues of aggregation and conservation. In particular, it attempts to explore whether competition in IP addressing between authorities with diverse policies would be feasible and beneficial.FindingsThe debate over addressing policy is in its early stages and has a long way to go. A review of the debate so far suggests that the introduction of economic incentives in addressing might improve route aggregation rather than worsen it. With respect to conservation and aggregation incentives, policy diversity might help internet service providers find a more optimal trade‐off between the needs of users and the needs of the suppliers of connectivity.Originality/valueThe policy alternatives discussed here could have a major impact on the future of the internet, as address allocation and assignment directly affect the way the internet functions and the distribution of costs and benefits between users and suppliers.

Authenticated Dynamic Group Key Agreement for Autoconfigurable Mobile Ad Hoc Networks

Secure communication in Mobile Ad Hoc Networks (MANETs) is important as nodes communicate over the wireless medium, which can be easily eavesdropped. Currently, the literature of secure IP address autoconfiguration in MANETs is extremely rare. In this paper, we propose five protocols that provide both secure IP address autoconfiguration and authenticated group key agreement (GKA) to give a more efficient and secure solution for MANET communications. Whenever a dynamic group membership event such as node join, node leave, network merge and network partition occurs, our protocols ensure that the IP address allocation table and group key are updated so that there are no address conflicts and leaving and joining users cannot decrypt future and previous communications respectively. A complexity analysis shows that despite having additional capabilities such as IP address autoconfiguration and key authentication, our protocols are still efficient when compared to other GKA protocols.

Improving the multicast state scalability in internet routers by integrating hash algorithm with recursive unicast

In this article, a new protocol called REHASH has been devised that gracefully integrates the idea of recursive unicast with hash algorithm to achieve scalable multicast for improved performance. In this model, data packets have unicast destination addresses. Therefore, REHASH supports pure unicast routers transparently. The key idea of the proposed protocol is to simplify address allocation and implements multicast distribution using recursive unicast hash trees. The branching nodes recursively create packet copies to implement the distribution. REHASH adopts the source-specific channel abstraction to tackle the address allocation and the sender access control problems. Consequently, it provides best routes and is suitable for including QoS and authentication parameters inside hash tree construction algorithm. Additionally, REHASH tree management provides enhanced tree stability in the presence of group dynamics.

Incremental service deployment using the hop-by-hop multicast routing protocol

IP multicast is facing a slow take-off although it has been a hotly debated topic for more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper presents HBH (hop-by-hop multicast routing protocol). HBH adopts the source-specific channel abstraction to simplify address allocation and implements data distribution using recursive unicast trees, which allow the transparent support of unicast-only routers. An important original feature of HBH is its tree construction algorithm that takes into account the unicast routing asymmetries. Since most multicast routing protocols rely on the unicast infrastructure, the unicast asymmetries impact the structure of the multicast trees. We show through simulation that HBH outperforms other multicast routing protocols in terms of the delay experienced by the receivers and the bandwidth consumption of the multicast trees. Additionally, we show that HBH can be incrementally deployed and that with a small fraction of HBH-enabled routers in the network HBH outperforms application-layer multicast.