{"title":"USAGI IPv6 IPsec development for Linux","authors":"Mitsuru Kanda, K. Miyazawa, H. Esaki","doi":"10.1109/SAINTW.2004.1268582","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268582","url":null,"abstract":"USAGI project was founded to improve and develop Linux IPv6 stack. We also developed (IPv6) IPsec stack for Linux kernel 2.4 and 2.6 series. We present our (IPv6) IPsec implementation (PE KEY, IPsec security association, security policy, output processing, and input processing) for both 2.4 and 2.6.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115452224","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":"Maintaining trust in peer-to-peer barter relationships","authors":"Kenji Saito","doi":"10.1109/SAINTW.2004.1268691","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268691","url":null,"abstract":"This paper proposes a barter currency system called i-WAT (Abdul-Rahman, 1997) to promote sustainable economy in peer-to-peer internetworking. i-WAT itself is a peer-to-peer system, without necessitating a central point of authority. It uses a digitally signed, electronic form of promissory note as the medium of exchange. This paper illustrates how it should assist internetworking of peer-to-peer systems, and discusses, in particular, how trust can be maintained in such a currency system. Among other means, the current design of i-WAT allows the notes to be transported over Jabber (Miller, 2003) instant messaging protocol. A prototype of an i-WAT checkbook has been developed as a plug-in for a Jabber client. We are beginning to experiment on the actual usage of the currency system using the checkbook as well as provisional Web applications.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115493828","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}
T. Yazaki, T. Kanetake, S. Akahane, Yoshihiko Sakata, K. Sugai, Hiroki Yano
{"title":"High-speed IPv6 router/switch architecture","authors":"T. Yazaki, T. Kanetake, S. Akahane, Yoshihiko Sakata, K. Sugai, Hiroki Yano","doi":"10.1109/SAINTW.2004.1268581","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268581","url":null,"abstract":"To construct a high-speed and reliable IPv6 network that supports an information society, a high-speed router and switch architecture and new quality of service (QoS) control mechanisms have been developed. The architecture that adopts distributed hardware engines for IPv4 and IPv6 packets achieves wire-rate forwarding for 10 gigabit Ethernet. The QoS control mechanisms, by controlling hierarchical bandwidths, can guarantee the communications of important data such as mission critical data for each network user, assuring bandwidths for each user. A next generation router (GR4000) and a switch (GS4000) based on this architecture provide 320 Gbps maximum capacity with the QoS control mechanisms as well as flow filtering and flow-statistics collection.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121814152","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":"Achieving heterogeneity and fairness in Kademlia","authors":"Y. Kadobayashi","doi":"10.1109/SAINTW.2004.1268686","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268686","url":null,"abstract":"Attempts to construct overlay networks in ubiquitous networked environments will face challenges of both performance and resource heterogeneity. We describe enhancements to Kademlia, a peer-to-peer system which has provable consistency and performance in a fault-prone environment. Our enhancements can accommodate nodes with arbitrary degree of heterogeneity, while at the same time ensuring fairness, without adding much overhead. A probabilistic mechanism to check parameter integrity is introduced, which in turn is exploited to probabilistically check compliance of nodes to advertised parameters. To demonstrate the feasibility of this approach, we have implemented a prototype and then evaluated its ability to accommodate arbitrary degree of heterogeneity.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115064294","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}
M. Noro, Takahiro Kikuchi, K. Baba, H. Sunahara, S. Shimojo
{"title":"QoS support for VoIP traffic to prepare emergency","authors":"M. Noro, Takahiro Kikuchi, K. Baba, H. Sunahara, S. Shimojo","doi":"10.1109/SAINTW.2004.1268593","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268593","url":null,"abstract":"Emergency communication support on the Internet is an important task. In the event of an emergency, such as a disaster, accepting as many VoIP calls as possible in limited bandwidth is an important requirement. Another important requirement is providing high quality service for important communications (ex. 911 services in the US). But, for non-emergency communication, the number of sessions (calls) that can be supported is much more important than the quality of each session. SIP supports various kinds of media; not only voice but also video can be used. In a multimedia session, it is not necessary to guarantee quality of all media for normal communications in an emergency situation. So, packets that contain video data or high quality voice data can be dropped in a very congested network. Diffserv AF service is suitable to realize this kind of quality policy. We propose a scheme which provides high quality service for important VoIP communication sessions and minimum quality for normal sessions using Diffserv AF service and a call admission method based on observing VoIP flow information and a log of SIP messages.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121997120","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}
Satoshi Tanaka, T. Itao, Atsushi Yamamoto, T. Suda, S. Yamada
{"title":"The design and implementation of service emergence platform software","authors":"Satoshi Tanaka, T. Itao, Atsushi Yamamoto, T. Suda, S. Yamada","doi":"10.1109/SAINTW.2004.1268661","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268661","url":null,"abstract":"We describe the design and implementation of Jack-in-the-Net (Ja-Net) platform software in a wireless LAN environment. Ja-Net is a platform for adaptive services in a large scale, open network environment. Ja-Net achieves built-in capabilities to create/emerge services adaptability according to dynamically changing network conditions and user preferences. A service is implemented on the Ja-Net platform by a collection of autonomous system components called cyber-entities. Cyber-entities are autonomous with simple behaviors and interact with each other using Ja-Net ACL (agent communication language) to jointly provide a service. For instance, a cyber-entity migrates from node to node and duplicates itself. Also, a cyber-entity may establish a relationship with an interaction partner to form a group to provide a service. The relationship strength between cyber-entities is a measure of the usefulness of the relationship and is adjusted based on the level of satisfaction indicated by a user who received the service. We design and implement the Ja-Net platform on notebook PCs connected by a wireless LAN. We implement the sample application AddAppli on our Ja-Net platform.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124620301","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":"Middleware support for super distributed autonomic services in pervasive networks","authors":"J. Suzuki, T. Suda","doi":"10.1109/SAINTW.2004.1268662","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268662","url":null,"abstract":"This paper describes our empirical research effort to design, implement and deploy a middleware platform that addresses several key issues in pervasive computing. We designed an architecture, called the bio-networking architecture, which models a pervasive network application as a collection of autonomic agents designed after several biological concepts and mechanisms. The biologically-inspired agents inherently address the key issues in pervasive computing, and our middleware platform aids developing and executing the agents on networks. We identify a set of requirements to the middleware platform through analyzing the features of our agents, and describe the design and implementation of the platform, showing how the platform satisfies the identified requirements. We also present some measurement results to illustrate scalability and efficiency of the platform.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126540172","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 meta-level career-design support system for connecting educational and occupational databases","authors":"Yusuke Takahashi, Y. Kiyoki","doi":"10.1109/SAINTW.2004.1268683","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268683","url":null,"abstract":"We present an implementation study for constructing a meta-level career design support system for connecting educational and occupational databases. This system is implemented as a multi-database system for dealing with educational and occupational information. This system has functionalities for measuring correlations among databases of educational issues, occupations and lectures. With these functionalities, our system totally supports users to design for specifying concrete occupations corresponding to their goals and objectives, to construct curriculums with an actual set of lectures. This system supports users enables users to specify significant educational contents, and to design the path for career development and learning, dynamically according to users' interests and social situations.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115791816","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 comparison among grid scheduling algorithms for independent coarse-grained tasks","authors":"N. Fujimoto, K. Hagihara","doi":"10.1109/SAINTW.2004.1268711","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268711","url":null,"abstract":"The most common objective function of task scheduling problems is makespan. However, on a computational grid, the 2nd optimal makespan may be much longer than the optimal makespan because the computing power of a grid varies over time. So, if the performance measure is makespan, there is no approximation algorithm in general for scheduling onto a grid. In contrast, recently the authors proposed the computing power consumed by a schedule as a criterion of the schedule and, for the criterion, gave (1+m(log/sub e/(m - 1) + 1)/n)-approximation algorithm RR for scheduling n independent coarse-grained tasks with the same length onto a grid with m processors. RR does not use any prediction information on the underlying resources. RR is the first approximation algorithm for grid scheduling. However, so far any performance comparison among related heuristic algorithms is not given. This paper shows experimental results on the comparison of the consumed computing power of a schedule among RR and five related algorithms. It turns out that RR is next to the best of algorithms that need the prediction information on processor speeds and task lengths though RR does not require such information.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130231999","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":"The demonstration of network-assisted disconnected operation for mobile communication","authors":"D. Ochi, K. Yamazaki","doi":"10.1109/SAINTW.2004.1268651","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268651","url":null,"abstract":"Mobile end nodes cannot achieve stable communication if they use the end-to-end communication model due to the instability of wireless links. Moreover, mobile nodes always have lower performance than fixed nodes, so the mobile node user needs some assistants. Our solution is the twin agents architecture, a network-assisted distributed processing architecture for mobile nodes. Its main point is the establishment of a pair of agents, one runs on the mobile node, and the other is placed on a stable part of the network and acts as an alter ego of the mobile node. These agents support flexible and programmable disconnected operations, and offset the low performance of the mobile node and the wireless link.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134231973","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}