We propose and evaluate fast reservation (FR) protocols for optical burst switched (OBS) networks. The proposed reservation schemes aim at reducing the end-to-end delay of a data burst, by sending the burst header pac...
详细信息
We propose and evaluate fast reservation (FR) protocols for optical burst switched (OBS) networks. The proposed reservation schemes aim at reducing the end-to-end delay of a data burst, by sending the burst header packet (BHP) in the core network before the burst assembly is completed at the ingress node. We use linear prediction filters to estimate the expected length of the burst and the time needed for the burstification process to complete. A BHP packet carrying these estimates is sent before burst completion, in order to reserve bandwidth at each intermediate node for the time interval the burst is expected to pass from that node. Reducing the total time needed for a packet to be transported over an OBS network is important, especially for real-time applications. Reserving bandwidth only for the time interval it is actual going to be used by a burst is important for network utilization efficiency. In the simulations conducted we evaluate the proposed extensions and prove their usefulness.
This paper addresses the problem of burst assembly in OBS-GRID networks and particularly the TCP throughput maximization problem for large file sizes. For that purpose, a novel adaptive size-based approach is proposed...
详细信息
This paper addresses the problem of burst assembly in OBS-GRID networks and particularly the TCP throughput maximization problem for large file sizes. For that purpose, a novel adaptive size-based approach is proposed, following some probabilistic methods and considering the effect of the burstification process in the overall transport system. The scheme has been evaluated in a high capacity GRID network. It was found that the proposed scheme results in shorter file transfer times, a significant higher TCP throughout, thus yielding a positive impact at the grid mechanics. The performance of the scheme is compared to that of a timer-based algorithm.
In this paper, the routing and wavelength assignment problem in all optical networks is considered. A solution to the RWA problem is proposed through a Genetic Algorithm (GA) based approach to search for the most suit...
详细信息
In this paper, the routing and wavelength assignment problem in all optical networks is considered. A solution to the RWA problem is proposed through a Genetic Algorithm (GA) based approach to search for the most suitable set of paths from many possible ones. We use GAs to solve this problem by introducing a new fitness function based on the mean value of occurrence of the common edges between the different genes of a single chromosome. In addition, we further improve performance and particularly execution times by considering the maximum quantity of edge disjoint paths (EDPs) to initialize the population with some indigo chromosomes. These EDPs are pre-computed and inserted in the GA-RWA problem. The proposed approach has been evaluated on the NSF network topology and compared with other similar schemes.
Mobile commerce (m-commerce) is a rather new field in the business world. It depends on wireless networks for accessing the Internet from mobile devices and for exchanging data between such devices. Wireless technolog...
详细信息
Mobile commerce (m-commerce) is a rather new field in the business world. It depends on wireless networks for accessing the Internet from mobile devices and for exchanging data between such devices. Wireless technologies on the one hand evolve rapidly and are met in many different applications. On the other hand a plethora of factors encourage market to make advances towards the m-commerce market. New ideas about m-commerce services and applications find acceptance by the business world and by users. Unfortunately not all users know how to create m-commerce services and applications. Thus a system which can easily create mobile commerce systems can be proved very helpful. In this paper we present a system which can create other m-commerce systems in a user friendly way. The system is meant to be used in the m-commerce market as a mean of developing hotel Websites and mobile sites. It uses a simple form which guides the user to create fully functional websites and mobile sites. We focus on implementation issues and evaluate our system after testing it. Finally, conclusions are extracted and future work is proposed.
Purpose: In any distributed application, the communication between the distributed processes/nodes of the distributed systems is essential for both reliability and efficiency matters. The purpose of this paper is to a...
详细信息
We design and implement an algorithm for solving the static RWA problem based on an LP relaxation formulation. This formulation is capable of providing integer optimal solutions despite the absence of integrality cons...
详细信息
We design and implement an algorithm for solving the static RWA problem based on an LP relaxation formulation. This formulation is capable of providing integer optimal solutions despite the absence of integrality constraints for a large subset of RWA input instances. In static RWA there is no a-priori knowledge of the channels usage and the interference among them cannot be avoided once the solution has been found. To take into consideration adjacent channel interference, we extend our formulation and model the interference by a set of analytical formulas as additional constraints on RWA.
The spread of multimedia data has drastically differentiated the current landscape of Universal Mobile Telecommunication System (UMTS) networks, posing the need for further enhancements in its radio Resource Managemen...
详细信息
The spread of multimedia data has drastically differentiated the current landscape of Universal Mobile Telecommunication System (UMTS) networks, posing the need for further enhancements in its radio Resource Management (RRM) strategies. Introduced in 3rd Generation Partnership Project (3 GPP) Release 6, the Multimedia Broadcast/Multicast Services (MBMS) framework aims at the efficient usage of network and radio resources for the transmission of multimedia services. The main requirement during the provision of MBMS multicast services is to minimize the transmission power of UMTS base stations. To this direction, several mechanisms have been proposed that either allow a simultaneous deployment of Point-to-Point (PTP) and Point-to-Multipoint (PTM) transmissions, or a single transport channel deployment (PTP or PTM) in a cell at any given time. Main objective of this paper is to study these mechanisms, compare them in terms of power consumption, underline the advantages that they may offer; and finally to propose enhancements that will ensure the lowest possible power consumption during MBMS transmissions.
We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation formulations. We present a link formula...
详细信息
We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation formulations. We present a link formulation, a path formulation and a heuristic that breaks the problem in the two constituent subproblems and solves them individually and sequentially. The flow cost functions that are used in these formulations result in providing integer optimal solutions despite the absence of integrality constraints for a large subset of RWA input instances, while also minimizing the total number of used wavelengths. We present a random perturbation technique that is shown to increase the number of instances for which we find integer solutions, and we also present appropriate iterative fixing and rounding methods to be used when the algorithms do not yield integer solutions. We comment on the number of variables and constraints these formulations require and perform extensive simulations to compare their performance to that of a typical min-max congestion formulation.
A key problem in networks that support advance reservations is the routing and time scheduling of connections with flexible starting time. In this paper we present a multicost routing and scheduling algorithm for sele...
详细信息
A key problem in networks that support advance reservations is the routing and time scheduling of connections with flexible starting time. In this paper we present a multicost routing and scheduling algorithm for selecting the path to be followed by such a connection and the time the data should start so as to minimize the reception time at the destination, or some other QoS requirement. The utilization profiles of the network links, the link propagation delays, and the parameters of the connection to be scheduled form the inputs to the algorithm. We initially present a scheme of non-polynomial complexity to compute a set of so-called non-dominated candidate paths, from which the optimal path can be found. By appropriately pruning the set of candidate paths using path pseudo-domination relationships, we also find multicost routing and scheduling algorithms of polynomial complexity. We examine the performance of the algorithms in the special case of an Optical Burst Switched network. Our results indicate that the proposed polynomial time algorithms have performance that it is very close to that of the optimal algorithm.
暂无评论