For a traffic engineered MPLS-supported network, we propose a novel and practically implementable optimal Joint Admission control and Routing (JACR) mechanism for incoming trunk traffic classes with distinct QoS const...
详细信息
ISBN:
(纸本)088986392X
For a traffic engineered MPLS-supported network, we propose a novel and practically implementable optimal Joint Admission control and Routing (JACR) mechanism for incoming trunk traffic classes with distinct QoS constraints. The significant contributions of our proposed algorithm are a) feasible implementation and enables quick roll-out due to minimal changes required to the existing network infrastructure, b) computationally efficient to make decisions within real-time call setup durations, c) scalability to network size and complexity, d) distributed implementation and e) simultaneously satisfies incoming trunk traffic session QoS requirements and equally importantly, satisfies capacity, routing and policy constraints of the network provider. We base our proposed JACR algorithm on Interior Point methods which are extremely efficient in solving large scale non-linear optimization problems. The proposed algorithm runs in two distinct phases - Phase-1 is the admission control and feasible route determination step and Phase-2 is the optimal routing step. This structure provides flexibility to the service provider to implement this algorithm in its complete form or even implement it as an admission control/feasible route determination algorithm solely (i.e. use Phase-1 only). Experimental results on realistic size network with 14 nodes, 28 links and 10 LSPs between an ingress-egress pair demonstrate that the proposed algorithm is efficient in determining admission and optimal routing for input traffic with QoS constraints within real-time call setup times.
Traditional telephone conferencing has been accomplished by way of a centralized conference bridge. The tandem arrangement of high compression speech codecs in conventional Voipconference bridges lead to speech disto...
详细信息
Traditional telephone conferencing has been accomplished by way of a centralized conference bridge. The tandem arrangement of high compression speech codecs in conventional Voipconference bridges lead to speech distortions and require a substantial number of computations. Decentralized architectures avoid the speech degradations and delay, but lack strong control and depend on silence suppression to make the endpoint bandwidth and processing requirements scalable. One solution is to use centralized speaker selection and forwarding, and decentralized decoding and mixing. This approach eliminates the problem of tandem encodings but maintains centralized control, thereby improving the speech quality and scalability of the conference. This paper considers design options and solutions for this model in the context of modern ip telephony networks. Performance was evaluated with real conferees over live conferences using a PC-based conferencing test bed, built using a custom software-based bridge and a third-party endpoint. Conferees strongly preferred the speech quality of the new arrangement to that of a conventional Voipconference bridge.
Recently, a new family of protocols has been introduced for large scale ad hoc networks that makes use of the approximate location of nodes in the network for geography-based routing. Location management plays an impo...
详细信息
Recently, a new family of protocols has been introduced for large scale ad hoc networks that makes use of the approximate location of nodes in the network for geography-based routing. Location management plays an important role in such protocols, and previous work in this area has shown that the asymptotic overhead of location management is heavily dependant on the service primitives (location registration, maintenance and discovery) supported by a location management protocol. Currently, SLALoM, which is a grid-based protocol optimized for large node movements, achieves the best known upper bound on the asymptotic worst case overhead of location management. However, the location registration cost in SLALoM dominates other costs for all practical purposes, and thus novel schemes need to be designed to limit this controltraffic. In this work, we use the idea of location forwarding to devise a new scheme called ELF that limits the signalling traffic, and thus enhances the scalability of location management in large ad hoc networks. We find that, while the asymptotic overhead cost by such an improvisation matches that of SLALoM, ELF outperforms SLALoM in average case scenarios.
The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network parameters (capacity, buffer size, topology, s...
详细信息
ISBN:
(纸本)0780377524
The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network parameters (capacity, buffer size, topology, scheduling) and of the characteristics of each TCP (RTT, route etc.) and UDP flow. This work. is based on the description via some fluid evolution equations, of the joint evolution of the window sizes of all flows over a single bottleneck router/link, as function of the synchronization rate. It is shown that the generalization of this fluid dynamics to a network composed of several routers can be described via equations allowing one to simulate the interaction of e.g. millions of TCP flows on networks composed of tens of thousands of links and routers on a standard workstation. The main output of the simulator are the mean value and the fluctuations of the throughput obtained by each flow, the localization of the bottleneck routers/links, the losses on each of them and the time evolution of aggregated input traffic at each router or link. The method is validated against NS simulations. We show that several important statistical properties of TCP traffic which were identified on traces are also present on traffic generated by our simulator: for instance, aggregated traffic generated by this representation exhibits the same short time scale statistical properties as those observed on real traces. Similarly, the experimental laws describing the fairness of the bandwidth sharing operated by TCP over a large network are also observed on the simulations.
Next generation wireless communication systems will bring new architecture concepts, new spectrum allocation policies and smart resource management in a multi-network environment Within this context the IST DRiVE proj...
详细信息
ISBN:
(纸本)0780377575
Next generation wireless communication systems will bring new architecture concepts, new spectrum allocation policies and smart resource management in a multi-network environment Within this context the IST DRiVE project [2] aims at enabling spectrum-efficient high-quality wireless ip in a heterogeneous multi-radio environment to deliver in-vehicular services. This paper assumes a multi-network scenario comprising GPRS and UMTS Radio Access networks (RAN) and proposes several schemes for controlling and distributing the network traffic over these two RANs, increasing the spectrum efficiency of the whole system by ensuring that Mobile Terminals are served by the optimum radio access technology available. This is achieved by assigning a cost to each service that the network can provide, taking into account both system load and system resource availability, and enabling the Mobile Terminal to select the most efficient RAN, retaining the quality the user asks for. The results show that a gain, in terms of percentage of satisfied users, of more than 15% can be obtained by the multi-network system compared to the case of no traffic distribution process, thus leading to a more efficient spectrum usage.
Employing smart antennas in the central access point (CAP) of wireless Internet access networks is studied A polling-based adaptive beamforming multiple access protocol (PB-ABFMA) is proposed In PB-ABFMA, CAP requests...
详细信息
ISBN:
(纸本)0769519067
Employing smart antennas in the central access point (CAP) of wireless Internet access networks is studied A polling-based adaptive beamforming multiple access protocol (PB-ABFMA) is proposed In PB-ABFMA, CAP requests the corresponding mobile terminal (MT) to transmit training sequence just before the data packets transmission, so the temporal reference beamforming (TRB) can be performed by the smart antennas. CAP schedules packet transmissions based on polling mechanism and dynamic TDMA. CAP and MTs transmit alternately. A mini-slot is used to keep connectivity when an MT is idle, therefore, the access delay is reduced A simple and effective access method is proposed to guarantee rapid access of new arrival MTs to the channel. Based on the "request-reply" traffic, which is the main traffic in Internet, the theoretical analysis of channel utilization is presented The mean turn around delay and performance of the proposed access method are evaluated by simulation. Results show that the proposed PB-ABFMA protocols effectively support the application of smart antennas and provide high channel utilization and low turn around delay.
In this article, we mainly focus on the integrated dynamic survivability in ip/MPLS/WDM networks under the peer-modeled architecture. We systematically investigated various integrated dynamic protection and restoratio...
详细信息
ISBN:
(纸本)0819451770
In this article, we mainly focus on the integrated dynamic survivability in ip/MPLS/WDM networks under the peer-modeled architecture. We systematically investigated various integrated dynamic protection and restoration schemes combining knowledge of resource and topology information in both the ip/MPLS and WDM layers. To allocate the restorable bandwidth-guaranteed paths, we propose an integrated routing algorithm: Load-Balanced Physical Resource Minimum Hop (LBPRMH) integrated routing algorithm. In this algorithm, we present a new link cost function used in Dijkstra's algorithm considering both physical resource and load balancing factors and employ a parameter (relevant to traffic intensity) to control the influence of two kind of information. When network load is low (traffic intensity is small), the main factor in the proposed link cost function is physical resource, which leads to high resource utilization. When network load is high, the idea of load balance becomes more important in routing, which avoids connection requests conflict and increases the efficiency of resource usage. Then extensive simulations are done to analyze and compare the dynamic survival performance of various integrated survival strategies. Resource utilization, protection efficiency, restoration efficiency are employed as metrics to evaluate the survivable performance. We demonstrate that the proposed integrated routing algorithm performs better than some existing approaches in terms of the above three metrics. The simulation results show the high resource utilization in optical layer recovery with wavelength granularity and the high restoration flexibility in ip/MPLS layer recovery with finer granularity. If the recovery action is implemented first in lower layer and then higher layer if the first action failed, the integrated protection and restoration schemes can combine the advantages of both layers and perform better than recovery schemes in either single layer.
Constraint-based routine, algorithms are a key component to meet various requirements subjects to a set of constraints for bandwidth requests in the GMPLS-based optical networks. The purpose of GMPLS control plane is ...
详细信息
ISBN:
(纸本)0819451770
Constraint-based routine, algorithms are a key component to meet various requirements subjects to a set of constraints for bandwidth requests in the GMPLS-based optical networks. The purpose of GMPLS control plane is to provide an intelligent automatic end-to-end label switched path provisioning/signaling framework to support arbitrary bandwidth traffic. We developed a detailed simulation platform for an ip-over-MPLS-over-WDM network, so that extensive simulations are carried out to evaluate the network performance of various routine, algorithms and routing strategies with RSVP-TE or CR-LDP signaling protocol in GMPLS-based ip/MPLS optical networks in terms of blocking probability. The simulation results show that the signaling protocol improves the network performance more significantly than multi-fiber configuration and CR-LDP signaling mechanism outperforms RSVP-TE in all cases. Furthermore, the LCF routine, strategy also has better performance than LCL strategy.
We propose a Sender Initiated Multicast (SIM), specifically designed for small group communications such as teleconferencing and Me distribution. Contrary to the traditional ip multicast, SIM reduces the cost of alloc...
详细信息
ISBN:
(纸本)0780376617
We propose a Sender Initiated Multicast (SIM), specifically designed for small group communications such as teleconferencing and Me distribution. Contrary to the traditional ip multicast, SIM reduces the cost of allocating a global multicast address by attaching receiver addresses to the packet header. SIM routers route packets according to these addresses;therefore, the cost of the controltraffic between routers can be lessened by applying the existing unicast routing table. The key feature of SIM is its Preset mode, which uses SIM Forwarding Information Base (FIB) entries on routers to achieve cost-efficient packet forwarding. Another feature is an automatically created SIM tunnel, which provides the ability to maintain SIM FIB only on routers that act as multicast branching points. In this paper, we describe the SIM mechanism in detail, and present results evaluated through simulations. We show how SIM can achieve low cost in maintaining state information, cost-efficient packet forwarding, and incremental deployment.
暂无评论