The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
One of the notoriously difficult problems in quality of service (QoS) routing in mobile ad-hoc networks (MANET) is to ensure that the established path for a connection does not break before the end of the data transmission. This paper addresses the issue of reducing path breakage during data transmission, even if geographic location information is not available. Using delay-constrained QoS routing...
Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor...
In this paper a new mechanism called aggressiveness protective queuing (APQ), is described to control traffic in network devices. The method is based on the principles of the WFQ scheme and which uses dynamic weights for its operation. APQ uses a simple mechanism for tracking the resource usage by the flows and uses this accounting to properly and dynamically control the weights of WFQ. Also analytic...
Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance steins from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing...
The following topics are dealt with: P2P and overlay networks; incentive and reward; sensor and wireless networks; mobile ad-hoc networks; VoIP and streaming; security and privacy; congestion control; queue management; network algebra and calculus; QoS
Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have a limited lifetime in the network. All nodes are moving inside a bounded region according to some random mobility model. Both closed-form expressions, and asymptotic results are provided for the packet...
In this paper, an enhanced scalable proximity model is described. This work investigates the bandwidth estimation problem and it is impact on the quality of service of the file sharing application. The file transfer application over the TCP protocol is considered and it can be encountered in the emerging file sharing P2P applications or in the replicated Web server context. Since the impact of the...
In this work, the performance of various machine learning classifiers with regard to bottleneck detection in enterprise, multi-tier applications governed by service level objectives is described. Specifically, in this paper, it demonstrates the effectiveness of three classifiers, a tree-augmented Naive Bayesian network, a J48 decision tree, and LogitBoost, using our bottleneck detection process, which...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.