{"title":"A comparison between the PoolODMRP and the PatchODMRP","authors":"Cai Shaobin, Y. Xiaozong, Yao Wenbin","doi":"10.1109/ICON.2003.1266277","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266277","url":null,"abstract":"Abstrocf-As a new Ad Hoc multicast protocol, the PoolODMRF' defines pool nodes, which aren't forwarding nodes, however, can receive data, to collect route information from their received data, and to know which sources they are connected to. In the PoolODMRP, when a forwarding node detects that a link failure results in its failure to receive data from some sources, it sends out a Local Query. Each neighbor of it checks whether it connects to the sources defined in the Local Query. If it does, the neighbor answers with a Local Reply. The forwarding node selects the neighbor that connects to the sources earliest, and informs it to be a forwarding node. In this way, PoolODMRP can realize one-hop local recovery. The simulation results show that its data deliver ratio is similar to that of PatchODMRP 111, but its local control overhead is 19.2% of that of PatchODMRP, its control overhead is only 41.2% of that of PatchODMRF', and its data overhead is only 64.7% of that of PatchODMP.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117255357","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":"Exploiting multi path routing to achieve service differentiation in sensor networks","authors":"N. Jain, Dilip K. Madathil, D. Agrawal","doi":"10.1109/ICON.2003.1266269","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266269","url":null,"abstract":"","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127353165","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":"Soft per-flow throughput guarantees in contention based WLANs","authors":"A. Nyandoro, Prawit Chumchu, Mahbub Hassan","doi":"10.1109/ICON.2003.1266265","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266265","url":null,"abstract":"The mandatory Medium Access Control(MAC) protocol for 802.11 wireless local area networks (WLANs) does not provide hard throughput guarantees for flows with strict throughput requirements because it is contention based. However its universal implementation by 802.11 equipment vendors is testimony to its popularity. Doe to this large installed base, there are potentially great benefits to the user base if improvements are made to the WLAN protocols to at least provide soft per flow throughput guarantees. Accordingly, this paper proposes some improvements to infrastructure WLANs for this purpose. The improvements are mainly at the Access Point (AP) in the form of per flow queues for real-time (RT), Weighted Fair Queueing (WFQ) scheduling and a new Contention Window(CW) adjustment algorithm. The AP will also perform rate estimation for admission control. Simulation results show that the CW adjustment algorithm is resilient even under saturation conditions. A simple traffic measurement technique we propose however guards against saturation conditions occurring.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123787637","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":"Branch label based probabilistic packet marking for IP traceback","authors":"Toshiaki Ogawa, F. Nakamura, Y. Wakahara","doi":"10.1109/ICON.2003.1266235","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266235","url":null,"abstract":"AbstructDistributed Denial-of-Services (DDoS) attacks have been one of the most serious security issues. DDoS attacks disable legitimate services on victim hosts by flooding packet flows to the hosts from a lot of different compromised hosts. I t i s considered the most effective mitigation to f i l ter the attacking packet flows at the router interfaces closest to the attackers. Precise identilieation of these interfaces i s a key poinL Edge Sample (ES) based Probabilistic Packet Marking (PPM) is an encouraging method to cope with source 1p spoofing, a popular identifieation jamming, which usually accompany DDoS attacks. But its fragmentation of path information leads to inefficiency in terms of necessarv number of oackets. oath calculation h e and _ _ identilicatinn accuracy. We Drowse BranchLahe1 (BL) based PPM to solve the above . . inefficiency pruhlem. I n HI., a single path infurmatinn is marked in a packet without fragmentation in conIra4 tn ES h a d P P M 'The \"hole palh inrurmativn in packets hy the HL appruarh i s expressed nilh branch information uf each muler interfaces. This hrin&? the folluuing three he) advantages in the pnrew of detecting the interfaces: quick increaw in (rue-pmilives detected (efficiencyl, quick dcCred.w in false-negatives detrrted (accuracy) and fast convergence (quickncs).","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115559457","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":"New methods for lost voice packet recovery in active networks","authors":"Y. Darmani, L. White, M. Liebelt","doi":"10.1109/ICON.2003.1266167","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266167","url":null,"abstract":"This paper presents two new voice-packing schemes based on speech properties for voice over Internet protocol. Those methods aim to reduce the speech quality degradation caused by packet losses. They provide feasibility of regenerating lost voice packets within the network in active nodes. We argue that in a very lossy network, the receiver cannot cope with all effects of lost packets and the voice has poor quality. The two proposed methods could help regenerate lost packets in an active network to improve the perceptual quality of sound. These schemes are evaluated by simulating a very lossy network with adjustable drop rate. The experiments showed that the regenerated voice has much better quality compared with the other compensating techniques even under more than 35% packet loss rate.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121934361","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":"Similarity models for Internet host location","authors":"A. Ziviani, S. Fdida, J. Rezende, O. Duarte","doi":"10.1109/ICON.2003.1266171","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266171","url":null,"abstract":"A whole new class of location-aware services may be envisaged by the deployment of a geographic location service for Internet hosts. We focus on a technique that relies on delay measurements and the exploitation of a possible correlation between geographic distance and network delay. Our investigation shows that such a correlation becomes stronger as connectivity becomes richer. Host locations are inferred by comparing delay patterns of geographically distributed landmarks (hosts with a known geographic location) with the delay pattern of the target host to be located. The problem we deal with is how to best measure the similarity between the delay patterns of the landmarks and the one observed for the target host. The location estimation of the target host is the location of the landmark that presents the most similar delay pattern with respect to the one of the target host. We define and evaluate three similarity models. Experiments show that the previously adopted Euclidean distance is outperformed by other similarity models, resulting in a more accurate Internet host location from delay measurements.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128748675","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":"Packet scheduling in input - queued switches with a speedup of less than two","authors":"C. Bauer","doi":"10.1109/ICON.2003.1266229","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266229","url":null,"abstract":"Input queued switches and the solution of input/output contention by scheduling algorithms have been widely investigated. Most research has focused on fixed-she packets. This contrasts with the variable size of ~p networks. In this ~ a ~ e r . we investieate how the elass of a speedup of S,S 2 1, if it works at a speed s times faster than the speed of the input links. The less cornPlex and with regard to a chosen metric less Optimal maximal matching algorithms have been widely researched . . I maximal matching algorithms deployed in switches with a speedup of less than two can he modified to take into account the varying packet sizes. Using a novel model for the dynamics of maximal matching algorithms, we show that modified maximal matching algorithms guarantee stability of the switch and establish bounds on the average delay experienced by a packet.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126252049","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 dynamic load sharing algorithm for massively multiplayer online games","authors":"T. Duong, Suiping Zhou","doi":"10.1109/ICON.2003.1266179","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266179","url":null,"abstract":"To support hundreds of thousands of players in massively multiplayer online games, a distributed client-server architecture is widely used in which multiple servers are deployed and each server handles a partition of the virtual world. Because of the unpredictable movements and interactions of avatars, the concentration of avatars in some regions of the virtual world may cause some servers be overloaded. Existing load balancing schemes for distributed virtual environments and multiplayer games try to balance the workload among servers by transferring some workload of an overloaded server to other servers. While load balancing algorithms can minimize the average response time of the system, they may also result in frequent client migrations, which may damage the interactivity of an online game. In this paper, we propose a dynamic load sharing algorithm together with an efficient client migration scheme based on the concept of subscription regions. Simulation study has also been done to verify the effectiveness of our scheme.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133897020","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":"Counteracting DDoS attacks in multiple ISP domains using routing arbiter architecture","authors":"U. Tupakula, V. Varadharajan","doi":"10.1109/ICON.2003.1266233","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266233","url":null,"abstract":"Today Distributed Denial of Service (DDoS) attacks are causing major threat to perform online business over the Internet. Our previous work proposed an automated model with a new packet marking technique and agent design to counteract DDoS within a single ISP domain. Our approach has many features that are required to minimize the DDoS attacks. For example, our model is invoked only during attack times, identifies the approximate source of attack with a single packet even in case of spoofed source address, identifies different attack signatures for different attacking sources, prevents the attack nearest to the attacking source, has very fast response for any changes in attack traffic pattern, is simple in its implementation and can be incrementally deployed. Though the proposed model has several advantages, prevention of the attack is limited to a single ISP domain. In this paper we extend our model to prevent DDoS attacks in multiple ISP domains by retaining all the advantages achieved in our previous work. We also propose a practical implementation of the extended model with a presently working architecture.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"27 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131575125","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":"Transporting multiple classes of traffic over a generic routing device - an investigation into the performance of the RapidIO/spl trade/ interconnect architecture","authors":"M. McKenny, J. Dines, D. Harle","doi":"10.1109/ICON.2003.1266164","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266164","url":null,"abstract":"RapidIO/spl trade/ is a pseudo-serial, source-synchronous, point-to-point interconnect which enables reliable, high-speed intra-system communication. The RapidIO physical layer utilises low-voltage differential signaling (LVDS) pairs that interconnect RapidIO link partners belonging to end-points or central switch fabrics. The following is an investigation into the performance of the RapidIO architecture when deployed as the interconnection between the components of a generic switch device. A discrete event simulation model of such a system has been developed enabling various compositions of traffic to be offered to the device. Extensive simulations have enabled a quantitative analysis of various performance metrics that indicate how the device deals with various classes of traffic under saturating and non-saturating aggregate traffic loads. The results therefore provide an insight into the general performance capabilities of the RapidIO architecture as a transport protocol as well as outlining some specific issues regarding implementing RapidIO to interconnect components of a generic switch device.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131589368","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}