Managing large computing infrastructures in a reliable and efficient way requires system configuration tools which accept higher-level specifications. This paper describes an interface between the established configuration tool LCFG, and the experimental configuration tool PoDlM. The combined system is used to generate explicit real-world configurations from high-level, constraint-based specifications. The concept is validated using live data from a large production installation. This demonstrates that a loosely-coupled, multi-layer approach can be used to construct configuration tools which translate high-level requirements into deployable production configurations.
{"title":"Managing Real-World System Configurations with Constraints","authors":"Thomas Delaet, P. Anderson, W. Joosen","doi":"10.1109/ICN.2008.38","DOIUrl":"https://doi.org/10.1109/ICN.2008.38","url":null,"abstract":"Managing large computing infrastructures in a reliable and efficient way requires system configuration tools which accept higher-level specifications. This paper describes an interface between the established configuration tool LCFG, and the experimental configuration tool PoDlM. The combined system is used to generate explicit real-world configurations from high-level, constraint-based specifications. The concept is validated using live data from a large production installation. This demonstrates that a loosely-coupled, multi-layer approach can be used to construct configuration tools which translate high-level requirements into deployable production configurations.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115267459","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}
In this contribution an analysis of MultiCarrier Modulation (MCM) is realized. The features of Discrete MultiTone modulation (DMT), Orthogonal Frequency Division Multiplexing (OFDM) and alternative modulation based on filter bank - Filtered MultiTone (FMT) will be mentioned. Based on this study the half sub-channel overlapped Filtered MultiTone Modulation will be introduced.
{"title":"Half-Overlap Subchannel Filtered MultiTone Modulation with the Small Delay","authors":"P. Silhavy","doi":"10.1109/ICN.2008.33","DOIUrl":"https://doi.org/10.1109/ICN.2008.33","url":null,"abstract":"In this contribution an analysis of MultiCarrier Modulation (MCM) is realized. The features of Discrete MultiTone modulation (DMT), Orthogonal Frequency Division Multiplexing (OFDM) and alternative modulation based on filter bank - Filtered MultiTone (FMT) will be mentioned. Based on this study the half sub-channel overlapped Filtered MultiTone Modulation will be introduced.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116789469","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}
Due to the explosive growth of the WWW and the increasing amount of data available via the Internet, how to retrieve desired information from the Internet with high efficiency and good effectiveness is of great importance. In this paper, we propose an information retrieval model for use in large dynamic networks such as the Internet. Firstly, we divide the network into a number of groups. An exceptional handling mechanism is adopted, i.e., a controlled flooding algorithm for intre-group information updating and random walk algorithm for inter-group information retrieval. We also propose an equal representative mechanism to enhance the fault-tolerant ability of the system. Extensive experiments are conducted to evaluate the performance and rationality of our model. The experimental results show that our model outperforms the existing approaches on the retrieval efficiency and the fault-tolerant ability.
{"title":"Enhance Retrieval Efficiency on the Internet","authors":"W. Qu, Keqiu Li, M. Kitsuregawa","doi":"10.1109/ICN.2008.123","DOIUrl":"https://doi.org/10.1109/ICN.2008.123","url":null,"abstract":"Due to the explosive growth of the WWW and the increasing amount of data available via the Internet, how to retrieve desired information from the Internet with high efficiency and good effectiveness is of great importance. In this paper, we propose an information retrieval model for use in large dynamic networks such as the Internet. Firstly, we divide the network into a number of groups. An exceptional handling mechanism is adopted, i.e., a controlled flooding algorithm for intre-group information updating and random walk algorithm for inter-group information retrieval. We also propose an equal representative mechanism to enhance the fault-tolerant ability of the system. Extensive experiments are conducted to evaluate the performance and rationality of our model. The experimental results show that our model outperforms the existing approaches on the retrieval efficiency and the fault-tolerant ability.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127137758","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}
This paper presents a distributed routing algorithm based on architecture of Forwarding and Control Element Separation(ForCES). On this algorithm the calculating routing table divides into two parts, inner routing table between Forwarding Elements and outer routing table between routers. Then according to both routing tables the Control Element calculates the final routing table of each Forwarding Element. An independent routing server is used for the routing process, which decreases the amount of development work. This algorithm satisfies the distributed characteristic of ForCES router and reduces the amount of computation of Forwarding Element obviously. The algorithm has been applied at a prototype of ForCES router with satisfactory result.
{"title":"A Distributed Routing Algorithm Based on Architecture of ForCES","authors":"Bin Zhuge, Ligang Dong, Weiming Wang","doi":"10.1109/ICN.2008.92","DOIUrl":"https://doi.org/10.1109/ICN.2008.92","url":null,"abstract":"This paper presents a distributed routing algorithm based on architecture of Forwarding and Control Element Separation(ForCES). On this algorithm the calculating routing table divides into two parts, inner routing table between Forwarding Elements and outer routing table between routers. Then according to both routing tables the Control Element calculates the final routing table of each Forwarding Element. An independent routing server is used for the routing process, which decreases the amount of development work. This algorithm satisfies the distributed characteristic of ForCES router and reduces the amount of computation of Forwarding Element obviously. The algorithm has been applied at a prototype of ForCES router with satisfactory result.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126720431","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}
The most important desidered characteristic for today's networks is quality of service (QoS). Currently DiffServ-based MPLS networks are able to the development of efficient methods for QoS provisioning. This article analysis, through computer simulation, the performance of WFQ schedulers in a DiffServ node loaded by long range dependence (LRD) traffic. The adopted process for the traffic generation consists in the aggregation of the traffic produced by several TCP connections transmitting files with a size that is modeled by heavy tail distribution. This distribution was obtained, from the Internet, by one-week long measurements. The objective is to observe the bandwidth distribution obtained with the WFQ scheduler, as well as the latency, i.e., the file transfer average delay, in an environment with different priorities. Simulations were carried out with the network simulator NS-2, and several simulation results are presented and analyzed.
{"title":"A Simulation Study of the WFQ Scheduler in a DiffServ Node under LRD Traffic","authors":"Kleber Kendy Horikawa Nabas, W. Godoy, E. Wille","doi":"10.1109/ICN.2008.120","DOIUrl":"https://doi.org/10.1109/ICN.2008.120","url":null,"abstract":"The most important desidered characteristic for today's networks is quality of service (QoS). Currently DiffServ-based MPLS networks are able to the development of efficient methods for QoS provisioning. This article analysis, through computer simulation, the performance of WFQ schedulers in a DiffServ node loaded by long range dependence (LRD) traffic. The adopted process for the traffic generation consists in the aggregation of the traffic produced by several TCP connections transmitting files with a size that is modeled by heavy tail distribution. This distribution was obtained, from the Internet, by one-week long measurements. The objective is to observe the bandwidth distribution obtained with the WFQ scheduler, as well as the latency, i.e., the file transfer average delay, in an environment with different priorities. Simulations were carried out with the network simulator NS-2, and several simulation results are presented and analyzed.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126974658","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}
TCP-SYN attack is one of the commonly used DDoS attacks aimed at bringing down a computer system connected to Internet. There has been an increased targeting of Windows end-users and servers. The attackers and intruders are leveraging easily identifiable network blocks to target and exploit Windows end-user servers and computer systems. In order to provide some level of security and protection against security attacks, the Microsoft's Windows XP operating systems were designed with an additional level of security. The initial Microsoft's windows XP without service pack2 (SP2) provided windows firewall with some security features. The later version of Microsoft's windows XP with SP2 intends to provide enhanced security features to prevent and mitigate the adverse effect of security attacks on the host computer systems. In this experimental paper, we set out to conduct real TCP-SYN attacks on computer systems in a controlled lab environment and measure the effectiveness of Microsoft's windows XP without SP2, and with SP2 in preventing TCP-SYN attacks. The Windows firewall (without SP2) was found to be not effective against the TCP-SYN attacks. However, the later version of Microsoft's Windows XP with SP2 was found to significantly help mitigate the adverse effect of the TCP SYN attacks on Windows based computer systems.
TCP-SYN攻击是一种常用的DDoS攻击，目的是使连接到Internet的计算机系统瘫痪。针对Windows终端用户和服务器的攻击越来越多。攻击者和入侵者利用容易识别的网络块来瞄准和利用Windows终端用户服务器和计算机系统。为了提供一定程度的安全性和防止安全攻击，微软的Windows XP操作系统在设计上增加了额外的安全性。最初的微软windows XP无服务包2 (SP2)提供了带有一些安全功能的windows防火墙。微软windows XP SP2的最新版本旨在提供增强的安全功能，以防止和减轻对主机系统的安全攻击的不利影响。在这篇实验论文中，我们着手在受控的实验室环境中对计算机系统进行真正的TCP-SYN攻击，并测量Microsoft windows XP不带SP2和带SP2在防止TCP-SYN攻击方面的有效性。发现Windows防火墙(没有SP2)对TCP-SYN攻击无效。然而，后来的Microsoft Windows XP SP2版本被发现可以显著地帮助减轻TCP SYN攻击对基于Windows的计算机系统的不利影响。
{"title":"Mitigation of TCP-SYN Attacks with Microsoft's Windows XP Service Pack2 (SP2) Software","authors":"Sanjeev Kumar, Einar Petana","doi":"10.1109/ICN.2008.77","DOIUrl":"https://doi.org/10.1109/ICN.2008.77","url":null,"abstract":"TCP-SYN attack is one of the commonly used DDoS attacks aimed at bringing down a computer system connected to Internet. There has been an increased targeting of Windows end-users and servers. The attackers and intruders are leveraging easily identifiable network blocks to target and exploit Windows end-user servers and computer systems. In order to provide some level of security and protection against security attacks, the Microsoft's Windows XP operating systems were designed with an additional level of security. The initial Microsoft's windows XP without service pack2 (SP2) provided windows firewall with some security features. The later version of Microsoft's windows XP with SP2 intends to provide enhanced security features to prevent and mitigate the adverse effect of security attacks on the host computer systems. In this experimental paper, we set out to conduct real TCP-SYN attacks on computer systems in a controlled lab environment and measure the effectiveness of Microsoft's windows XP without SP2, and with SP2 in preventing TCP-SYN attacks. The Windows firewall (without SP2) was found to be not effective against the TCP-SYN attacks. However, the later version of Microsoft's Windows XP with SP2 was found to significantly help mitigate the adverse effect of the TCP SYN attacks on Windows based computer systems.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116050531","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}
The application of Mobile Ad Hoc Networks to cattle monitoring has the potential to increase the profitability of cattle production and positively impact the everyday live of farm personnel. The main research challenges are identifying and refining realistic requirements for a MANET routing protocol and designing such protocol. In this paper we report on the field experiments we performed in order to address this. Our approach builds on energy efficient MANETs to provide continuous monitoring of multidimensional parameters of animal mobility including temporal and spatial walking intensity and feed intake in order to detect oestrus, pregnancy, animal diseases and reduced efficiency of pastures. We support remote and in-situ, specific and range queries and notifications about newly detected events. Our extensive set of emulations show that we achieve lower and more balanced energy consumption while preserving the delays for increasing number of nodes within the user expected boundaries.
将移动 Ad Hoc 网络应用于牛群监测有可能提高牛群生产的利润率，并对农场工作人员的日常生活产生积极影响。主要的研究挑战是确定和完善城域网路由协议的实际要求，并设计这样的协议。在本文中，我们报告了为解决这一问题而进行的现场实验。我们的方法建立在高能效城域网的基础上，对动物移动的多维参数进行连续监测，包括时间和空间行走强度和采食量，以检测发情、怀孕、动物疾病和牧场效率降低等情况。我们支持远程和原地、特定和范围查询，以及有关新检测到事件的通知。我们进行的大量仿真表明，我们的能耗更低、更均衡，同时还能在用户预期范围内保持节点数量增加时的延迟。
{"title":"Practical MANETs for Pervasive Cattle Monitoring","authors":"B. Wietrzyk, M. Radenkovic, Ivaylo Kostadinov","doi":"10.1109/ICN.2008.78","DOIUrl":"https://doi.org/10.1109/ICN.2008.78","url":null,"abstract":"The application of Mobile Ad Hoc Networks to cattle monitoring has the potential to increase the profitability of cattle production and positively impact the everyday live of farm personnel. The main research challenges are identifying and refining realistic requirements for a MANET routing protocol and designing such protocol. In this paper we report on the field experiments we performed in order to address this. Our approach builds on energy efficient MANETs to provide continuous monitoring of multidimensional parameters of animal mobility including temporal and spatial walking intensity and feed intake in order to detect oestrus, pregnancy, animal diseases and reduced efficiency of pastures. We support remote and in-situ, specific and range queries and notifications about newly detected events. Our extensive set of emulations show that we achieve lower and more balanced energy consumption while preserving the delays for increasing number of nodes within the user expected boundaries.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129676744","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}
Our previous work proposes a macro model that controls the flows across naturally occurring bottlenecks in multi-hop wireless networks. The macro model resembles a conventional wired network, and allows us to apply extant research on flow control directly to ad hoc networks. In this paper, we further justify the feasibility of applying our macro model of ad hoc networks to access control and the validity of only controlling the flows across bottlenecks. We describe a simple rule that partitions the network into super-nodes. We then introduce a probabilistic geographic routing protocol that routes packets between bottlenecks to avoid congestion within super-nodes. Simulation results show that not only is the average flow in non- bottlenecked areas less than the average flow across bottlenecks, but the flows in each of the transmission areas that is not in a bottleneck are less than the flows in the transmission areas within the bottleneck.
{"title":"Applying a Macro Model of Ad Hoc Networks to Access Control","authors":"Congzhou Zhou, N. Maxemchuk","doi":"10.1109/ICN.2008.50","DOIUrl":"https://doi.org/10.1109/ICN.2008.50","url":null,"abstract":"Our previous work proposes a macro model that controls the flows across naturally occurring bottlenecks in multi-hop wireless networks. The macro model resembles a conventional wired network, and allows us to apply extant research on flow control directly to ad hoc networks. In this paper, we further justify the feasibility of applying our macro model of ad hoc networks to access control and the validity of only controlling the flows across bottlenecks. We describe a simple rule that partitions the network into super-nodes. We then introduce a probabilistic geographic routing protocol that routes packets between bottlenecks to avoid congestion within super-nodes. Simulation results show that not only is the average flow in non- bottlenecked areas less than the average flow across bottlenecks, but the flows in each of the transmission areas that is not in a bottleneck are less than the flows in the transmission areas within the bottleneck.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124011107","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}
Since ad-hoc networks have no fixed infrastructure, there are many different kinds of Bluetooth-enabled ad- hoc networks with various security procedures and security requirements. In this paper, we make further classification of Bluetooth-enabled ad-hoc networks and their security procedures/requirements depending on a risk analysis within each classified group. In addition, we evaluate possible breaches and damage that can be inflicted by various attacks in such scenarios. Moreover, we devise security procedures to prevent malicious Bluetooth devices from stealing information from other Bluetooth devices.
{"title":"Further Classification of Bluetooth-Enabled Ad-Hoc Networks Depending on a Risk Analysis within Each Classified Group","authors":"Keijo Haataja","doi":"10.1109/ICN.2008.26","DOIUrl":"https://doi.org/10.1109/ICN.2008.26","url":null,"abstract":"Since ad-hoc networks have no fixed infrastructure, there are many different kinds of Bluetooth-enabled ad- hoc networks with various security procedures and security requirements. In this paper, we make further classification of Bluetooth-enabled ad-hoc networks and their security procedures/requirements depending on a risk analysis within each classified group. In addition, we evaluate possible breaches and damage that can be inflicted by various attacks in such scenarios. Moreover, we devise security procedures to prevent malicious Bluetooth devices from stealing information from other Bluetooth devices.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127625045","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}
We propose a transport-layer approach to provide predictable throughput for applications requiring stable bandwidth resource, such as video streaming and VoIP. The proposed mechanism deploys an end-to-end approach: it dynamically sets the increase degree of the congestion window size of a TCP connection according to the measurement results of the available bandwidth of the network path, which is obtained by inline network measurement technique developed in our research group. In the present paper, we briefly introduce the proposed mechanism and show the performance evaluation results in the experimental network and in the commercial Internet environment. We exhibit that the proposed mechanism can achieve the required throughput with high probability without any support from intermediate network nodes.
{"title":"A Transport-layer Approach for Achieving Predictable Throughput for Internet Applications","authors":"G. Hasegawa, Kana Yamanegi, M. Murata","doi":"10.1109/ICN.2008.30","DOIUrl":"https://doi.org/10.1109/ICN.2008.30","url":null,"abstract":"We propose a transport-layer approach to provide predictable throughput for applications requiring stable bandwidth resource, such as video streaming and VoIP. The proposed mechanism deploys an end-to-end approach: it dynamically sets the increase degree of the congestion window size of a TCP connection according to the measurement results of the available bandwidth of the network path, which is obtained by inline network measurement technique developed in our research group. In the present paper, we briefly introduce the proposed mechanism and show the performance evaluation results in the experimental network and in the commercial Internet environment. We exhibit that the proposed mechanism can achieve the required throughput with high probability without any support from intermediate network nodes.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115861530","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：