{"title":"PEMS a DiffServ Aware MPLS Traffic Engineering Model for the Networks of ISP","authors":"A. Toguyéni","doi":"10.1109/ICN.2009.79","DOIUrl":"https://doi.org/10.1109/ICN.2009.79","url":null,"abstract":"This article proposes a new model to ensure for each application a better quality of service (QoS). The proposed model is called PEriodic Multi-Step Routing model or PEMS. It is built by integration of traffic engineering based on MPLS and differentiation of traffic depending on the class as proposed by Diffserv. Indeed, many models for optimizing QoS routing use a single specific metric because mixing multiple metric in a cost function is NP-complete. Consequently, the idea here is to propose a model that treats each flow according to its needs. In this study we compare PEMS with LBWDP through simulations based on the simulator MNS. We show that if PEMS differentiates the flows, it does not have best performance than LBWDP in a network that is not overloaded.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129422278","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":"jSon: Network of Active Elements with Peer-to-Peer Control Plane","authors":"M. Procházka, P. Holub, E. Hladká","doi":"10.1109/ICN.2009.74","DOIUrl":"https://doi.org/10.1109/ICN.2009.74","url":null,"abstract":"In this paper, we describe and evaluate a scalable network of Active Elements (AE) that implements userempowered virtual-multicast overlay network for synchronous data distribution and processing in the network. The AE network is based on strict separation of control plane and data plane. The control plane is organized as peer-to-peer network in order to achieve robustness and user-empowered approach while sacrificing efficiency to some extent. The data plane which handles the actual data distribution is optimized for efficiency and allows pluggable implementation of different distribution models. We present a prototype implementation with control plane based on JXTA peer-to-peer substrate and evaluate its behavior, robustness, and efficiency. We also describe some pilot applications the AEs network can be used with.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128460540","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":"Does the Internet Still Demonstrate Fractal Nature?","authors":"G. Terdik, T. Gyires","doi":"10.1109/ICN.2009.8","DOIUrl":"https://doi.org/10.1109/ICN.2009.8","url":null,"abstract":"The self-similar nature of bursty Internet traffic has been investigated for the last decade. A first generation of papers, approximately from 1994 to 2004, argued that the traditionally used Poisson models oversimplified the characteristics of network traffic and were not appropriate for modeling bursty, local-area, and wide-area network traffic. Since 2004, a second generation of papers has challenged the suitability of these results in networks of the new century and has claimed that the traditional Poisson-based and other models are still more appropriate for characterizing today’s Internet traffic. A possible explanation was that as the speed and amount of Internet traffic grow spectacularly, any irregularity of the network traffic, such as self-similarity, might cancel out as a consequence of high-speed optical connections, new communications protocols, and the vast number of multiplexed flows. These papers analyzed traffic traces of Internet backbone collected in 2003. In one of our previous papers we applied the theory of smoothly truncated Levy flights and the linear fractal model in examining the variability of Internet traffic from self-similar to Poisson. We demonstrated that the series of interarrival times was still close to a self-similar process, but the burstiness of the packet lengths decreased significantly compared to earlier traces. Since then, new traffic traces have been made public, including ones captured from the Internet backbone in 2008. In this paper we analyze these traffic traces and apply our new analytical methods to illustrate the tendency of Internet traffic burstiness. Ultimately, we attempt to answer the question: Does the Internet still demonstrate fractal nature?","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131043473","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 Hybrid Approach to Actor-Actor Connectivity Restoration in Wireless Sensor and Actor Networks","authors":"A. Zamanifar, M. Sharifi, Omid Kashefi","doi":"10.1109/ICN.2009.37","DOIUrl":"https://doi.org/10.1109/ICN.2009.37","url":null,"abstract":"Wireless sensor and actor networks (WSANs) consist of powerful actors and resource constraint sensors, which are linked together in wireless networks. In some applications, actors must communicate with each other to make appropriate decisions and perform coordinated actions. Actor-actor network connectivity is vital to networks in such applications. Since WSAN applications are mostly deployed in harsh environments, actor nodes may fail and partition their network. This paper proposes a comparatively more efficient distributed approach to restore actor-actor connectivity upon the failure of any actor by identifying critical actors as well as the connectivity dominating set of the network. This hybrid method helps in detecting critical nodes and candidate replacement actors more precisely while minimizing the total number of required messages for network restoration. Handling the failure of the actors is done in a proactive manner. The proposed approach minimizes both the total actors' movements and restoration time of network. When a failed actor is a critical node, actors in its neighborhood are relocated in a coordinated way to reconnect the actor network. The superiority of the proposed approach is validated through simulative experiments.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134100571","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":"Distributed Information Object Resolution","authors":"K. Pentikousis","doi":"10.1109/ICN.2009.31","DOIUrl":"https://doi.org/10.1109/ICN.2009.31","url":null,"abstract":"The established host-centric networking paradigm is challenged due to handicaps related with disconnected operation, mobility, and broken locator/identifier semantics. This paper soberly examines another topic of great interest: distributed information object resolution. After recapping the notion of an information object, we review object resolution in today's Internet which is based on Uniform Resource Identifiers (URIs). We revisit the implications of DNS involvement in URI resolution and discuss how two different types of content distribution networks work with respect to name resolution. Then we evaluate proposals championing the replacement of DNS with alternatives based on distributed hash tables. We present the pros and cons and highlight the importance of latency in resolution. The paper positions these issues in the context of a Network of Information (NetInf) and concludes with open research topics in the area.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125719212","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":"HRSQM: Heterogeneous Receivers Supporting QoS Multicast","authors":"M. Aajami, H. Saidi, M. Hashemi","doi":"10.1109/ICN.2009.65","DOIUrl":"https://doi.org/10.1109/ICN.2009.65","url":null,"abstract":"In this paper we have proposed HRSQM, Heterogeneous Receivers Supporting QoS Multicast, which is a distributed protocol that creates multicast tree for receivers with heterogeneous QoS requirements. It relies only on local states and does not use any global state. Furthermore, through exhaustive search and carefully selecting branch to connect the new node to the tree, the efficiency of tree is always near optimal. Also it reshapes the multicast tree to improve resource utilization. Thanks to the current high-speed networks, HRSQM combines resource reservation with routing. By comparing it with other related protocols through simulations, we find that it has higher success ratio, also the resulting multicast trees of HRSQM require much fewer links than other methods.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133183789","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}
S. Mumtaz, P. Marques, A. Gameiro, Jonathan Rodriguez
{"title":"Application of Game Theory in Ad-Hoc Opportunistic Radios","authors":"S. Mumtaz, P. Marques, A. Gameiro, Jonathan Rodriguez","doi":"10.1109/ICN.2009.9","DOIUrl":"https://doi.org/10.1109/ICN.2009.9","url":null,"abstract":"The application of mathematical analysis to the study of wireless ad hoc networks has met with limited success due to the complexity of mobility, traffic models and the dynamic topology. A scenario based UMTS TDD opportunistic cellular system with an ad hoc behavior that operates over UMTSFDD licensed cellular network is considered. In this paper, we describe how ad hoc opportunistic radio can be modeled as a game and how we apply game theory based Power Control in ad-hoc opportunistic radio.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124355713","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":"Capacity Theorem for Finite Duration Symbols","authors":"Subhendu K. Das, N. Mohanty, Avtar Singh","doi":"10.1109/ICN.2009.25","DOIUrl":"https://doi.org/10.1109/ICN.2009.25","url":null,"abstract":"The proof of capacity theorem assumed that the symbols are of infinite time duration. Since the infinite time symbols are not meaningful and is not used in the existing technology, in this paper we decided to prove it over finite time interval. The result shows that the new capacity of a band limited channel explicitly depends on the sample rate. This new approach helps us to show that all shift keying methods do not meet the Shannon’s model and therefore cannot achieve the basic capacity limits. We also show that the function modulation method can be engineered to achieve the new extended limits. To establish our theory we use the well known mathematical concept of infinite dimensionality of function space. The new capacity result is stated in a theorem.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129349058","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}
José M. Gutiérrez López, R. C. Rumín, T. Riaz, J. Pedersen, O. Madsen
{"title":"Characterization of Static/Dynamic Topological Routing for Grid Networks","authors":"José M. Gutiérrez López, R. C. Rumín, T. Riaz, J. Pedersen, O. Madsen","doi":"10.1109/ICN.2009.13","DOIUrl":"https://doi.org/10.1109/ICN.2009.13","url":null,"abstract":"Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures.In addition, the high requirements of future services and applications demand more flexible and adaptive networks. Topological routing in grid networks is a simple and efficient alternative to traditional routing techniques, e.g. routing tables, and the paper extends this kind of routing providing a ”Dynamic” attribute.This new property attempts to improve the overall network performance for future necessities.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129785996","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 Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks","authors":"M. Rai, S. Verma, S. Tapaswi","doi":"10.1109/ICN.2009.63","DOIUrl":"https://doi.org/10.1109/ICN.2009.63","url":null,"abstract":"Connected Dominating Set (CDS) problem in unit disk graph has a significant impact on an efficient design of routing protocols in wireless sensor networks. In this paper, an algorithm is proposed for finding Minimum Connected Dominating Set (MCDS) using Dominating Set. Dominating Sets are connected by using Steiner tree. The algorithm goes through three phases. In first phase Dominating Set is found, in second phase connectors are identified, connected through Steiner tree. In third phase the CDS obtained in second phase is pruned to obtain a MCDS. MCDS so constructed needs to adapt to the continual topology changes due to deactivation of a node due to exhaustion of battery power. These topological changes due to power constraints are taken care by a local repair algorithm that reconstructs the MCDS using only neighborhood information. Simulation results indicate both the heuristics are very efficient and result in near optimal MCDS.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134357877","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
