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.
Flow convergence on particular nodes causes various problems such as degradation in QoS. We describe a new routing method for reducing the maximum number of relay flows on the node that relays maximum flows (called “the maximum number of relay flows”). A full search is required for calculating the optimal algorithm of this problem. Thus, we created an approximate algorithm to calculate a near optimal...
Flooding search is a basic searching scheme for unstructured peer-to-peer networks. This technique produces exponentially redundant messages in each hop. Subsequent growths of redundant messages will limit system scalability and will cause unnecessary traffic in network areas. To improve this searching scheme and reduce redundant messages, this paper proposed a novel algorithm (SmoothFlood) which...
The authors propose a framework and a detection method for network quality degradation. The framework has three functions. The first function is making a topology tree and selecting flows by watching network traffic at a single point probe. The second function is inferring a network specification, whether a flow has wireless link or not, by frequency analysis. The third function is the network quality...
Recently Andrew et al. proposed the TCP evaluation suite to provide a common test suite for researchers designing new TCP extensions and AQM mechanisms. It defines network topologies, simulation scenarios i.e. traffic characteristic as well as evaluation parameters to provide a common testbed for all new enhancements. The presented remarks determine the essential features of a simulation environment...
The main goals of quality-of-service (QoS) routing algorithms are: (1) to try to accommodate new connections which expect certain end-to-end QoS requirements and (2) to improve the overall network efficiency. These QoS requirements are in the form of delay, jitter, packet-loss and bandwidth. In order to accommodate every new connection through the network that satisfies the QoS, the resources must...
In today's Internet with its multiple services, there is a growing need to provide quality of service (QoS) guarantees tailored to specific services rather than the best-effort QoS that is currently provided. One of the most important mechanisms for providing QoS guarantees is QoS routing. However, the main drawback to the use of QoS routing algorithms is their inability to scale well to large networks...
QoS provisioning in multi-hop IEEE 802.11 networks is very challenging due to the interference nature of wireless medium and the contention-based behavior among neighboring nodes. In such networks, one of the key questions for QoS support is: given a specific topology and traffic condition, how much bandwidth can be utilized along a path in the network without violating QoS demand of existing traffic?...
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.