{"title":"A hybrid topology architecture for P2P systems","authors":"Aameek Singh, Ling Liu","doi":"10.1109/ICCCN.2004.1401711","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401711","url":null,"abstract":"A core area of P2P systems research is the topology of the overlay network. It has ranged from random unstructured networks like Gnutella to Super-Peer architectures to the recent trend of structured overlays based on distributed hash tables (DHTs) (I. Stoica et al., 2001), (A. Rowstron et al., 2001), (S. Ratnasamy et al., 2001). While the unstructured networks have excessive lookup costs and un-guaranteed lookups, the structured systems offer no anonymity and delegate control over data items to unrelated peers. In this paper, we present an in-the-middle hybrid architecture which uses a mix of both topologies to create a decentralized P2P infrastructure. The system provides scalable and guaranteed lookups in addition to mutual anonymity and also allows hosting content with the content-owner. We validate our architecture through a thorough analytical and performance analysis of the system","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121375527","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":"Scalable network monitoring for multimedia applications in enterprise networks","authors":"B. Karaçali, C. Kintala","doi":"10.1109/ICCCN.2004.1401660","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401660","url":null,"abstract":"Networked multimedia applications require stringent quality of service (QoS) guarantees from the underlying data network. Many techniques have been proposed at the network layer to deliver acceptable QoS for such applications. In this paper, we explore providing network monitoring support in the application layer for QoS policies. We study the feasibility of a scalable network monitoring service that real-time applications may access to gather network status information in order to adapt to changing network conditions and take actions such as making application level routing decisions. We propose a scalable, low probing overhead monitoring service based on monitoring utilization on network devices traversed by multimedia traffic. Our motivation is to take advantage of often intersecting end-to-end paths traversed by multimedia traffic in an enterprise setting. We empirically assess the QoS improvements resulting from a service that monitors network utilization for an application involving dynamic server selection on a real production network. Specifically, we compare the performance of various dynamic server selection strategies for multimedia streaming including random selection, round-trip time based selection, proximity based selection, and utilization based selection. Our results indicate that compared to random selection, server selection strategies that rely on our network utilization based monitoring scheme result in significantly lower end-to-end delay and packet loss in streaming sessions. Compared to round-trip time based selection, our scheme results in comparable end-to-end delay and loss figures while incurring significantly lower probing cost","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126357547","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":"Quality of service in two-stage Ethernet passive optical access networks","authors":"A. Shami, Xiaofeng Bai, C. Assi, N. Ghani","doi":"10.1109/ICCCN.2004.1401666","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401666","url":null,"abstract":"Ethernet passive optical networks (EPONs) have emerged as a well accepted candidate for next-generation access networks. Propelled by rapid price declines in fiber optics and Ethernet components, these new EPON architectures combine the latest in optical and electronic advances, and are poised to become the dominant means of delivering bundled services over a single platform. This paper proposes a novel EPON architecture capable of delivering bandwidth-intensive voice, data video services at distances beyond 25 km in the subscriber access network. Specifically, this paper proposes a two-stage EPON architecture that allows more end-users to share an OLT link, and enables longer access reach/distances (beyond the usual 25 km distance). In addition, a new dynamic bandwidth allocation (DBA) algorithm is proposed to effectively and fairly allocate bandwidths between end users. This DBA algorithm can support differentiated services in a network with heterogeneous traffic. We conduct detailed simulation experiments to study the performance and validate the effectiveness of the proposed architecture and algorithms","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128415396","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":"k-anycast game in selfish networks","authors":"Weizhao Wang, Xiangyang Li, O. Frieder","doi":"10.1109/ICCCN.2004.1401650","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401650","url":null,"abstract":"Conventionally, the majority of network routing protocols assume that every network terminal or link forwards data for others without any deviation. However, this may not be true when the terminals or links are owned by individual selfish users, who always tries to maximize their own benefits instead of faithfully following a prescribed protocol. In this paper, we propose a new routing protocol, called k-anycast routing, that works well even if network links (or terminals or both) are selfish. In our protocol, the source node first finds a tree that spans k receivers out of a set of possible receivers and pay the relay links to compensate their costs. We prove that every relay link follows the routing protocol: it maximizes its profit when it declares its actual cost","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134074333","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":"Adaptive IP encapsulation for real-time traffic over Ethernet","authors":"M. Krunz, P. Rosengard","doi":"10.1109/ICCCN.2004.1401725","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401725","url":null,"abstract":"Quality of service support for multimedia applications has to date focused on \"core-network\" schemes, with little attention to the last-mile issue. In this paper, we extend the QoS support to Ethernet users through a novel adaptive encapsulation scheme. The scheme supports both real-time (RT) and non-real-time (NRT) traffic types. It is adaptive in that it dynamically varies the number of IP packets in an Ethernet frame, depending on the delay requirements of the transported packets, the framing overhead, and the state of the shared medium. For RT traffic, the proposed scheme is designed to maximize the encapsulation efficiency while probabilistically guaranteeing the delay requirements of the traffic. For NRT traffic, the scheme aims at maximizing the efficiency. Extensive simulations are conducted to evaluate the performance of the proposed scheme. The results indicate a substantial improvement in the effective throughput, ranging from 20% to more than 200%, depending on the type of traffic (RT or NRT) and on the underlying packet sizes","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182357","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":"Dynamic key management for secure routing in LCMRMG MANET","authors":"W. Peng, Yalin Wang, K. Makki","doi":"10.1109/ICCCN.2004.1401633","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401633","url":null,"abstract":"We present a secure key management scheme for the locality caching multi-root multi-generation (LCMRMG) MANET routing algorithm (W. Peng et al., 2003). The proposed scheme is fully distributed, flexible in secure share distribution, and scalable well to large MANET. The scheme takes advantage of the multi-root nature of LCMRMG and successfully integrates public key, certification and threshold technologies. Our simulation has proven that the proposed scheme is indeed secure, robust, efficient, and scalable","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124368830","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":"Channel delay impact on TCP and SCPS-TP over LEO/GEO-stationary space links","authors":"Ruhai Wang","doi":"10.1109/ICCCN.2004.1401592","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401592","url":null,"abstract":"A substantially long round trip time (RTT) in space channel hurts TCP interactions between the sending and receiving sides, and limits the usefulness and effectiveness of TCP feedback from the remote endpoint for space communications. Space communication protocol standards-transport protocol (SCPS-TP) is a set of extensions to transmission control protocol (TCP) aimed at improving TCP performance in space communications. Some work has been done on performance comparison between SCPS-TP and the widely used TCP. It is expected to have an evaluation of SCPS-TP in coping with long channel delay which is one of the primary features in space communications. This paper describes an experimental evaluation of channel delay impact on throughput performance of SCPS-TP over LEO/GEO-stationary space links using a test-bed, by comparing it with the widely used TCP","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116495289","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 location-based routing algorithm for vehicle to vehicle communication","authors":"R. Aquino-Santos, R. Edwards, A. E. Block","doi":"10.1109/ICCCN.2004.1401632","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401632","url":null,"abstract":"We present a location-based routing algorithm with cluster-based flooding for vehicle to vehicle communication. We consider a motorway environment with associated high mobility and contrast and compare position-based and non-position-based routing strategies, along with a limiting function for flood mechanisms in reactive ad-hoc protocols. The performance of dynamic source routing (DSR) and ad-hoc on-demand distance vector routing (AODV) for non-positional and location routing algorithm with cluster-based flooding (LORA/spl I.bar/CBF) for positional algorithms are considered. Our proposed flooding limiting technique is compared with AODV and DSR by simulation. The mobility of the vehicles on a motorway using a microscopic traffic model developed in OPNET has been used to evaluate average route discovery (RD) time, end-to-end delay (EED), routing load, routing overhead, overhead, and delivery ratio.","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117033720","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":"Dynamic congestion control to improve performance of TCP split-connections over satellite links","authors":"Lijuan Wu, F. Peng, Victor C. M. Leung","doi":"10.1109/ICCCN.2004.1401643","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401643","url":null,"abstract":"Satellites have played an important role in global telecommunications. However, transmission control protocol (TCP) suffers significant performance degradations over satellite links due to high bit error rate and long latency. Among methods proposed to alleviate the impact of satellite link characteristics on TCP performance, split TCP connections separated by performance enhancement proxies have been proven attractive because they can keep TCP configurations in the end systems unchanged. In this paper, we propose a new dynamic congestion control mechanism based on TCP selective acknowledgment (SACK), called dynamic SACK (DSACK), for the satellite segment in a split TCP connection. DSACK obtains immediate congestion feedback from the underlying layer, so as to efficiently prevent congestion and correctly differentiate between packet losses due to channel errors and congestion. Simulation results show that our novel mechanism improves TCP performance over satellite networks significantly, compared to standard TCP versions","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117066562","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":"Finding good candidate cycles for efficient p-cycle network design","authors":"Chang Liu, L. Ruan","doi":"10.1109/ICCCN.2004.1401657","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401657","url":null,"abstract":"An important problem in p-cycle network design is to find a set of p-cycles to protect a given working capacity distribution so that the total spare capacity used by the p-cycles is minimized. Existing approaches for solving the problem include ILP and heuristic algorithm. Both require a set of candidate p-cycles to be precomputed. In this paper, we propose an algorithm to compute a small set of candidate p-cycles that can lead to good performance when used by ILP or the heuristic algorithm. The key idea of the algorithm is to generate a combination of high efficiency cycles and short cycles so that both densely distributed and sparsely distributed working capacities can be efficiently protected by the candidate cycles. The algorithm is also flexible in that the number of cycles generated is controlled by an input parameter. Simulation study showed that the cycles generated by our algorithm can lead to near optimal solutions when used by either ILP or the heuristic algorithm","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121826948","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}