The 11th IEEE International Conference on Networks, 2003. ICON2003.最新文献

{"title":"Dynamic initialization protocols for mobile ad hoc networks","authors":"J. Myoupo","doi":"10.1109/ICON.2003.1266182","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266182","url":null,"abstract":"The construction of interconnection wired networks (or wireless networks) from smaller components often leaves the fundamental problem of assigning address to stations. In general, the address of a station for algorithms in wired or wireless networks is either permanently stored in its local memory or is received at start-up time from a master station. In another words it is assumed that initially each station knows its address. This assumption is not always appropriate in some situations: according to the topology we want to use in the transputer reconfigurable network, the addresses of the transputers may be different. The problem of assigning addresses to stations is somehow fundamental and it is called the initialization problem. The mobile ad hoc wireless network is a dynamical system in which some channels or stations can be removed and new channels or stations can be added during the life of the system. The capability of whole system to handle these changes is crucial. The initialization of the mobile ad hoc network of n stations must then be dynamic by handling all these changes in particular the variation of the number of stations in time. In most applications in wireless networks, it is often supposed that the stations are partitioned into equal groups and that a channel is assigned to each group. But it is never shown how this partition is initially done. This paper addresses all these points and shows how a self organization of the mobile ad hoc system can be carried out dynamically.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133823845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-space distributed hash tables for multiple transport domains","authors":"A. Harwood, M. Truong","doi":"10.1109/ICON.2003.1266204","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266204","url":null,"abstract":"The use of consistent hashing to construct a distributed hash table (DHT) has recently gained significant interest from the distributed computing community, particularly because algorithms have been devised which implement a DHT using peer-to-peer (P2P) technology. However a common assumption is that every node that participates in the DHT is within the same transport domain. Some solutions make to this problem make use of an intermediate overlay network which itself can become messy. Other solutions rely on the widespread use of IPv6 or \"work-arounds\" for the limited IPv4. We propose a solution that uses a multi-space DHT algorithm to manifest a DHT space in each transport domain, with bridge nodes linking DHT spaces between transport domains. The ostensive problem with this solution is to ensure that key requests are evenly distributed over all spaces. We provide a framework to solve this problem and give an example solution for a simple 2-space DHT network.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134184610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Effective bandwidth shaping: a framework for resource dimensioning","authors":"Dirk Abendroth, U. Killat","doi":"10.1109/ICON.2003.1266217","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266217","url":null,"abstract":"Effective bandwidths is a statistical descriptor in the context of stochastic models for statistical sharing of resources. It is generally known [C.-S Chang and J.A. Thomas, August 1995] that effective bandwidths assigned to independent flows being multiplexed behave additively. Furthermore it has been shown [D. Wischik, 1999] that under the many sources limiting regime, an effective bandwidth assigned to a flow passing through a switch is not changed, and inductively a flow has the same effective bandwidth through the entire network. If all flows feeding a network under consideration have well defined effective bandwidths and QoS demands, resource dimensioning can be done based on simple large deviation principles. We address the problem of specifying and limiting effective bandwidths of arriving flows by introducing a new shaping and policing algorithm based on an on-line effective bandwidth estimator. The presented algorithm's functionality is verified by both synthetic and real data traces. Finally the performance of proposed algorithm variants is discussed.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127459060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A local optimum selection criterion for the physical neighbor connectivity of ad hoc networks","authors":"M. Borschbach, W. Lippe","doi":"10.1109/ICON.2003.1266183","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266183","url":null,"abstract":"According to the common underlying mathematical model of ad hoc networks introduced elsewhere, a selective network model is defined to analyze local node connectivity. Based on a system architecture with a predetermined number of independent and simultaneous links of each network node, the different optimization degrees of the selection of neighbors are presented. A higher relaying efficiency gives the main opportunity for an ad hoc net to be an essential part of a future networking system. The efficiency of a selective network connectivity is compared to pure range controlled connectivity.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115346168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel distributed resource-aware scalable scheme for Scatternet formation","authors":"Sagar Dharia, D. Agrawal","doi":"10.1109/ICON.2003.1266266","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266266","url":null,"abstract":"Bluetooth is a low-power, low-cost, short-range wireless communication system. In a Bluetooth ad hoc network, up to eight Bluetooth devices can communicate with each other in a special network called piconet. Scatternet can be formed by interconnecting piconets. In this paper, we present a distributed resonrce aware scalable scatternet formation algorithm. Though the proposed algorithm has two phases, it is not necessary that all the nodes be in the same phase at a given instant of time. The formed scatternet has the following properties: 1. All the devices may not be necessarily in each other’s transmission range. 2. Any device will be a member of at the most two piconets. 3. Higher resource-weighted devices are preferred over lower resourceweighted devices to perform the role of a master and/or a bridge. 4. Slave/Slave bridges are preferred over MastedSlave bridges. Extensive simulations have shown that the number of messages transmitted by low resource-weighted devices are significantly lesser than the number of messages exchanged by high resourceweighted devices, and the number of masredslave bridges are remarkably less as compared to the number of slave/slave bridges. The overall message complexity ofthe algorithm is O W","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient implementation of relative differentiated services using proportional probabilistic priority","authors":"C. Tan, C. Tham","doi":"10.1109/ICON.2003.1266243","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266243","url":null,"abstract":"This paper studies the design and performance of the Probabilistic Priority (PP) [5] packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP turns out to be a special scheme of applying lottery scheduling [10] to bandwidth allocation in a strict priority sense. We then propose a Multiwinner PP (MPP) scheduler using multi-winner lottery scheduling to improve the throughput and response time accuracy and a flexible ticket transfer algorithm to improve the deadline violation probability in probabilistic scheduling. Finally, we investigate the issue of parameter assignment for an MPP scheduler and use our techniques to implement a prototype Assured Forwarding (AF) mechanism.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129636057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Resource aware information dissemination in ad hoc networks","authors":"J. Lipman, P. Boustead, J. Chicharo, J. Judge","doi":"10.1109/ICON.2003.1266255","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266255","url":null,"abstract":"Information dissemination (flooding) forms an integral part of routing protocols, network management, service discovery and information collection (sensing). Given the broadcast nature of ad hoc network communications, information dissemination provides a challenging problem. This paper introduces Utility Based Flooding (UBF). UBF is a distributed optimised flooding mechanism for ad hoc networks that unlike existing optimised flooding algorithms is fully resource aware. Resource awareness is achieved by assigning a forwarding utility to neighouring nodes to determining the desirability of a neighbouring node in continuing a flood. UBF is particularly applicable to ad hoc network environments composed of heterogeneous nodes that may have varying characteristics and constraints. In this paper, UBF is compared to existing flooding mechanism in a constrained environment. Nodes are assigned varying degrees of remaining battery power and user based constraints that limit a nodes benevolence based upon its remaining battery power. We show through simulation that UBF compared to Utility Based Multipoint Relay (UMPR) flooding, Multipoint Relay (MPR) flooding and Blind flooding significantly improves broadcast reachability over successive broadcasts, does not adversely affect performance and extends the lifetime of the network. UBF delivers packets to over 90% of nodes in the network for over 70 successive broadcasts. Blind flooding, UMPR and MPR are only able achieve 42, 39 and 23 successive broadcasts respectively. Disciplines Physical Sciences and Mathematics Publication Details This article was originally published as: Lipman, J, Boustead, P, Chicharo, J & Judge, J, Resource aware information dissemination in ad hoc networks, The 11th IEEE International Conference on Networks (ICON2003), 28 September-1 October 2003, 591-596. Copyright IEEE 2003. This conference paper is available at Research Online: http://ro.uow.edu.au/infopapers/194 Resource Aware Information Dissemination in Ad hoc Networks Justin Lipman and Paul Boustead and Joe Chicharo Telecommunications and Information Technology Research Institute University of Wollongong Email: {justin,paul,joexhicharo}@titr.uow.edu.au John Judge Motorola Australian Research Centre 12 Lord Street, Botany, NSW, Australia Wollongong Australia Email john.judge@motorola.com AbsPacIInformation dissemination (flooding) forms an in tegral part of routing protocols, network management, semce discovery and information collection (sensing). Given the broad cast nature of ad hoc network communications, information dissemination provides a challenging problem. This paper in trodnces Utility Based Flooding (UBF). UBF is a distributed optimised flooding mechanism for ad hoc networks that unlike existing optimised flooding algorithms is fnUy resource aware. Resource awareness is achieved by assigning a forwarding utility to neighouring nodes to determining the desirability of a neigh honring node in continuing a flood. UBF i","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126179223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the performance of computer networks with advance reservation mechanisms","authors":"Lars-Olof Burchard","doi":"10.1109/ICON.2003.1266232","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266232","url":null,"abstract":"In contrast tu immediate reservations, advance reservations allow to reserve network bandwidth long before it is actnally required. Hence, advance reservations are an opportunity tu provide enhanced functionality in a computer network allowing to define new services, such as guaranteeing that a certain deadline for a transmission over the network can be met. Such functionality is required e.g. in the field of grid computing where also mmputing resources have to be allocated in advance. The impact of such advance reservation mechanisms on the performance of the network with respect to the amount of admitted requests and the allocated bandwidth has so far nut been examined in detail. In this paper, we show that advance reservations can lead to a reduced performance of the network with respect tu both metrics. The analysis of the reasons shows a fragmentation of the network resources resulting in decreased performance. In advance reservation environments, additional new services can he defined such as malleable reservations which are mtmduced in this paper and can lead to an increased performance of the network. In order tu deal with this new reservation type, four scheduling strategies are presented and compared. The results of the comparisons show that some strategies increase the resonrce fragmentation and are therefore unsuitable in the considered environment while others lead to a significantly better performance of the network","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127913812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A performance comparison of zone-based multicast protocols for mobile ad hoc networks","authors":"Y. Zhang, Aniruddha Rangnekar, A. Selçuk, Ali Biçak, D. Sidhu","doi":"10.1109/ICON.2003.1266247","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266247","url":null,"abstract":"With the current trend toward ubiquitous computing come wireless devices capable of forming the nodes of mobile ad hoc networks. Such networks typically rely on routing protocols in order to communicate messages from a source node to a destination node through a set of interme diary nodes. In a typical ad hoc environment, mobile nodes mostly work as a group and are involved in collaborative computing. Multicast communication is more effective in these scenarios. This paper presents the comparison of the performance of two zonehased multicast routing protocols. Shared-tree MZR is a shared tree variant of the Multicast Routing Pmtoeol based on Zone Routing (MZR). We compare the two variants and analyze their performance under various network conditions. The test results show that Shared-tree MZR protocol performs well and has significantly low overhead in scenarios with multiple sources. Inder Terms-Ad hoe networks, routing protocols, multicaet routing, zone routing.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124702801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the topology of overlay-networks","authors":"T. Fuhrmann","doi":"10.1109/ICON.2003.1266202","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266202","url":null,"abstract":"Random-graph models are about to become an important tool in the study of wireless ad-hoc and sensor-networks, peer-to-peer networks, and, generally, overlay-networks. Such models provide a theoretical basis to assess the capabilities of certain networks, and guide the design of new protocols. Especially the recently proposed models for so-called small-world networks receive much attention from the networking community. This paper proposes the use of two more mathematical concepts for the analysis of network topologies, dimension and curvature. These concepts can intuitively be applied to, e.g., sensor-networks. But they can also be sensibly defined for certain other random-graph models. The latter is non-trivial since such models may describe purely virtual networks that do not inherit properties from an underlying physical world. Analysis of a random-graph model for Gnutella-like overlay-networks yields strong indications that such networks might be characterized as a sphere with fractal dimension.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"780 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128355896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}