TL;DR: This paper considers joint problems of adaptive bandwidth reservation and link rearrangement (rerouting) for multimedia traffic under the event of congestion/failures of link, and proposes a mobile agent based approach to achieve these objectives.
Abstract: The bandwidth reservation for multimedia traffic poses technical challenges due to the bursty and delay sensitive nature of applications. The objectives of bandwidth reservation schemes are: optimize network utilization, and minimize the packet losses and delays. The growth of multimedia services on the Internet and the possible discovery of programmable networks has made us investigate new techniques for resolving bandwidth issues in multimedia communication. Mobile agent technology seems to be a promising solution for network management and QoS control. In this paper, we consider joint problems of adaptive bandwidth reservation and link rearrangement (rerouting) for multimedia traffic under the event of congestion/failures of link, and propose a mobile agent based approach to achieve these objectives. The scheme is simulated using a multimedia traffic model. Simulation results show that the use of agents increases the network utilization, acceptance ratio of applications, flexibility and efficiency of bandwidth reservation. The flexibility in using agent technology is that the policies can be changed and implemented easily by encoding in the agents.
TL;DR: This paper reviews the software agent technology applications in communications with more emphasis on mobile agents since it is an emerging agent technology.
Abstract: The rapid growth in the Internet users and diverse services have made the researches and practitioners to think of intelligent tools that can assist the users and applications in delivering the required quality of services. In this context, software agent technology is expected to become the tool for development of future softwares in distributed environments such as mobile computing, E-commerce, telecommunication network management, etc. Agent technology can be classified as single- and multi-agent systems (distributed static and mobile agents). In this paper, we review the software agent technology applications in communications with more emphasis on mobile agents since it is an emerging agent technology. The popularity of the agent technology is due to its support to: component based software engineering, flexible operations, easy software maintainability, adaptability to the real world, and extensibility of the softwares.
TL;DR: A generic framework for delivering personalized and adaptive content to mobile users is proposed and a variety of enabling technologies are introduced and important issues in this area are highlighted.
Abstract: Many innovative wireless applications that aim to provide mobile information access are emerging. Since people have different information needs and preferences, one of the challenges for mobile information systems is to take advantage of the convenience of handheld devices and provide personalized information to the right person in a preferred format. However, the unique features of wireless networks and mobile devices pose challenges to personalized mobile content delivery. This paper proposes a generic framework for delivering personalized and adaptive content to mobile users. It introduces a variety of enabling technologies and highlights important issues in this area. The framework can be applied to many applications such as mobile commerce and context-aware mobile services.
Cites background from "Adaptive bandwidth reservation sche..."
...Mobile agent technology seems to be a promising solution for wireless network management and QoS control [Manvi and Venkataram, 2002]....
TL;DR: An overview of most recent reliable, energy efficient, scalable, fault tolerant, and QoS based hybrid routing mechanisms and point to directions for future research and development are provided.
Abstract: Routing is one of the most challenging task in mobile ad hoc networks (MANETs). Several works have been proposed to address this challenge. In recent past, some of the research articles are focused on design of hybrid routing mechanisms for MANETs. In this paper, we present an overview of analytical, network, and simulation model used in the design of hybrid routing mechanisms wherever possible. This review paper classifies some of hybrid routing mechanisms into four categories named as mesh, tree, zone, and multipath structure with their relative performance. This paper also compares routing mechanisms against routing efficiency, reliability, packet delay, packet delivery ratio, control overheads, and QoS (Quality of Service). We provide an overview of most recent reliable, energy efficient, scalable, fault tolerant, and QoS based hybrid routing mechanisms and point to directions for future research and development.
TL;DR: An on demand bandwidth reservation scheme to improve Connection Dropping Probability (CDP) in cellular IP network by employing PSO is proposed and Simulation experiments reveal the efficacy of the model.
Abstract: Cellular IP network deals with micro mobility of the mobile devices. An important challenge in wireless communication, especially in cellular IP based network, is to provide good Quality of Service (QoS) to the users in general and to the real-time users (users involved in the exchange of real-time packets) in particular. Reserving bandwidth for real time traffic to minimize the connection drop (an important parameter) is an activity often used in Cellular IP network. Particle Swarm Optimization (PSO) algorithm simulates the social behavior of a swarm or flock to optimize some characteristic parameter. PSO is effectively used to solve many hard optimization problems. The work, in this paper, proposes an on demand bandwidth reservation scheme to improve Connection Dropping Probability (CDP) in cellular IP network by employing PSO. The swarm, in the model, consists of the available bandwidth in the seven cells of the cellular IP network. The anytime bandwidth demand for real-time users is satisfied by the available bandwidth of the swarm. The algorithm, used in the model, searches for the availability of the bandwidth and reserves it in the central cell of the swarm. Eventually, it will allocate it on demand to the cell that requires it. Simulation experiments reveal the efficacy of the model. [Article copies are available for purchase from InfoSci-on-Demand.com]
TL;DR: Swarming intelligence of mobile agents is examined as a basis for the development of a decentralized load balancing mechanism in telecommunications networks, as it allows to efficiently use the network to capacity and avoid overload situations.
Abstract: Networks today are growing continuously complex, with new kinds of services being included and heterogeneous networks interworking as a whole. Telecommunications networks in particular have become truly global networks, consisting of a variety of national and regional networks, both wired and wireless. Consequently, the management of telecommunications networks is becoming an increasingly complex task, as size and complexity constitute critical requirements that have to be met. Decentralized approaches to network management are currently being discussed, as is has become evident that central solutions cannot cope with scalability issues. Mobile agent technology in particular is being examined as a new distributed system and network paradigm. One vital issue in telecommunications networks management is load balancing, as it allows to efficiently use the network to capacity and avoid overload situations. In this paper, we will examine swarming intelligence of mobile agents as a basis for the development of a decentralized load balancing mechanism in telecommunications networks. Various strategies for swarming intelligence will be evaluated and compared to conventional approaches with a simulative approach.
TL;DR: A new scheduling algorithm for multimedia traffic using capacity reservation appears to give a noticeably improved quality of service to delay-sensitive traffic.
Abstract: We introduce a new scheduling algorithm for multimedia traffic using capacity reservation. We compare it with other algorithms in the literature. It has been implemented and its worst-case performance has been analysed. It appears to give a noticeably improved quality of service to delay-sensitive traffic.
TL;DR: Analytical and simulation models of a mobile agent based bandwidth negotiation and management system for multimedia communication are presented and it is observed that the response time of the agent increases with the increase in the number of retransmissions and the hops.
Abstract: We propose a mobile agent based QoS management system to satisfy the five functional principles of QoS architecture, i.e., integration, separation, transparency, asynchronous resource management and performance. The mobile agent paradigm is a unique paradigm in contrast to the traditional client/server paradigm in a problem inherently distributed and complex, such as QoS management. This paradigm saves a considerable amount of bandwidth and reduces network traffic. We present analytical and simulation models of a mobile agent based bandwidth negotiation and management system for multimedia communication. Response time of the mobile agent is computed with different number of retransmissions and the intermediate "hops" for both the models. It is observed that the response time of the agent increases with the increase in the number of retransmissions and the hops. We also show that the increase in the arrival of mobile agents would affect the admission of new multimedia applications.
TL;DR: This paper summarizes the experience on the design of network bandwidth allocation policies and distributed rate calculation algorithms for packet-switched networks and discusses two rate allocation policies: the generalized max–min (GMM) and the weight-proportional max-min (WPMM) policies, both of which generalize the classical max–Min rate allocation policy.
Abstract: This paper summarizes our experience on the design of network bandwidth allocation policies and distributed rate calculation algorithms for packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max–min (GMM) and the weight-proportional max–min (WPMM) policies, both of which generalize the classical max–min rate allocation policy. For the design of distributed algorithms to achieve these two rate allocation policies, we focus on rate-based distributed flow control where special control packets are employed to achieve the information exchange between a source and the network. We categorize two broad classes of distributed rate calculation algorithms in the literature using live algorithms as illustrations. To give insight, we compare the design tradeoffs between these two classes of algorithms in terms of performance objectives and implementation complexities. Furthermore, we discuss important extensions within each class of algorithms.
"Adaptive bandwidth reservation sche..." refers background in this paper
...Adaptive bandwidth reservation schemes reserve bandwidth online according to the implicit or explicit feedback about the network state from intermediate nodes and receivers [2, 3 ], pricing policies, application priorities, queuing based reservation, etc....
TL;DR: This paper illustrates four bandwidth problems in high-speed networks, and describes several solutions to them, which are concerned with the ability to dynamically reconfigure a network in order to efficiently benefit from network resources.
Abstract: High-speed networks are capable of carrying many types of services such as voice, data, images, and video. These services have different requirements in terms of bandwidth, cell loss, delay, etc. The goal is to maximize the quality of service offered during periods of stress, as viewed by both the network provider and the customer. Many problems are created by these different requirements. This paper illustrates four bandwidth problems in high-speed networks, then describes several solutions to them. The first problem is topology design and bandwidth allocation, and it is concerned with the ability to dynamically reconfigure a network in order to efficiently benefit from network resources. The second problem is concerned with flow control and congestion avoidance. Bandwidth management (BWM) protocols are used to prevent congestion, essentially by accepting or refusing a new-arrival cell. The third problem, which is the most critical one, is bandwidth allocation, which is concerned with successful integration of link capacities through the different types of services. Given that a virtual path is a logical direct link, composed of a number of virtual circuits, between any two nodes, the last problem is concerned with how to assign bandwidth to each virtual path in the network, in order to optimize performance for all users. This paper may be a good guide to researchers concerned with high-speed networks in general.