The 2005 Symposium on Applications and the Internet最新文献

Channel-based connectivity management middleware for seamless integration of heterogeneous wireless networks 基于通道的连接管理中间件，用于异构无线网络的无缝集成

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.16

Jun-Zhao Sun, J. Riekki, Marko Jurmu, J. Sauvola

引用次数: 9

Fault-management for multi-agent systems 多智能体系统的故障管理

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.29

Peng Xu, R. Deters

引用次数: 3

A self-organizing overlay network to exploit the locality of interests for effective resource discovery in P2P systems 一种利用兴趣局部性的自组织覆盖网络用于P2P系统中有效的资源发现

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.8

Hiroaki Kobayashi, H. Takizawa, T. Inaba, Yasuaki Takizawa

{"title":"A self-organizing overlay network to exploit the locality of interests for effective resource discovery in P2P systems","authors":"Hiroaki Kobayashi, H. Takizawa, T. Inaba, Yasuaki Takizawa","doi":"10.1109/SAINT.2005.8","DOIUrl":"https://doi.org/10.1109/SAINT.2005.8","url":null,"abstract":"P2P (Peer to Peer) is becoming a key technology to realize virtualized computing fields using the pervasive deployment and high-speed connectivity of computers through the Internet. However, P2P systems tend to waste the network bandwidth for resource acquisition because of its decentralized resource management. This paper proposes an efficient self-organizing overlay network for P2P-based grid computing systems to effectively reduce the number of resource-acquiring queries over the physical network. The resource exploitation space for some specific interests is organized as an overlay network, which is configured by making local clusters reflecting current interests of individual peers and connecting them together based on their similarity. In addition, the overlay network can be dynamically reconfigured based on the change in the interests of individual peers across time so that more useful peers at that time can be reconnected closer to their client peers. Therefore, multicasting of resource requesting messages can be carried out only over peers with similar interests that are connected through the overlay network. Experimental results indicate that the self-organizing overlay network can remarkably decrease both messages for resource acquisition and hops a resource requesting query travels to reach the peer that satisfies the request.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132215238","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}

引用次数: 24

On scalable modeling of TCP congestion control mechanism for large-scale IP networks 大规模IP网络中TCP拥塞控制机制的可扩展建模

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.46

H. Ohsaki, Juñya Ujiie, M. Imase

{"title":"On scalable modeling of TCP congestion control mechanism for large-scale IP networks","authors":"H. Ohsaki, Juñya Ujiie, M. Imase","doi":"10.1109/SAINT.2005.46","DOIUrl":"https://doi.org/10.1109/SAINT.2005.46","url":null,"abstract":"In this paper, we propose an analytic approach of modeling a closed-loop network with multiple feedback loops using fluid-flow approximation. Specifically, we model building blocks of a network (i.e., the congestion control mechanism of TCP, propagation delay of a transmission link, and the buffer of a router) as independent continuous-time systems. By interconnecting these systems, we obtain the model for a complex closed-loop network. We improve the accuracy of analytic models for TCP congestion control and RED router by extending existing fluid-flow models. First, we obtain a block diagram for each continuous-time system using a standard CAD tool widely used in control engineering. Second, we evaluate the performance of a closed-loop network with multiple feedback loops by connecting these block diagrams. We also validate the effectiveness of our analytic approach by comparing our analytic results with simulation results. Unlike other fluid-based modeling approaches, our analytic approach is scalable and accurate; our analytic approach is scalable in terms of the number of TCP connections and routers since both input/output of all continuous-time systems are uniformly defined as a packet transmission rate. Our analytic approach is accurate since the timeout mechanism of TCP and the packet dropping algorithm of RED router are rigorously modeled in our continuous-time systems.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117244872","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}

引用次数: 19

On architecting business performance management grid for adaptive enterprises 自适应企业业务绩效管理网格构建研究

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.43

J. Jeng, Henry Chang, K. Bhaskaran

引用次数: 3

A graph-based approach to Web services composition 基于图的Web服务组合方法

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.4

Seyyed Vahid Hashemian, F. Mavaddat

引用次数: 73

SOFAnet: middleware for software distribution over Internet SOFAnet:用于在Internet上分发软件的中间件

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.60

Ladislav Sobr, P. Tůma

引用次数: 10

Semantic Web link analysis to discover social relationships in academic communities 语义网络链接分析，发现学术团体中的社会关系

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.58

T. Miki, Saeko Nomura, T. Ishida

引用次数: 28

Dual metrics fair queueing: improving fairness and file transfer time 双指标公平排队:提高公平性和文件传输时间

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.23

Norio Yamagaki, H. Tode, K. Murakami

引用次数: 3

Scalable overlay network deployment for dynamic collaborative groups 动态协作组的可扩展覆盖网络部署

The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.56

Norihito Fujita, Y. Ishikawa, T. Koide, Akira Tsukamoto

{"title":"Scalable overlay network deployment for dynamic collaborative groups","authors":"Norihito Fujita, Y. Ishikawa, T. Koide, Akira Tsukamoto","doi":"10.1109/SAINT.2005.56","DOIUrl":"https://doi.org/10.1109/SAINT.2005.56","url":null,"abstract":"Scalable deployment and management of overlay networks for collaborative groups with dynamic membership are discussed. In deploying overlay networks for such dynamic groups, unlike in pre-defined static VPN deployment, a mechanism to keep security policies in member nodes updated for membership changes and a mechanism to adaptively reconfigure a topology must be supported. However, previous approaches have scalability problems in supporting these mechanisms. We propose a scalable overlay network deployment scheme to minimize the impact of membership changes. In the scheme, the IPsec policy required for delivering packets to a destination node is resolved on an on-demand basis to eliminate the advertisement-based updates of membership changes. Our approach also provides two modes of overlay topology operation to address dynamic changes in the number of nodes. While the mesh mode eliminates a tunnel initiation/teardown behavior for membership changes, the graph mode creates a graph-structured topology reconfigurable with a constant number of initiated/torn-down tunnels for node joins/leaves. We evaluate a management server load on dynamic membership changes and show the efficient performance of our scheme for increasing the number of nodes. We also show that our topology reconfiguration algorithm provides a smaller number of initiated/torn-down tunnels for changes in the number of nodes than previous approaches.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114501120","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}

引用次数: 5