{"title":"Efficient Proxy Selection in Cooperative Web Caching","authors":"I. Khalil, Ge PeiQi","doi":"10.1109/ICON.2007.4444116","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444116","url":null,"abstract":"In cooperative P2P Web caching if the Web cache first receiving a request does not have the document in its memory, it starts searching for it in other nearby cooperating Web caches, retrieving and sending it to the client before contacting the origin (content) server. The advantages of cooperative caching are clear: it reduces the network bandwidth consumption, actual traffic on the origin servers, and average latency experienced by the clients of these caches. Although several cooperative caching protocols have been proposed, few studies have examined how to select the best proxy server that would offer the best response time to a Web client. In this paper, we propose to dynamically measure the data transfer rates between proxy servers to facilitate efficient server selection. However, the main goal of the paper is to study the performance benefits of integrating efficient server selection mechanism. Our analysis shows that attempts to choose the fastest server can be hugely beneficial as file transfer time is significantly better as compared to conventional cooperative proxy mechanisms where selection is largely random.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848944","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 Markov Model for Preference List Sizes in Combined Input Output Queued Switches with Stable Matching Algorithms","authors":"A. Schweizer, T. Devadason, J. Siliquini","doi":"10.1109/ICON.2007.4444107","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444107","url":null,"abstract":"Combined Input Output Queued switches have emerged as one solution to overcome the speedup problem in pure output queued switches. By using a stable matching algorithm, a speedup of two is sufficient to exactly mimic the behavior of an output queued switch. The size of preference lists is a key parameter in the stable matching algorithm that ultimately affects the algorithm runtime and complexity. A model using Markov chains is presented to predict the preference list sizes for uniform traffic. The model achieves high accuracy across a wide range of switch sizes and traffic loads.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"10 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316040","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}
Jerry Chun-Ping Wang, M. Abolhasan, D. Franklin, F. Safaei, J. Lipman
{"title":"On Separating Route Control and Data Flows in Multi-radio Multi-hop Ad Hoc Network","authors":"Jerry Chun-Ping Wang, M. Abolhasan, D. Franklin, F. Safaei, J. Lipman","doi":"10.1109/ICON.2007.4444055","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444055","url":null,"abstract":"Ad hoc networks typically require a significant amount of routing and control information to be distributed in a timely and reliable manner throughout the network, particularly in dynamic environments. As traffic levels increase and the network becomes more heavily congested, there is an increased probability that these critical packets are lost, resulting in obsolete control information being used to make important decisions. This would further compound the problem of network congestion and lead to a very rapid loss of connectivity and throughput. Given this, we argue the solutions to these problems should not rely on putting extra bandwidth on a radio interface. Instead, we should exploit the use of multiple radios to ensure the route can be firmly established. In this paper, we propose a multi-radio solution which reserves one radio channel exclusively for routing. Our simulation results have demonstrated that using a separate radio for routing protocol would dramatically improve reliability in heavily loaded ad hoc wireless networks, thereby effectively alleviating the impact of network congestion.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116079459","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}
N. Funabiki, T. Nakanishi, Walaa Hassan, K. Uemura
{"title":"A Channel Configuration Problem for Access-Point Communications in Wireless Mesh Networks","authors":"N. Funabiki, T. Nakanishi, Walaa Hassan, K. Uemura","doi":"10.1109/ICON.2007.4444093","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444093","url":null,"abstract":"For a flexible and inexpensive large-scale access network to the Internet, we have studied the wireless mesh network composed of access points (APs) as wireless routers. Each AP has multihop wireless connections with the others by the wireless distribution system (WDS). In this network, communications around Internet gateways are usually very crowded and become the bottleneck of performance, because most traffic go through there for access to the Internet. To avoid this problem, the proper channel configurations of APs concerning multiple network interface cards (NICs) and their channel assignments are essential, where for the given network and traffics, the throughput should be maximized while the cost for channel configurations be minimized. In this paper, we formulate this channel configuration problem for AP communications in the wireless mesh network, and present its two-stage heuristic algorithm. The effectiveness of our approach is verified through extensive simulations.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122887686","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":"Detecting Bandwidth DDoS Attack with Control Charts","authors":"Anderson Fernandes P. Santos, Renato Simões Silva","doi":"10.1109/ICON.2007.4444140","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444140","url":null,"abstract":"The distributed denial of service, DDoS, is an internet-wide threat and can be identified in the initial phase through the anomalous behavior of the network traffic. We present a control chart theory approach for the problem of detection this kind of attack, it is designed for non-normal process and is based on the evaluation of estimators that have a minimal variance estimation process position and scattering, whatever the data distribution. We proposed an algorithm to identify the DDoS attacks analyzing these estimators behavior.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131911127","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":"Potential Impacts of Four-Byte AS Numbers in Partial Deployment","authors":"Yuncheng Zhu, Junxiu Lu, Maoke Chen","doi":"10.1109/ICON.2007.4444088","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444088","url":null,"abstract":"Inter-domain routing is suffering from the lack of identifiers for the rapidly growing number of autonomous systems (AS), and therefore the 4-byte AS number has been proposed along with the transition scenario. In a partial deployment environment, 4-byte-enabled border gateway protocol (BGP) speakers have to exchange AS path vector with the old, 2-byte-only ones, via some way of translation and tunneling. The latter does not recognize and will possible lose the information about the 4-byte AS numbers. In this paper, we present a comprehensive analysis in order to identify the potential risks in deploying 4-byte AS numbers. It is found that (1) the loss of the AS4_PATH attributes will disable loop detection and lead to persistent oscillation in certain configuration; (2) AS_PATH-based match and COMMUNITY-based control may be ambiguously applied, and result in policy violations. Typical examples analyzed in real experiments validate these findings. Furthermore, AS path translation adds resource consumption for the routers, and it is necessary to identify the increment to router overhead of CPU time, memory and link bandwidth. Simulation results show that increased overhead will impact the scalability of the global inter-domain routing system, substantially.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126197025","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":"An IETF NSIS-Based Signaling Framework for Negotiating Registry Composition in Ambient Networks","authors":"F. Belqasmi, R. Glitho, R. Dssouli","doi":"10.1109/ICON.2007.4444098","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444098","url":null,"abstract":"Ambient networks (an) is a new networking concept for beyond 3G. Its key feature is network composition, which enables dynamic and instantaneous interworking between heterogeneous networks. An ambient network can host different registries. When ambient networks compose, the hosted registries also have to compose. A signaling framework is needed to dynamically coordinate the control functional entities of the involved networks. This paper proposes a signaling framework for negotiating registry composition in ambient networks. The framework is based on the IETF Next Step in Signaling (NSIS), a suite of protocols for signaling about a data flow along its path. The main extensions we have made are the support of point-to-multipoint message delivery and the definition of a new signaling application for registry composition. These are presented in the paper along with our simulation results.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130044152","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":"Delay Performance Evaluation of Shared-Buffer Based All-Optical Multihop Networks","authors":"A. Fayoumi","doi":"10.1109/ICON.2007.4444080","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444080","url":null,"abstract":"An analytical model is developed to evaluate the delay performance of slotted optical shared-buffer based all-optical networks. ShuffleNet is considered as an example of all-optical networks. The model uses the inclusion-exclusion technique for evaluating the probability of packet buffering and it uses Discrete Time Markov Chain (DTMC) to evaluate the end-to-end packet delay. The model enables dimensioning the switch's buffer to meet the target performance in terms of end-to-end delay.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129232162","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}
Jianqun Chen, Weiming Wang, Bin Zhuge, Ligang Dong
{"title":"A Method of Bandwidth Allocation Mechanism in ForCES Transport Mapping Layer","authors":"Jianqun Chen, Weiming Wang, Bin Zhuge, Ligang Dong","doi":"10.1109/ICON.2007.4444060","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444060","url":null,"abstract":"This paper proposes a bandwidth allocation mechanism called rate and queue controlled dynamic probabilistic priority (RQ-DPP) based on ForCES transport mapping layer (ForCES TML). We apply this method to counter denial-of-service (DoS) attacks for ForCES router from redirect messages. The algorithm adjusts bandwidths between different messages based on message's kind, per-flow estimated arrival rate and buffer occupancy. By comparing with DRR, the simulation results show the effectiveness of the new bandwidth allocation mechanism.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"76 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129742784","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":"GMAC: A Position-Based Energy-Efficient QoS TDMA MAC for Ad Hoc Networks","authors":"J. Lessmann","doi":"10.1109/ICON.2007.4444128","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444128","url":null,"abstract":"The task of a MAC protocol is to manage the access to the (wireless) medium so that it can be shared by multiple nodes. TDMA MACs achieve this by providing non-overlapping access schedules. Typically, such schedules are dictated by a set of master nodes or negotiated between the nodes in a preliminary phase by exchanging messages. This has to be periodically repeated to adapt to changing network conditions. In this paper, we present a MAC protocol called GMAC, which assumes that nodes know the geographic positions of their two-hop neighborhood and exploit this knowledge to construct a TDMA schedule. The schedule can be computed locally, no negotiation phase (and thus, no additional traffic) is needed. Additionally, GMAC guarantees a maximum delay per node which makes it suitable for data with real-time constraints. Further, GMAC allows nodes to dynamically utilize time slots assigned to but not used by neighbor nodes. Finally, it permits nodes to sleep when they are not involved in communication, thus greatly reducing energy consumption.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984490","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}