In this paper we describe the design, implementation, and analytical background of the disco Network Calculator. The disco Network Calculator is an open-source toolbox written in Java#8482;which we developed for worst...
详细信息
ISBN:
(纸本)1595935045
In this paper we describe the design, implementation, and analytical background of the disco Network Calculator. The disco Network Calculator is an open-source toolbox written in Java#8482;which we developed for worst-case analyses based on network calculus. To our knowledge it is the first of its kind. It allows to do network analyses regarding performance characteristics such as delay and backlog bounds for piecewise linear arrival and service curves. We illustrate the tool's usefulness by two comprehensive example applications. Copyright 2006 ACM.
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide end-to-end quality of service guarantee...
详细信息
ISBN:
(纸本)1595933204
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide end-to-end quality of service guarantees for integrated and differentiated services networks. Yet, a true end-to-end analysis including the various components of end systems as well as taking into account mid-boxes like firewalls, proxies, or media gateways has not been accomplished so far. The particular challenge posed by such systems are transformation processes, like data processing, compression, encoding, and decoding, which may alter data arrivals drastically. The heterogeneity, which is reflected in the granularity of operation, for example multimedia applications process video frames which, however, are represented by packets in the network, complicates the analysis further. To this end this paper evolves a concise network calculus with scaling functions, which allow modelling a wide variety of transformation processes, Combined with the concept of packetizer this theory enables a true end-to-end analysis of distributedsystems. Copyright 2006 ACM.
Along with the increasing diversity of educational markup languages there is a strong need for flexible integration of such content into learning platforms. Therefore, we have identified four basic mechanisms: plain l...
详细信息
Data replication is one of the key components in data grid architecture as it enhances data access and reliability and minimises the cost of data transmission. In this paper, we address the problem of reducing the ove...
详细信息
In this paper, we present a grid computing platform that provides experimental scientists and analysts with access to computational simulations and knowledge databases hosted in separate lab.ratories around the world ...
详细信息
Some of the key issues in building services for large scale distributedsystems, realizing Vishwa, a peer-to-peer (P2P) middleware architecture for developing grid applications are discussed. Researchers are producing...
详细信息
Some of the key issues in building services for large scale distributedsystems, realizing Vishwa, a peer-to-peer (P2P) middleware architecture for developing grid applications are discussed. Researchers are producing large amounts of scientific data and believe that distributed computations on the data must be scheduled and availab.e to a large number of scientists. It is suggested that the platform must scale up to a large number of nodes and data units in the system and must also be scalab.e geographically. A scalab.e, reconfigurable shared-object space over the two-layer architecture can be developed that incorporates mechanisms to maintain replicated data and must also provide a shared-object abstraction over a wide-area distributed system.
Geospatial ontology development and semantic knowledge discovery addresses the need for modeling, analyzing and visualizing multimodal information, and is unique in offering integrated analytics that encompasses spati...
详细信息
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for example wireless community networks) may co...
详细信息
ISBN:
(纸本)1595930922
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for example wireless community networks) may co-exist without central coordination, even when they happen to operate on the same radio channel. Yet, it is evident that this lack of coordination leads to an inevitable loss in efficiency due to contention on the MAC layer. The interesting question is, which efficiency may be gained by adding coordination to existing, unrelated wireless networks, for example by self-organization. In this paper, we present a methodology based on a mathematical programming formulation to determine the parameters (assignment of stations to access points, signal strengths and channel assignment of both access points and stations) for a scenario of co-existing CSMA/CA-based wireless networks, such that the contention between these networks is minimized. We demonstrate how it is possible to solve this discrete, nonlinear optimization problem exactly for small problems. For larger scenarios, we present a genetic algorithm specifically tuned for finding near-optimal solutions, and compare its results to theoretical lower bounds. Overall, we provide a benchmark on the minimum contention problem for coordination mechanisms in CSMA/CA-based wireless networks. Copyright 2005 ACM.
In this paper, we walk in the footsteps of the stimulating paper by Lee Breslau and Scott Shenker entitled "Best-effort vs. Reservations: A Simple Comparative Analysis"[1]. In fact, we finally follow their i...
详细信息
暂无评论