Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210188
P. Brutch, C. Ko
This paper presents a brief survey of current research in intrusion detection for wireless ad-hoc networks. In addition to examining the challenges of providing intrusion detection in this environment, this paper reviews current efforts to detect attacks against the ad-hoc routing infrastructure, as well as detecting attacks directed against the mobile nodes. This paper also examines the intrusion detection architectures that may be deployed for different wireless ad-hoc network infrastructures, as well as proposed methods of intrusion response.
{"title":"Challenges in intrusion detection for wireless ad-hoc networks","authors":"P. Brutch, C. Ko","doi":"10.1109/SAINTW.2003.1210188","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210188","url":null,"abstract":"This paper presents a brief survey of current research in intrusion detection for wireless ad-hoc networks. In addition to examining the challenges of providing intrusion detection in this environment, this paper reviews current efforts to detect attacks against the ad-hoc routing infrastructure, as well as detecting attacks directed against the mobile nodes. This paper also examines the intrusion detection architectures that may be deployed for different wireless ad-hoc network infrastructures, as well as proposed methods of intrusion response.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132027277","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210169
Masatoshi Kakiuchi, N. Morishima, Yutaka Nakamura, K. Fujikawa, H. Sunahara
With the advance of computing and internetworking technologies, various services, which need classification of data, are provided. Firewall and QoS control are typical services which classify the data flow. These services are based on two or more rules, and select a rule to classify the data. However, some of their rules may conflict with one another and it is necessary to resolve conflicts in these classification mechanisms. We discuss the classification of data with generalization of the parameter filter. Then we arrange the parameter filter and propose a 2-phase selection model of classification records. In this model, we consider the procedure of the parameter filter as the phase depending only on the schema of the filter rule and the phase depending on the service. We also implement the KUPF framework based on this model and a sample service which provides QoS control over a IPv4/IPv6 network. With this sample implementation, we validate the availability and evaluate the performance of KUPF.
{"title":"KUPF: 2-phase selection model of classification records","authors":"Masatoshi Kakiuchi, N. Morishima, Yutaka Nakamura, K. Fujikawa, H. Sunahara","doi":"10.1109/SAINTW.2003.1210169","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210169","url":null,"abstract":"With the advance of computing and internetworking technologies, various services, which need classification of data, are provided. Firewall and QoS control are typical services which classify the data flow. These services are based on two or more rules, and select a rule to classify the data. However, some of their rules may conflict with one another and it is necessary to resolve conflicts in these classification mechanisms. We discuss the classification of data with generalization of the parameter filter. Then we arrange the parameter filter and propose a 2-phase selection model of classification records. In this model, we consider the procedure of the parameter filter as the phase depending only on the schema of the filter rule and the phase depending on the service. We also implement the KUPF framework based on this model and a sample service which provides QoS control over a IPv4/IPv6 network. With this sample implementation, we validate the availability and evaluate the performance of KUPF.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123898223","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210172
K. Itai, A. Takasu, J. Adachi
We propose a method for transforming HTML tables that have different structures into a common XML list structure and integrating them. This integration enables us to browse and compare all information in separate HTML pages uniformly. This paper focuses on the tasks of information extraction from tables and its data categorization. For this purpose, we compare three algorithms: (I) data classification using a support vector machine, (II) table structure estimation and data categorization using a hidden Markov model, and (III) data classification by the combination of a support vector machine and hidden Markov model. Finally, we report the experimental results.
{"title":"Information extraction from HTML pages and its integration","authors":"K. Itai, A. Takasu, J. Adachi","doi":"10.1109/SAINTW.2003.1210172","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210172","url":null,"abstract":"We propose a method for transforming HTML tables that have different structures into a common XML list structure and integrating them. This integration enables us to browse and compare all information in separate HTML pages uniformly. This paper focuses on the tasks of information extraction from tables and its data categorization. For this purpose, we compare three algorithms: (I) data classification using a support vector machine, (II) table structure estimation and data categorization using a hidden Markov model, and (III) data classification by the combination of a support vector machine and hidden Markov model. Finally, we report the experimental results.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115702949","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210142
I. Takahashi
In Japan, "Personal Data Protection Bill" and "Law concerning Protection of Personal Data possessed by Administrative Organizations" were discussed in the Diets in 2002. Both bills failed to pass in the Diet. They will be discussed in the Diets in 2003 again. I can point out some problems involved in bills such as "data possessed in public organizations" International Aspects" "Enforcement" "Ambiguous status of rights of the data subjects" in comparing both bills with UK Data Protection Act 1998.
{"title":"A comparative study of Personal Data Protection Bill in Japan with UK Data Protection Act 1998","authors":"I. Takahashi","doi":"10.1109/SAINTW.2003.1210142","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210142","url":null,"abstract":"In Japan, \"Personal Data Protection Bill\" and \"Law concerning Protection of Personal Data possessed by Administrative Organizations\" were discussed in the Diets in 2002. Both bills failed to pass in the Diet. They will be discussed in the Diets in 2003 again. I can point out some problems involved in bills such as \"data possessed in public organizations\" International Aspects\" \"Enforcement\" \"Ambiguous status of rights of the data subjects\" in comparing both bills with UK Data Protection Act 1998.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"24 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121012637","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210122
Hidetaka Izumiyama, H. Kusumoto
This paper summarizes the advantage of satellite communication in order to build a wide-coverage broadcast IP network in conjunction with the Internet. Taking various technical factors into consideration, the broadcast IP network has been designed and built in the Asia Pacific region by using an existing satellite. Details such as those regarding broadcast capable datalink technology, Earth station composition, satellite link budget (calculation of carrier-noise ratio margin), and IP and TCP performance are illustrated. This paper also discusses operational experiments conducted on the network exemplified by a vehicle for providing new distance education, and demonstrates the feasibility of practical use of the broadcast IP network using a unidirectional satellite link.
{"title":"Implementation and operation of a satellite-based broadcast IP network","authors":"Hidetaka Izumiyama, H. Kusumoto","doi":"10.1109/SAINTW.2003.1210122","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210122","url":null,"abstract":"This paper summarizes the advantage of satellite communication in order to build a wide-coverage broadcast IP network in conjunction with the Internet. Taking various technical factors into consideration, the broadcast IP network has been designed and built in the Asia Pacific region by using an existing satellite. Details such as those regarding broadcast capable datalink technology, Earth station composition, satellite link budget (calculation of carrier-noise ratio margin), and IP and TCP performance are illustrated. This paper also discusses operational experiments conducted on the network exemplified by a vehicle for providing new distance education, and demonstrates the feasibility of practical use of the broadcast IP network using a unidirectional satellite link.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128042333","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210186
R. Henning
Wireless access points bring great convenience to the enterprise network, and also bring a large collection of vulnerabilities into the enterprise environment. Wireless users pose new difficulties in authentication and confidentiality that can intentionally or inadvertently pose a threat to their wired colleagues. A comprehensive network vulnerability analysis must address wireless environment threats and vulnerabilities, including identification of unauthorized Wireless Access Points and incorrectly configured clients. This paper discusses the issues associated with vulnerability assessment in a wireless network and a recommended approach to integrating wireless devices into vulnerability scanning methodologies.
{"title":"Vulnerability assessment in wireless networks","authors":"R. Henning","doi":"10.1109/SAINTW.2003.1210186","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210186","url":null,"abstract":"Wireless access points bring great convenience to the enterprise network, and also bring a large collection of vulnerabilities into the enterprise environment. Wireless users pose new difficulties in authentication and confidentiality that can intentionally or inadvertently pose a threat to their wired colleagues. A comprehensive network vulnerability analysis must address wireless environment threats and vulnerabilities, including identification of unauthorized Wireless Access Points and incorrectly configured clients. This paper discusses the issues associated with vulnerability assessment in a wireless network and a recommended approach to integrating wireless devices into vulnerability scanning methodologies.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125105345","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210127
S. Ramadass, R. Budiarto, V. Siva
Videoconferencing has always been associated with deterministic networks or circuit switched networks (physical or virtual). In the past, it was almost unthinkable to send voice and video over an undeterministic network like Ethernet. However, recent trends in the field of multimedia communications (audio, video and documents) have indicated that it is not only possible but also practical to carry such communications over Ethernet. The MCS (Multimedia Conferencing System) which was recently developed and implemented by the Network Research Group, School of Computer Sciences, USM is a full blown audio, video and document conferencing system that works on classical Ethernet as well as satellite networks using the RSW Control Criteria. This paper discusses the bandwidth requirements of using the MCS system on satellite-based networks.
{"title":"Satellite bandwidth requirements for an MCS based multimedia conference","authors":"S. Ramadass, R. Budiarto, V. Siva","doi":"10.1109/SAINTW.2003.1210127","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210127","url":null,"abstract":"Videoconferencing has always been associated with deterministic networks or circuit switched networks (physical or virtual). In the past, it was almost unthinkable to send voice and video over an undeterministic network like Ethernet. However, recent trends in the field of multimedia communications (audio, video and documents) have indicated that it is not only possible but also practical to carry such communications over Ethernet. The MCS (Multimedia Conferencing System) which was recently developed and implemented by the Network Research Group, School of Computer Sciences, USM is a full blown audio, video and document conferencing system that works on classical Ethernet as well as satellite networks using the RSW Control Criteria. This paper discusses the bandwidth requirements of using the MCS system on satellite-based networks.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761058","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210178
M. Nakayama, Hiroyuki Ohno
This paper describes an overview of the IAA (I Am Alive) system, which was originally developed in the WIDE project from 1995, and its current status. The IAA system is a distributed database system which contains victims' safety information. When a disaster occurs, victims can register their safety status information to the database and anyone who knows the victim's name can check his/her situation at any time. The IAA system has many user interfaces to accept any kind of user requests, e.g. Web client interface, windows client interface, fax interface using OCR/OMR, phone interface using DTMF tone and i-mode mobile phone interface. The IAA system also consists of many database nodes called "IAA clusters" to avoid paralysis of the system and network from a huge number of simultaneous requests. IAA clusters are located at deferent places and users' requests are distributed among them. All IAA clusters are loosely coupled by the IAA transport mechanism and synchronize victim information among them. In 1998, a prototype implementation was developed, so victim data format and request/response format between the client program and IAA cluster was established. Many organizations started to develop other implementations of the IAA system such as the CRL-IAA system, Monster-IAA system and NetStar-IAA system. The IAA Alliance was organized in 2002 to examine interoperability of these implementations and exchange information between developers. This organization also introduces the IAA system to many organizations including local government and gathers feedback from them to developers. We also introduce activity of this organization briefly.
本文介绍了IAA (I Am Alive)系统的概况，该系统最初是在1995年的WIDE项目中开发的，以及它的现状。IAA系统是一个包含受害者安全信息的分布式数据库系统。当灾难发生时，受害者可以将他们的安全状态信息登记到数据库中，任何知道受害者名字的人都可以随时查看他/她的情况。IAA系统具有多种用户接口，可接受各种用户请求，如Web客户端接口、windows客户端接口、使用OCR/OMR的传真接口、使用DTMF音的电话接口和i-mode手机接口等。IAA系统还由许多称为“IAA集群”的数据库节点组成，以避免系统和网络因大量同时请求而瘫痪。IAA集群分布在不同的地方，用户的请求分布在不同的集群之间。所有IAA集群通过IAA传输机制松散耦合，并在它们之间同步受害者信息。1998年，开发了一个原型实现，建立了客户端程序与IAA集群之间的受害者数据格式和请求/响应格式。许多组织开始开发IAA系统的其他实现，如CRL-IAA系统、Monster-IAA系统和NetStar-IAA系统。IAA联盟成立于2002年，目的是检查这些实现的互操作性，并在开发人员之间交换信息。该组织还向包括地方政府在内的许多组织介绍IAA系统，并收集他们向开发人员提供的反馈。我们还简要介绍了该组织的活动。
{"title":"Current status of IAA (I Am Alive) system and IAA alliance","authors":"M. Nakayama, Hiroyuki Ohno","doi":"10.1109/SAINTW.2003.1210178","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210178","url":null,"abstract":"This paper describes an overview of the IAA (I Am Alive) system, which was originally developed in the WIDE project from 1995, and its current status. The IAA system is a distributed database system which contains victims' safety information. When a disaster occurs, victims can register their safety status information to the database and anyone who knows the victim's name can check his/her situation at any time. The IAA system has many user interfaces to accept any kind of user requests, e.g. Web client interface, windows client interface, fax interface using OCR/OMR, phone interface using DTMF tone and i-mode mobile phone interface. The IAA system also consists of many database nodes called \"IAA clusters\" to avoid paralysis of the system and network from a huge number of simultaneous requests. IAA clusters are located at deferent places and users' requests are distributed among them. All IAA clusters are loosely coupled by the IAA transport mechanism and synchronize victim information among them. In 1998, a prototype implementation was developed, so victim data format and request/response format between the client program and IAA cluster was established. Many organizations started to develop other implementations of the IAA system such as the CRL-IAA system, Monster-IAA system and NetStar-IAA system. The IAA Alliance was organized in 2002 to examine interoperability of these implementations and exchange information between developers. This organization also introduces the IAA system to many organizations including local government and gathers feedback from them to developers. We also introduce activity of this organization briefly.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949514","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210133
Justin O'Sullivan, D. Edmond
An understanding of the temporal and locative constraints surrounding a service are important for interacting with it. These constraints apply to both the service requestor and the service provider. We discuss service interactions including the less common ones of cancellation, suspension and resumption. We then discuss various kinds of temporal windows and argue for certain locative constraints.
{"title":"When and where is a service? Investigating temporal and locative service properties","authors":"Justin O'Sullivan, D. Edmond","doi":"10.1109/SAINTW.2003.1210133","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210133","url":null,"abstract":"An understanding of the temporal and locative constraints surrounding a service are important for interacting with it. These constraints apply to both the service requestor and the service provider. We discuss service interactions including the less common ones of cancellation, suspension and resumption. We then discuss various kinds of temporal windows and argue for certain locative constraints.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123826052","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210130
Mark James Carman, L. Serafini
We outline a framework for performing automated discovery, composition and execution of Web services based solely on the information available in interface descriptions and service directories. In our framework we do not rely on the existence of semantic mark-up in service descriptions, thus making our approach "hard". (From a planning perspective, we tackle the problem of planning in a semantically heterogeneous domain.) The framework consists of a domain model, a planning and execution algorithm, and learning procedures. Preliminary work on implementing a service matching system is also discussed.
{"title":"Planning for web services the hard way","authors":"Mark James Carman, L. Serafini","doi":"10.1109/SAINTW.2003.1210130","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210130","url":null,"abstract":"We outline a framework for performing automated discovery, composition and execution of Web services based solely on the information available in interface descriptions and service directories. In our framework we do not rely on the existence of semantic mark-up in service descriptions, thus making our approach \"hard\". (From a planning perspective, we tackle the problem of planning in a semantically heterogeneous domain.) The framework consists of a domain model, a planning and execution algorithm, and learning procedures. Preliminary work on implementing a service matching system is also discussed.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"58-60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123126584","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
扫码关注我们
求助内容：
应助结果提醒方式：