We show that scale-free topologies have a positive impact on the performance of gossiping algorithms in peer-to-peer overlay networks. This result is important in the context of ad hoc networks, where each node participates in controlling the network topology. Our study shows that, when combined with such topologies, typical gossiping algorithms tend to require fewer messages and experience smaller latency than when combined with other topologies, such as rings or grids. This suggests that the topology control scheme should aim at producing an overlay network that exhibits scale-free characteristics.
{"title":"Impact of Scale-free Topologies on Gossiping in Ad Hoc Networks","authors":"B. Garbinato, Denis Rochat, M. Tomassini","doi":"10.1109/NCA.2007.29","DOIUrl":"https://doi.org/10.1109/NCA.2007.29","url":null,"abstract":"We show that scale-free topologies have a positive impact on the performance of gossiping algorithms in peer-to-peer overlay networks. This result is important in the context of ad hoc networks, where each node participates in controlling the network topology. Our study shows that, when combined with such topologies, typical gossiping algorithms tend to require fewer messages and experience smaller latency than when combined with other topologies, such as rings or grids. This suggests that the topology control scheme should aim at producing an overlay network that exhibits scale-free characteristics.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131043156","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 developed an efficient global on-demand routing protocol for mobile ad hoc networks. In this protocol, nodes do not update their routing tables immediately if they change status, such as movement, addition or deletion. Instead, nodes dynamically run the Dijkstra's algorithm on-demand to keep the shortest paths for packet transmissions efficiently. Our protocol is called as "global on-demand" because the on-demand feature covers the whole (global) network. With these critical features, our protocol has higher packet delivery rate and lower end-to-end delay than table-driven protocols. Moreover, our protocol shows low routing load as in the local on-demand protocols, and improves the sub-optimal hierarchical routing and memory consuming problems as in the existing hybrid protocols.
{"title":"A Global On-Demand Routing Protocol for Mobile Ad Hoc Networks","authors":"F. Lee, H. Kimm, C. Reinhart","doi":"10.1109/NCA.2007.1","DOIUrl":"https://doi.org/10.1109/NCA.2007.1","url":null,"abstract":"In this paper, we developed an efficient global on-demand routing protocol for mobile ad hoc networks. In this protocol, nodes do not update their routing tables immediately if they change status, such as movement, addition or deletion. Instead, nodes dynamically run the Dijkstra's algorithm on-demand to keep the shortest paths for packet transmissions efficiently. Our protocol is called as \"global on-demand\" because the on-demand feature covers the whole (global) network. With these critical features, our protocol has higher packet delivery rate and lower end-to-end delay than table-driven protocols. Moreover, our protocol shows low routing load as in the local on-demand protocols, and improves the sub-optimal hierarchical routing and memory consuming problems as in the existing hybrid protocols.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115820652","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}
Fuminori Makikawa, T. Matsuo, Tatsuhiro Tsuchiya, T. Kikuno
In overlay networks, which are virtual networks for P2P applications, topology mismatching is known as a serious problem to be solved. So far several distributed algorithms have been proposed to reduce link cost caused by this problem. However, they often create long routes with a large number of hops, especially for long distance communications. In this paper, we propose a distributed algorithm to address this issue. This algorithm designates nodes in an overlay network as special nodes with some probability. A special node iteratively exchanges one of its links with a new, longer distance link, instead of a shorter one. The new links are extensively used for long distance communications. The simulation studies show that in the overlay networks constructed by this algorithm, the number of hops per route is reduced for long distance communications, at the cost of a slight increase in link cost.
{"title":"Constructing Overlay Networks with Low Link Costs and Short Paths","authors":"Fuminori Makikawa, T. Matsuo, Tatsuhiro Tsuchiya, T. Kikuno","doi":"10.1109/NCA.2007.13","DOIUrl":"https://doi.org/10.1109/NCA.2007.13","url":null,"abstract":"In overlay networks, which are virtual networks for P2P applications, topology mismatching is known as a serious problem to be solved. So far several distributed algorithms have been proposed to reduce link cost caused by this problem. However, they often create long routes with a large number of hops, especially for long distance communications. In this paper, we propose a distributed algorithm to address this issue. This algorithm designates nodes in an overlay network as special nodes with some probability. A special node iteratively exchanges one of its links with a new, longer distance link, instead of a shorter one. The new links are extensively used for long distance communications. The simulation studies show that in the overlay networks constructed by this algorithm, the number of hops per route is reduced for long distance communications, at the cost of a slight increase in link cost.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115109071","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}
Input characterization to describe the flow of incoming traffic in network systems, such as the GRID and the WWW, is often performed by using Markov modulated Poisson processes (MMPP). Therefore, to enact capacity planning and quality-of-service (QoS) oriented design, the model of the hosts that receive the incoming traffic is often described as a MMPP/M/1 queue. The drawback of this model is that no closed form for its solution has been derived. This means that evaluating even the simplest output statistics of the model, such as the average response times of the queue, is a computationally intensive task and its usage in the above contexts is often unadvisable. In this paper we discuss the possibility to approximate the behavior of a MMPP/M/1 queue with a computational effective analytical approximation, thus saving the large amount of calculations required to evaluate the same data by other means. The employed method consists in approximating the MMPP/M/1 queue as a weighted superposition of different M/M/1 queues. The analysis is validated by comparing the results of a discrete event simulator with those obtained from the proposed approximations, in the context of a real case study involving a GRID networked server.
{"title":"Approximate Analytical Models for Networked Servers Subject to MMPP Arrival Processes","authors":"B. Ciciani, Andrea Santoro, P. Romano","doi":"10.1109/NCA.2007.7","DOIUrl":"https://doi.org/10.1109/NCA.2007.7","url":null,"abstract":"Input characterization to describe the flow of incoming traffic in network systems, such as the GRID and the WWW, is often performed by using Markov modulated Poisson processes (MMPP). Therefore, to enact capacity planning and quality-of-service (QoS) oriented design, the model of the hosts that receive the incoming traffic is often described as a MMPP/M/1 queue. The drawback of this model is that no closed form for its solution has been derived. This means that evaluating even the simplest output statistics of the model, such as the average response times of the queue, is a computationally intensive task and its usage in the above contexts is often unadvisable. In this paper we discuss the possibility to approximate the behavior of a MMPP/M/1 queue with a computational effective analytical approximation, thus saving the large amount of calculations required to evaluate the same data by other means. The employed method consists in approximating the MMPP/M/1 queue as a weighted superposition of different M/M/1 queues. The analysis is validated by comparing the results of a discrete event simulator with those obtained from the proposed approximations, in the context of a real case study involving a GRID networked server.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115281396","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}
N. Kami, Jun Suzuki, Y. Hidaka, T. Yoshikawa, A. Iwata
We propose a method for multilayer in-service reconfiguration for network computing systems that minimizes the total service downtime. Although both software and hardware virtualization technologies has been proposed for dynamic reconfiguration, each one is currently designed to be executed independently and thus their cooperative operations that dynamically reconfigure both of them have not been well-considered. We have developed a method for multilayer in-service reconfiguration that comprises Ethernet-based distributed device reconfiguration (hardware layer), fine-granular I/O service continuity management (software layer), and their orchestration. Application to the management of a session initiation protocol server system built on distributed resources demonstrated that this method achieves dynamic load balancing in response to call rate increases without any failed calls.
{"title":"Multilayer In-service Reconfiguration for Network Computing Systems","authors":"N. Kami, Jun Suzuki, Y. Hidaka, T. Yoshikawa, A. Iwata","doi":"10.1109/NCA.2007.34","DOIUrl":"https://doi.org/10.1109/NCA.2007.34","url":null,"abstract":"We propose a method for multilayer in-service reconfiguration for network computing systems that minimizes the total service downtime. Although both software and hardware virtualization technologies has been proposed for dynamic reconfiguration, each one is currently designed to be executed independently and thus their cooperative operations that dynamically reconfigure both of them have not been well-considered. We have developed a method for multilayer in-service reconfiguration that comprises Ethernet-based distributed device reconfiguration (hardware layer), fine-granular I/O service continuity management (software layer), and their orchestration. Application to the management of a session initiation protocol server system built on distributed resources demonstrated that this method achieves dynamic load balancing in response to call rate increases without any failed calls.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115943774","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 GRIDTS, a grid infrastructure in which the resources select the tasks they execute, on the contrary to traditional infrastructures where schedulers find resources for the tasks. This solution allows scheduling decisions to be made with up-to-date information about the resources, which is difficult in the traditional infrastructures. Moreover, GRIDTS provides fault-tolerant scheduling by combining a set of fault tolerance techniques to cope with crash faults in components of the system. The solution is mainly based a tuple space, which supports the scheduling and also provides support for the fault tolerance mechanisms.
{"title":"GRIDTS: A New Approach for Fault-Tolerant Scheduling in Grid Computing","authors":"F. Favarim, J. Fraga, L. Lung, M. Correia","doi":"10.1109/NCA.2007.27","DOIUrl":"https://doi.org/10.1109/NCA.2007.27","url":null,"abstract":"This paper proposes GRIDTS, a grid infrastructure in which the resources select the tasks they execute, on the contrary to traditional infrastructures where schedulers find resources for the tasks. This solution allows scheduling decisions to be made with up-to-date information about the resources, which is difficult in the traditional infrastructures. Moreover, GRIDTS provides fault-tolerant scheduling by combining a set of fault tolerance techniques to cope with crash faults in components of the system. The solution is mainly based a tuple space, which supports the scheduling and also provides support for the fault tolerance mechanisms.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116713438","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 present clustering analysis of session-based Web workloads of eight Web servers using the intrasession characteristics (i.e., number of requests per session, session length in time, and bytes transferred per session) as variables. We use K-means algorithm and the Mahalanobis distance, and analyze the heavy-tailed behavior of intra-session characteristics and their correlations for each cluster. Our results show that clustering provides an efficient way to classify tens or hundreds thousands of sessions into several coherent classes that efficiently describe Web workloads. These classes reveal phenomena that cannot be observed when studying the workload as a whole.
{"title":"Discovering Web Workload Characteristics through Cluster Analysis","authors":"Fengbin Li, K. Goseva-Popstojanova, A. Ross","doi":"10.1109/NCA.2007.15","DOIUrl":"https://doi.org/10.1109/NCA.2007.15","url":null,"abstract":"In this paper we present clustering analysis of session-based Web workloads of eight Web servers using the intrasession characteristics (i.e., number of requests per session, session length in time, and bytes transferred per session) as variables. We use K-means algorithm and the Mahalanobis distance, and analyze the heavy-tailed behavior of intra-session characteristics and their correlations for each cluster. Our results show that clustering provides an efficient way to classify tens or hundreds thousands of sessions into several coherent classes that efficiently describe Web workloads. These classes reveal phenomena that cannot be observed when studying the workload as a whole.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130622111","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 design of scalable video servers with high throughput is receiving considerable attention with the growing popularity of VOD services. This paper presents a design solution we call scalable and cooperative interval caching (SCIC) for clustered video servers. SCIC uses interval caching and cache cooperation done by hash-based request distribution, and a randomized way of probing for an available cache. This way, SCIC can provide high scalability and throughput in clustered servers with a reasonably small amount of communication among hosts. Our simulation results demonstrate that SCIC is an effective caching strategy providing significant performance gains in clustered video servers.
{"title":"Supporting Scalable and Cooperative Interval Caching in a Clustered Video Server","authors":"Suneuy Kim, K. Tran","doi":"10.1109/NCA.2007.46","DOIUrl":"https://doi.org/10.1109/NCA.2007.46","url":null,"abstract":"The design of scalable video servers with high throughput is receiving considerable attention with the growing popularity of VOD services. This paper presents a design solution we call scalable and cooperative interval caching (SCIC) for clustered video servers. SCIC uses interval caching and cache cooperation done by hash-based request distribution, and a randomized way of probing for an available cache. This way, SCIC can provide high scalability and throughput in clustered servers with a reasonably small amount of communication among hosts. Our simulation results demonstrate that SCIC is an effective caching strategy providing significant performance gains in clustered video servers.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130631373","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}
K. Konwar, Peter M. Musial, N. Nicolaou, Alexander A. Shvartsman
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and asynchronous communication. Algorithms developed for static settings are often not usable in such settings because they rely on (logical) all-to-all node connectivity through routing protocols, which may be unfeasible or prohibitively expensive to implement in highly dynamic settings. This paper explores the indirect learning, via periodic gossip, approach to information dissemination within a dynamic, distributed data service implementing atomic read/write memory service. The indirect learning scheme is used to improve the liveness of the service in the settings with uncertain connectivity. The service is formally proved to guarantee atomicity in all executions. Conditional performance analysis of the new service is presented, where this analysis has the potential of being generalized to other similar dynamic algorithms. Under the assumption that the network is connected, and assuming reasonable timing conditions, the bounds on the duration of read/write operations of the new service are calculated. Finally, the paper proposes a deployment strategy where indirect learning leads to an improvement in communication costs relative to a previous solution that assumes all-to-all connectivity.
{"title":"Implementing Atomic Data through Indirect Learning in Dynamic Networks","authors":"K. Konwar, Peter M. Musial, N. Nicolaou, Alexander A. Shvartsman","doi":"10.1109/NCA.2007.30","DOIUrl":"https://doi.org/10.1109/NCA.2007.30","url":null,"abstract":"Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and asynchronous communication. Algorithms developed for static settings are often not usable in such settings because they rely on (logical) all-to-all node connectivity through routing protocols, which may be unfeasible or prohibitively expensive to implement in highly dynamic settings. This paper explores the indirect learning, via periodic gossip, approach to information dissemination within a dynamic, distributed data service implementing atomic read/write memory service. The indirect learning scheme is used to improve the liveness of the service in the settings with uncertain connectivity. The service is formally proved to guarantee atomicity in all executions. Conditional performance analysis of the new service is presented, where this analysis has the potential of being generalized to other similar dynamic algorithms. Under the assumption that the network is connected, and assuming reasonable timing conditions, the bounds on the duration of read/write operations of the new service are calculated. Finally, the paper proposes a deployment strategy where indirect learning leads to an improvement in communication costs relative to a previous solution that assumes all-to-all connectivity.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130805814","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. Andreolini, S. Casolari, M. Colajanni, Mirco Marchetti
Increasing traffic and the necessity of stateful analyses impose strong computational requirements on network intrusion detection systems (NIDS), and motivate the need of distributed architectures with multiple sensors. In a context of high traffic with heavy tailed characteristics, static rules for dispatching traffic slices among distributed sensors cause severe imbalance. Hence, the distributed NIDS architecture must be combined with adequate mechanisms for dynamic load redistribution. In this paper, we propose and compare different policies for the activation/deactivation of the dynamic load balancer. In particular, we consider and compare single vs. double threshold schemes, and load representations based on resource measures vs. load aggregation models. Our experimental results show that the best combination of a double threshold scheme with a linear aggregation of resource measures is able to achieve a really satisfactory balance of the sensor loads together with a sensible reduction of the number of load balancer activations.
{"title":"Dynamic load balancing for network intrusion detection systems based on distributed architectures","authors":"M. Andreolini, S. Casolari, M. Colajanni, Mirco Marchetti","doi":"10.1109/NCA.2007.17","DOIUrl":"https://doi.org/10.1109/NCA.2007.17","url":null,"abstract":"Increasing traffic and the necessity of stateful analyses impose strong computational requirements on network intrusion detection systems (NIDS), and motivate the need of distributed architectures with multiple sensors. In a context of high traffic with heavy tailed characteristics, static rules for dispatching traffic slices among distributed sensors cause severe imbalance. Hence, the distributed NIDS architecture must be combined with adequate mechanisms for dynamic load redistribution. In this paper, we propose and compare different policies for the activation/deactivation of the dynamic load balancer. In particular, we consider and compare single vs. double threshold schemes, and load representations based on resource measures vs. load aggregation models. Our experimental results show that the best combination of a double threshold scheme with a linear aggregation of resource measures is able to achieve a really satisfactory balance of the sensor loads together with a sensible reduction of the number of load balancer activations.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404083","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
扫码关注我们
求助内容：
应助结果提醒方式：