Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献

{"title":"On the impact of DoS attacks on Internet traffic characteristics and QoS","authors":"P. Owezarski","doi":"10.1109/ICCCN.2005.1523865","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523865","url":null,"abstract":"The Internet is on the way of becoming the universal communication network, and then needs to provide various services with guaranteed quality for all kinds of applications. Denial of service (DoS) attacks are then more efficient in a guaranteed multi-services network than in the \"old\" best effort Internet. Indeed, with best effort services, a DoS attack has to forbid the target of the attack to communicate. With a multi-services network, it is sufficient to make the network not respect the SLA (service level agreement) committed with clients, what is easier and can be performed using simple flooding attacks. Then, the question is: how does a DoS attack impact the quality of service (QoS) of a network given that networks are hugely over-provisioned, and that DoS attacks never succeed to completely overflow these high speed networks? This paper aims at answering this question as we do believe that it can help for defending the network against such attacks. The analysis of DoS attacks has been performed using traffic monitoring tools on the Internet. In particular, the analysis of attacks shows that they are increasing long range dependence (LRD) in the traffic, breaking the invariant power laws of normal Internet traffic. It is also explained in the paper, based on some normal traffic traces characterization and analysis why LRD is such a bad parameter for having good QoS.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129734314","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 dual round-robin algorithm for combined input-crosspoint-queued switches","authors":"Yanfeng Zheng, Wen Gao","doi":"10.1109/ICCCN.2005.1523842","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523842","url":null,"abstract":"Compared with a bufferless crossbar switch, a combined input-crosspoint-queued (CICQ) switch has better scalability owing to its distributed scheduling. Although the previously proposed round-robin algorithms achieve 100% throughput asymptotically under uniform traffic, these algorithms do not provide a satisfactory performance under nonuniform traffic. In this paper, we propose an efficient round-robin algorithm for a CICQ switch with one-cell cross point buffers. With our algorithm, each input arbiter is associated with dual round-robin pointers. Unlike the existing round-robin algorithms, our algorithm has distinctive round-robin pointer updating rules which are powerful to cope with nonuniform traffic patterns. Extensive simulation results show that our algorithm achieves a satisfactory performance under both uniform and a broad class of nonuniform traffic patterns.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132269302","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":"Detection and tracking of region-based evolving targets in sensor networks","authors":"Chunyu Jiang, Guo-Yong Dong, Bin Wang","doi":"10.1109/ICCCN.2005.1523939","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523939","url":null,"abstract":"Sensor networks have emerged as a promising technology for large-scale, real-time monitoring in complex environments. This paper develops in-network algorithms for the detection and tracking of region-based targets and events. We deal with such issues as network topology, event boundary detection, region merging, and region simplification and smoothing. Simulation experiments confirmed that our algorithms are efficient and accurate.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686562","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":"Scheduling on sensor hybrid network","authors":"Hongsik Choi, Ju Wang, E. Hughes","doi":"10.1109/ICCCN.2005.1523924","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523924","url":null,"abstract":"We investigate a unique scheduling problem in wireless sensor networks where all nodes in a cluster send exactly one packet to a designated sink node with goal of minimized transmission time. The difficulty lies in the fact that node transmissions must be sufficiently isolated either in time or in space to avoid collisions. The problem is formulated and solved via graph representation. We prove that with specific network topologies (either line or tree); an optimal transmission schedule can be obtained efficiently through a pipeline-like schedule. The minimum time required for a line (or tree) topology with n nodes is 3(n-2). We further prove that our scheduling problem is NP-hard for general graphs. We propose a heuristic algorithm for general graphs. Our heuristic tries to schedule as many independent segments as possible to increase the degree of parallel transmission. This algorithm is compared to an RTS/CTS based distributed algorithm. Preliminary simulated results indicate that our heuristic algorithm out-performs the RTS/CTS based distributed algorithm (up to 30%) and exhibits stable scheduling behavior.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125606576","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":"Packetization of 3D progressive meshes for streaming over lossy networks","authors":"Yan Gu, Wei Tsang Ooi","doi":"10.1109/ICCCN.2005.1523900","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523900","url":null,"abstract":"In this paper, we consider the problem of packetizing progressive 3D geometry models for streaming over a lossy network. We adopt a graph-theoretic approach to model packetization of progressive 3D models, with the goal of minimizing dependencies among packets. We show that this packetization problem is strongly NP-complete, and we propose two packing heuristics. Our experiments show that both heuristics perform better than the naive method. In particular, the greedy packing heuristic produces significant improvement in the number of rendered nodes when the network is lossy.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128068597","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":"Statistical analysis of the impact of routing in MANETs based on real-time measurements","authors":"A. K. Agarwal, Wenye Wang","doi":"10.1109/ICCCN.2005.1523907","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523907","url":null,"abstract":"Performance degradation due to routing overhead is a serious impediment to fulfilling quality of service (QoS) in mobile ad hoc networks (MANETs). Therefore, analyzing the impact of routing overhead in a real-time environment becomes critical to developing efficient routing protocols and provisioning network performance. We develop a statistical-analytic approach to studying the impact of the routing overhead on delay and throughput in a real-time MANET testbed. The approach helps us in deriving statistical models of delay and throughput which, in turn, enables us to analyze the behavior of routing protocols beyond the scenarios configured in the testbed. In addition, we conduct a simple analysis of measuring network bandwidth consumed by routing overhead in various environments. Although optimized link state routing (OLSR) and ad-hoc on-demand distance vector (AODV) routing protocols are investigated as case studies in this paper, our approach and findings are applicable to other routing protocols as well.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894858","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":"Supporting disconnection operations through cooperative hoarding","authors":"K. Y. Lai, Z. Tari, P. Bertók","doi":"10.1109/ICCCN.2005.1523804","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523804","url":null,"abstract":"Mobile clients often need to operate while disconnected from the network due to limited battery life and network coverage. Hoarding supports this by fetching frequently accessed data into clients' local caches prior to disconnection. Existing work on hoarding have focused on improving data accessibility for individual mobile clients. However, due to storage limitations, mobile clients may not be able to hoard every data object they need. This leads to cache misses and disruption to clients' operations. In this paper, a new concept called cooperative hoarding is introduced to reduce the risks of cache misses for mobile clients. Cooperative hoarding takes advantage of group mobility behaviour, combined with peer cooperation in ad-hoc mode, to improve hoard performance. Two cooperative hoarding approaches are proposed that take into account access frequency, connection probability, and cache size of mobile clients so that hoarding can be performed cooperatively. Simulation results show that the proposed methods significantly improve cache hit ratio and provides better support for disconnected operations compared to existing schemes.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127847646","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":"Maximizing open capacity in mobile optical backbone networks using controllable mobile agents","authors":"Fangting Sun, Abhishek Kashyap, M. Shayman","doi":"10.1109/ICCCN.2005.1523832","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523832","url":null,"abstract":"We consider a mobile backbone network with free space optical point-to-point links. Requests for aggregate bandwidth between pairs of backbone nodes arrive one-by-one, and a bandwidth guaranteed connection is established if there are sufficient network resources; otherwise, the request is rejected. In addition to the ordinary backbone nodes, there are a limited number of controllable mobile agents; these are nodes that may be located as desired to optimize the performance of the network. The specific problem we consider is that of determining the positions for the mobile agents to maximize the minimum max How over all source-destination pairs. We show that this problem is NP-hard. We then develop a heuristic algorithm to locate the agents based on the current network state. It is shown that by using the algorithm to strategically place a limited number of agents, a significant improvement in network performance can be achieved.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128378787","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":"Security and IP-based 3G wireless networks","authors":"T. L. Porta","doi":"10.1109/ICCCN.2005.1523849","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523849","url":null,"abstract":"Summary form only given. Telecommunication networks are evolving from closed systems with limited, standardized services, to open systems which will allow great creativity in building and deploying new services. These systems will heavily leverage Internet technology in an effort to create this open environment. This evolution is being aggressively pursued by wireless service providers (WSPs). Along with the benefits of these networks come increasingly high risks of a variety of attacks that may compromise security. Current, so called second generation (2G) wireless telecommunication networks are implemented using standardized control protocols for user and device authentication, mobility management, session control and services control. These networks are closed in the sense that control messages are exchanged on a private packet-switched network based on the signaling system No. 7 standards. Because of their closed nature, there are few successful attacks on these networks. The next, so called third generation (3G) wireless telecommunication networks are migrating towards IP technology, with the ultimate goal being an all-IP network. Standards for these systems, called the IP multimedia subsystem (IMS) are being defined by the third generation partnership projects (3GPP and 3GPP2). These networks will use IP for transport of information, and Internet protocols such as the session initiation protocol (SIP) and mobile IP, for session control and mobility management. These networks open the possibility for IP-based services and must interwork with 2G networks. Because new services will be introduced in the IP-domain of these networks, new attacks on 3G networks are possible. Because IP networks are more accessible than SS7 networks, the control portion of the 3G networks is now more vulnerable to attack. These attacks may be remote denial of service attacks, or attacks that target the integrity of specific services. The means of the attack may vary depending on the interworking model used and the service being offered. In this talk we discuss the different security risks in IP-based 3G networks, different attack types, and the trade-offs of high performance, open network architectures versus secure network infrastructure.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131282639","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":"TCP-XM: unicast-enabled reliable multicast","authors":"Karl Jeacle, J. Crowcroft","doi":"10.1109/ICCCN.2005.1523829","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523829","url":null,"abstract":"In recent years, much work has been done on attempting to scale multicast data transmission to hundreds or thousands of receivers. There are, however, many situations where an application might involve transmission to just ten or twenty sites. Using multicast for this type of application can provide significant benefits including reduced load on the transmitter an overall reduction in network traffic, and consequently shorter data transfer times. In this project, we are investigating how partial or incomplete multicast can be exploited alongside reliable unicast to improve both speed and efficiency of data transfers while maintaining reliability. The approach taken is to combine unicast with multicast by modifying TCP to support multicast transfers, and run this modified TCP engine over UDP as a userspace transport protocol. We describe the work to date on the design and implementation, and provide experimental results from our tests across both local and wide area networks.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125313572","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}