In this paper, we analyze the common problems of link state routing protocols along with an evolution of the Optimized Link State Routing protocol, called BATMAN. BATMAN uses a weighted and auto-selective flooding which makes it a sort of gossip protocol. The flooding uses short control packets to make every mesh node aware of network topology. However, there is no topology information dissemination and no multi-point relaying node selection. While routing loops are easily avoided by this modified flooding mechanism, there are still problems about self-interference. Due the broadcast nature of the radio channel, traffic data can disturb control data, and localized control data may cause interference on neighboring control data as well. In fact there is a complicated interaction between MAC and routing protocols. We demonstrate this fact by extensive field tests carried out by our measurement framework based on statistical tests. In particular, we show that the so called hop horizon of multi-hop network can be due to the routing and MAC protocols. These analysis can be a useful hint for the design of more intelligent routing, or rather a less cross-layer dependence of protocols.
{"title":"A BAT in the Lab: Experimental Results of New Link State Routing Protocol","authors":"Makoto Ikeda, G. Marco, L. Barolli, M. Takizawa","doi":"10.1109/AINA.2008.60","DOIUrl":"https://doi.org/10.1109/AINA.2008.60","url":null,"abstract":"In this paper, we analyze the common problems of link state routing protocols along with an evolution of the Optimized Link State Routing protocol, called BATMAN. BATMAN uses a weighted and auto-selective flooding which makes it a sort of gossip protocol. The flooding uses short control packets to make every mesh node aware of network topology. However, there is no topology information dissemination and no multi-point relaying node selection. While routing loops are easily avoided by this modified flooding mechanism, there are still problems about self-interference. Due the broadcast nature of the radio channel, traffic data can disturb control data, and localized control data may cause interference on neighboring control data as well. In fact there is a complicated interaction between MAC and routing protocols. We demonstrate this fact by extensive field tests carried out by our measurement framework based on statistical tests. In particular, we show that the so called hop horizon of multi-hop network can be due to the routing and MAC protocols. These analysis can be a useful hint for the design of more intelligent routing, or rather a less cross-layer dependence of protocols.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121866631","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 paper, we propose an overlay network supporting world-wide geographic messaging. Our approach is based on hierarchical symbolic coordinates like /usa/fl/miami/. Although hierarchical network topologies lend themselves to the implementation of such overlay networks, they may lead to bottlenecks at the root of the hierarchy, long message paths, and inefficient bandwidth utilization. To avoid these problems, we propose an overlay network that adapts its structure to the users' communication patterns by dynamically adding "shortcut" links to the hierarchy leading to a routing mesh. We present an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand. Through simulations we show that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.
{"title":"An Adaptive Overlay Network for World-Wide Geographic Messaging","authors":"Frank Dürr, K. Rothermel","doi":"10.1109/AINA.2008.67","DOIUrl":"https://doi.org/10.1109/AINA.2008.67","url":null,"abstract":"In this paper, we propose an overlay network supporting world-wide geographic messaging. Our approach is based on hierarchical symbolic coordinates like /usa/fl/miami/. Although hierarchical network topologies lend themselves to the implementation of such overlay networks, they may lead to bottlenecks at the root of the hierarchy, long message paths, and inefficient bandwidth utilization. To avoid these problems, we propose an overlay network that adapts its structure to the users' communication patterns by dynamically adding \"shortcut\" links to the hierarchy leading to a routing mesh. We present an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand. Through simulations we show that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123884568","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}
Osama Al-Jaber, L. Guan, X. Wang, I. Awan, A. Grigg, Xuefen Chi
Delay is arguably one of the most vital Quality of Service (QoS) metrics in computer networks since it has many implications for real time multimedia applications. The congestion and queuing delay of Internet core routers is one of the most important fundamental research topics which plays a vital role in determination of the overall end-to-end delay. In previous works, the control algorithm proposed and modelled in the discrete-time domain, by controlling the value of the threshold within the queue buffer to achieve the required delay, is based on a single arrival in one time slot. In this paper, a new traffic model with the ability to capture the multiple arrivals in a single time slot is described and its application for restraining the delay to a pre-defined value within the network core router is developed. The feasibility of the system is examined using both theoretical analysis and simulation. A statistical evaluation is performed to show both efficiency and accuracy of the results acquired throughout the simulation.
{"title":"Delay Restraining of Combined Multiple Input Cross Core Router","authors":"Osama Al-Jaber, L. Guan, X. Wang, I. Awan, A. Grigg, Xuefen Chi","doi":"10.1109/AINA.2008.115","DOIUrl":"https://doi.org/10.1109/AINA.2008.115","url":null,"abstract":"Delay is arguably one of the most vital Quality of Service (QoS) metrics in computer networks since it has many implications for real time multimedia applications. The congestion and queuing delay of Internet core routers is one of the most important fundamental research topics which plays a vital role in determination of the overall end-to-end delay. In previous works, the control algorithm proposed and modelled in the discrete-time domain, by controlling the value of the threshold within the queue buffer to achieve the required delay, is based on a single arrival in one time slot. In this paper, a new traffic model with the ability to capture the multiple arrivals in a single time slot is described and its application for restraining the delay to a pre-defined value within the network core router is developed. The feasibility of the system is examined using both theoretical analysis and simulation. A statistical evaluation is performed to show both efficiency and accuracy of the results acquired throughout the simulation.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125392167","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}
V. G. D. Oliveira, J. Farkas, M. Salvador, G. Santos
Ethernet is becoming increasingly popular in metro and access networks due to the high bandwidth available at low cost. Nonetheless, native Ethernet lacks some features that are important for sophisticated network management; providing accurate knowledge on the physical topology is one of them. Therefore, automatic physical topology discovery in support of network management is essential in Ethernet networks. Former work either focused on Layer-3 topology discovery or only provided the active topology excluding the physical links inactivated by rapid spanning tree protocol. This paper introduces a novel mechanism capable of automatically discovering the entire physical topology of Ethernet networks. Our algorithm collects information available even in low-cost off- the-shelf Ethernet switches and then calculates the physical topology of the entire network. This paper describes the method and its implementation in a testbed network for assessing the performance and the robustness of the mechanism.
{"title":"Automatic Discovery of Physical Topology in Ethernet Networks","authors":"V. G. D. Oliveira, J. Farkas, M. Salvador, G. Santos","doi":"10.1109/AINA.2008.95","DOIUrl":"https://doi.org/10.1109/AINA.2008.95","url":null,"abstract":"Ethernet is becoming increasingly popular in metro and access networks due to the high bandwidth available at low cost. Nonetheless, native Ethernet lacks some features that are important for sophisticated network management; providing accurate knowledge on the physical topology is one of them. Therefore, automatic physical topology discovery in support of network management is essential in Ethernet networks. Former work either focused on Layer-3 topology discovery or only provided the active topology excluding the physical links inactivated by rapid spanning tree protocol. This paper introduces a novel mechanism capable of automatically discovering the entire physical topology of Ethernet networks. Our algorithm collects information available even in low-cost off- the-shelf Ethernet switches and then calculates the physical topology of the entire network. This paper describes the method and its implementation in a testbed network for assessing the performance and the robustness of the mechanism.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125551019","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 reliability of communication and sensor devices has been recognized as one of the crucial issues in Wireless Sensor Networks (WSNs). In distributed environments, micro-sensors are subject to high-frequency faults. To provide high stability and availability of large scale sensor networks, we propose a fault inference mechanism based on reverse multicast tree to evaluate sensor nodes' fault probabilities. This mechanism is formulated as maximization-likelihood estimation problem. Due to the characteristics (energy awareness, constraint bandwidth and so on) of wireless sensor networks; it is infeasible for each sensor to announce its working state to a centralized node. Therefore, maximum likelihood estimates of fault parameters depend on unobserved latent variables. Hence, our proposed inference mechanism is abstracted as Nondeterministic Finite Automata (NFA). It adopts iterative computation under Markov Chain to infer the fault probabilities of nodes in reverse multicast tree. Through our theoretical analysis and simulation experiments, we were able to achieve an accuracy of fault inference mechanism that satisfies the necessity of fault detection.
{"title":"A Fault Inference Mechanism in Sensor Networks Using Markov Chain","authors":"E. Shakshuki, Xinyu Xing","doi":"10.1109/AINA.2008.36","DOIUrl":"https://doi.org/10.1109/AINA.2008.36","url":null,"abstract":"The reliability of communication and sensor devices has been recognized as one of the crucial issues in Wireless Sensor Networks (WSNs). In distributed environments, micro-sensors are subject to high-frequency faults. To provide high stability and availability of large scale sensor networks, we propose a fault inference mechanism based on reverse multicast tree to evaluate sensor nodes' fault probabilities. This mechanism is formulated as maximization-likelihood estimation problem. Due to the characteristics (energy awareness, constraint bandwidth and so on) of wireless sensor networks; it is infeasible for each sensor to announce its working state to a centralized node. Therefore, maximum likelihood estimates of fault parameters depend on unobserved latent variables. Hence, our proposed inference mechanism is abstracted as Nondeterministic Finite Automata (NFA). It adopts iterative computation under Markov Chain to infer the fault probabilities of nodes in reverse multicast tree. Through our theoretical analysis and simulation experiments, we were able to achieve an accuracy of fault inference mechanism that satisfies the necessity of fault detection.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126333405","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}
Sooyong Lee, Myungchul Kim, Kyunghee Lee, Soonuk Seol, Gabsoo Lee
Providing seamless multimedia services to mobile users is one of the important requirements for the current Internet evolution. However, due to the effects of host mobility, it is difficult to achieve seamless QoS guarantees in mobile Internet. Though Next Step In Signaling (NSIS) protocol was recently proposed as an alternative of RSVP, its applicability has not been completely verified particularly in mobile environment. This paper enhances NSIS protocol based on advance resource reservation using layers 2 and 3 complementation for supporting host mobility. Our approach detects a crossover node (CRN) and reserves network resources proactively along the new path which will be used after handoff This significantly reduces the latency of signaling session re-establishment caused by handoff. Only a few modifications are required to the current NSIS protocol for our approach. The experimental results demonstrate that our approach can provide seamless QoS guarantees for multimedia services in mobile Internet.
{"title":"Seamless QoS Guarantees in Mobile Internet Using NSIS with Advance Resource Reservation","authors":"Sooyong Lee, Myungchul Kim, Kyunghee Lee, Soonuk Seol, Gabsoo Lee","doi":"10.1109/AINA.2008.110","DOIUrl":"https://doi.org/10.1109/AINA.2008.110","url":null,"abstract":"Providing seamless multimedia services to mobile users is one of the important requirements for the current Internet evolution. However, due to the effects of host mobility, it is difficult to achieve seamless QoS guarantees in mobile Internet. Though Next Step In Signaling (NSIS) protocol was recently proposed as an alternative of RSVP, its applicability has not been completely verified particularly in mobile environment. This paper enhances NSIS protocol based on advance resource reservation using layers 2 and 3 complementation for supporting host mobility. Our approach detects a crossover node (CRN) and reserves network resources proactively along the new path which will be used after handoff This significantly reduces the latency of signaling session re-establishment caused by handoff. Only a few modifications are required to the current NSIS protocol for our approach. The experimental results demonstrate that our approach can provide seamless QoS guarantees for multimedia services in mobile Internet.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128225350","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 National Institute of Informatics (NIL) is promoting the construction of the Cyber Science Infrastructure (CSI) through cooperation and other organizations, in order to promote Japan's academic and research educational activities and to further strengthen international competitiveness. This talk presents the Nil's strategic efforts to the following four areas, as expanding the various development projects and operations it has implemented to date within the framework of the CSI.
{"title":"Cyber Science Infrastructure (CSI) for Promoting Research Activities of Academia and Industries in Japan","authors":"S. Yamada","doi":"10.1109/AINA.2008.157","DOIUrl":"https://doi.org/10.1109/AINA.2008.157","url":null,"abstract":"The National Institute of Informatics (NIL) is promoting the construction of the Cyber Science Infrastructure (CSI) through cooperation and other organizations, in order to promote Japan's academic and research educational activities and to further strengthen international competitiveness. This talk presents the Nil's strategic efforts to the following four areas, as expanding the various development projects and operations it has implemented to date within the framework of the CSI.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296628","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 critical requirement on reliability, fault-tolerance and security of network devices highlights the necessity of protocol robustness testing. Mutation testing of protocol messages is an important part of robustness testing, but related theory and practices are not well developed. This paper builds a NFSM model for mutation testing of protocol messages and proposes two types of normal-verification sequence to enhance verdict mechanism. For single-field mutation testing of protocol messages, we propose the concept of compound anomalous test case to further simplify test sequences. As a standard test specification language, TTCN-3 reveals strong excellence in conformance testing, so we apply TTCN-3 to mutation testing and extend it according to test requirements. Using our method we test OSPFv2 sufficiently with a test system based on extended TTCN-3. The results indicate that our method has good capability of error-finding.
{"title":"Mutation Testing of Protocol Messages Based on Extended TTCN-3","authors":"Chuanming Jing, Zhiliang Wang, Xingang Shi, Xia Yin, Jianping Wu","doi":"10.1109/AINA.2008.98","DOIUrl":"https://doi.org/10.1109/AINA.2008.98","url":null,"abstract":"The critical requirement on reliability, fault-tolerance and security of network devices highlights the necessity of protocol robustness testing. Mutation testing of protocol messages is an important part of robustness testing, but related theory and practices are not well developed. This paper builds a NFSM model for mutation testing of protocol messages and proposes two types of normal-verification sequence to enhance verdict mechanism. For single-field mutation testing of protocol messages, we propose the concept of compound anomalous test case to further simplify test sequences. As a standard test specification language, TTCN-3 reveals strong excellence in conformance testing, so we apply TTCN-3 to mutation testing and extend it according to test requirements. Using our method we test OSPFv2 sufficiently with a test system based on extended TTCN-3. The results indicate that our method has good capability of error-finding.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127101308","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}
An enormous amount of data needs to be processed in many data mining applications. In addition to algorithmic development, hardware support is imperative to improve the effectiveness and efficiency of these applications. We are investigating various hardware architectural design techniques and methodologies to support data mining at the chip level. In this work, we focus on the design of an FPGA-based processor array for the computation of similarity matrix, a commonly used data structure to represent the similarity among a set of feature vectors, with each matrix element representing the computed similarity measure between two vectors. An algorithm is developed to assign computation efficiently to the array of processing elements. Theoretical performance metrics are derived and compared to the experimental results. Performance gains using the processor array over software implementations are also presented and discussed.
{"title":"Parallel Computation of Similarity Measures Using an FPGA-Based Processor Array","authors":"D. Perera, K. F. Li","doi":"10.1109/AINA.2008.97","DOIUrl":"https://doi.org/10.1109/AINA.2008.97","url":null,"abstract":"An enormous amount of data needs to be processed in many data mining applications. In addition to algorithmic development, hardware support is imperative to improve the effectiveness and efficiency of these applications. We are investigating various hardware architectural design techniques and methodologies to support data mining at the chip level. In this work, we focus on the design of an FPGA-based processor array for the computation of similarity matrix, a commonly used data structure to represent the similarity among a set of feature vectors, with each matrix element representing the computed similarity measure between two vectors. An algorithm is developed to assign computation efficiently to the array of processing elements. Theoretical performance metrics are derived and compared to the experimental results. Performance gains using the processor array over software implementations are also presented and discussed.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127213816","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 proposes a method that acquires a more appropriate classification model for label extraction. The model can extract specific labels from articles included in bulletin board sites. The labels represent the contents of the articles and are used to characterize the articles. The method selects two kinds of important examples not including a specific label by using expressions related to the label. The method inductively acquires the classification model from the selected examples and examples including the label. The paper applies the method to articles collected from three bulletin board sites and verifies its effect through comparative experiments.
{"title":"Classification Model Learning for Bulletin Board Site Analysis Based on Unbalanced Textual Examples","authors":"S. Sakurai, R. Orihara","doi":"10.1109/AINA.2008.57","DOIUrl":"https://doi.org/10.1109/AINA.2008.57","url":null,"abstract":"This paper proposes a method that acquires a more appropriate classification model for label extraction. The model can extract specific labels from articles included in bulletin board sites. The labels represent the contents of the articles and are used to characterize the articles. The method selects two kinds of important examples not including a specific label by using expressions related to the label. The method inductively acquires the classification model from the selected examples and examples including the label. The paper applies the method to articles collected from three bulletin board sites and verifies its effect through comparative experiments.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133529843","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
扫码关注我们
求助内容：
应助结果提醒方式：