2006 3rd International Conference on Broadband Communications, Networks and Systems最新文献

{"title":"A Framework for Absolute QoS Guarantees in Optical Burst Switched Networks","authors":"Li Yang, G. Rouskas","doi":"10.1109/BROADNETS.2006.4374363","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374363","url":null,"abstract":"We consider the problem of supporting absolute QoS guarantees in terms of the end-to-end burst loss in OBS networks. We present a parameterized model for wavelength sharing which provides for isolation among different traffic classes while also making efficient use of wavelength capacity through statistical multiplexing. We develop a heuristic to optimize the policy parameters for a single link of an OBS network. We also develop a methodology for translating the end-to-end QoS requirements into appropriate per-link parameters so as to provide network-wide guarantees. Our approach is easy to implement, it can support a wide variety of traffic classes, and is effective in meeting the QoS requirements and keeping the loss rate of best-effort and overall traffic low.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123880949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Relaxing Delayed Reservations: An approach for Quality of Service differentiation in Optical Burst Switching networks","authors":"K. Christodoulopoulos, K. Vlachos, K. Yiannopoulos, Emmanouel Varvarigos","doi":"10.1109/BROADNETS.2006.4374364","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374364","url":null,"abstract":"In this paper we present a signaling protocol for QoS differentiation suitable for optical burst switching networks. The proposed protocol is a two-way reservation scheme that employs delayed and in-advance reservation of resources. In this scheme delayed reservations may be relaxed, introducing a reservation duration parameter that is negotiated during call setup phase. This feature allows bursts to reserve resources beyond their actual size to increase their successful forwarding probability and is used to provide QoS differentiation. The proposed signaling protocol offers a low blocking probability for bursts that can tolerate the round-trip delay required for the reservations. We present the main features of the protocol and describe in detail timing considerations regarding the call setup and the reservation process. We also describe several methods for choosing the protocol parameters so as to optimize performance and present corresponding evaluation results. Furthermore, we compare the performance of the proposed protocol against that of two other typical reservation protocols, a Tell-and-Wait and a Tell-and-Go protocol.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimizing IP Multicast through Delayed Multicast Tree Pruning","authors":"Yongjun Li, Wenhui Zhou, J. Wang, Deyu Qi","doi":"10.1109/BROADNETS.2006.4374383","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374383","url":null,"abstract":"This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and transitions of the multicast group management. Based on this model, a delayed vacation queue, extended from a simple M/M/l queue, is used to analyze the total cost of the multicast group management under various system conditions. The formal analysis reveals that the total cost of the multicast group management is minimized when a router delays a certain time to send its pruning messages to upper stream routers. Furthermore, a formula is derived to calculate the optimal delay time for sending the pruning messages under various system parameters to minimize the multicast group management cost. Finally, cost analysis examples demonstrate how other system parameters, such as multicast member arrival rate and message sending costs, affect the total cost of the multicast group management under various delay times for sending the pruning messages.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117188613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Evaluation of network distances properties by NDS, the Network Distance Service","authors":"J. Gossa","doi":"10.1109/BROADNETS.2006.4374306","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374306","url":null,"abstract":"This article presents a novel method for evaluating the properties of distances between hosts in a computational grid. Our method allows obtaining several indicators about a given network. We demonstrate why the current monitoring tools are not sufficient in grid environments that lack high level tools taking into account particular constraints for some given applications. We show how this method has been embedded in a grid service, namely the network distance service (NDS). Basically, this service returns the evaluation and characterization of a distance between a given set of sources and destinations. We illustrate the benefit of our approach in terms of accuracy of the returned values. We explain some implementation issues and discuss how the proposed NDS service can be useful to any grid service who needs some accurate evaluation for a decision making process involving such distances.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124545313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A role dynamic management algorithm for prolonging lifetime in Wireless Sensor Networks","authors":"V. Loscrí, Vincenzo Mantuano, S. Marano","doi":"10.1109/BROADNETS.2006.4374308","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374308","url":null,"abstract":"This article presents a role dynamic management algorithm for sensor devices. The network scenario considers a wireless sensor network in which each node can assume different roles. Specifically, attention is focused on two different roles: the active and the passive role. When a sensor device assumes an active role it uses a greater amount of energy greater than the passive role. The scope of this work is to introduce a dynamic management strategy to better distribute the energy in the network varying dynamically roles of the nodes under different mobility conditions. This dynamic algorithm is applied to an energy-efficient protocol based on a cross-layered approach (ESR and EMAC) and which ensures a good node lifetime. Two different algorithms have been developed to ensure a dynamic management of the node roles with the ESR and EMAC approach. Both these approaches have been evaluated through a simulation tool OMNeT++ and their performance have been compared with the original ESR and EMAC.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122722252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Partial Protection in Optical WDM Networks: Enhanced Support for Dynamic Traffic","authors":"M. Sivakumar, K. Sivalingam, Arun Kumar Somani","doi":"10.1109/BROADNETS.2006.4374328","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374328","url":null,"abstract":"In this paper, we consider a circuit-switched optical wavelength division multiplexed (WDM) network that offers protection services to the connections established in the network. A dynamic traffic model, where connection requests arrive based on some stochastic arrival process, is considered. In earlier work, the notion of partial protection was introduced for a WDM network with sub-wavelength capacity allocation capabilities, as in TDM-WDM networks, for a dynamic traffic model. Here, instead of setting up a backup path with the same capacity as the primary, the backup path is established with capacity that is less than the primary path's capacity, where the amount of backup path capacity is specified by the user. Intuitively, this will reduce backup path requirements, thereby increasing the number of connections accepted. In (J. Fang et al., 2005), the mechanism presented attempted to provide the maximum available protection bandwidth while ensuring that the minimum backup requirements are met. However, this can still result in wasted protection bandwidth if failures do not occur. In this paper, we present a mechanism to further improve the performance of partial protection schemes for dynamic traffic. When failure occurs, the connection is carried on the backup with reduced capacity. However, the system tries to identify additional spare capacity on the same backup path, on either the same wavelength or a different wavelength. The objective is to increase the amount of backup capacity at the time of failure, so that the connection's end user does not see a noticeable drop in bandwidth allocated. We present a heuristic connection admission control algorithm that prevents backup contention that occurs when backup paths of connections affected by a failure contend (share) for resources. A detailed performance evaluation of the mechanisms for different network topologies and other system parameters is presented. For one of the cases studied, the connection acceptance probability is increased from 95% to 99%, while providing nearly 100% backup capacity, when failure occurred. The mechanism proposed to counter backup contention is seen to provide an average of 120% reduction in the contention among backup paths of connections traversing a link, especially when the number of wavelengths in each link is small.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"51 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115658005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Restorability Analysis of Two Protection Cycles in Random Mesh Networks","authors":"W. Mardini, O. Yang","doi":"10.1109/BROADNETS.2006.4374304","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374304","url":null,"abstract":"This paper studies the total network restorability using only two protection cycles in a mesh optical network with fixed and uniformly distributed working and protection capacities. We present a detailed analysis for the shared case when two cycles share the capacity in a number of edges common between the two cycles, and also for the non-shared case when the capacities are not shared. We study how the restorability changes with respect to different network parameters.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131366354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Distributed Job Scheduling based on Multiple Constraints Anycast Routing","authors":"T. Stevens, M. D. Leenheer, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/BROADNETS.2006.4374374","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374374","url":null,"abstract":"As the popularity of resource-constrained devices such as hand-held computers increases, a new network service off loading complex processing tasks towards computational resources located in the access- or core network, sounds very promising. In a consumer-oriented environment, characterized by a large diversity in connected devices, a transparent network-based request processing strategy offers a clear flexibility advantage, as the installation and configuration of extra software components on all client devices can be avoided. In this work, this is achieved by linking computational resources to an any cast group, which allows intermediate router nodes to decide upon the target server. It is shown in the paper that the anycast routing problem can be reduced to unicast routing. Consequently, unicast multiple constraints routing algorithms can be applied to compute an optimal path based on several server selection criteria, including server load, path delay, path cost, etc. For this purpose, we envision the SAMCRA algorithm. A new evaluation ordering strategy for previously computed sub-paths is introduced, which guarantees optimality for the complete SAMCRA path between source and destination. Simulation results show that an effective distribution of the job scheduling requests over the available resources can be achieved by applying the described algorithm.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125433344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"SLIP-IN Architecture: A new Hybrid Optical Switching Scheme","authors":"K. Ramantas, K. Christodoulopoulos, K. Vlachos, E. V. Breusegem, M. Pickavet","doi":"10.1109/BROADNETS.2006.4374366","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374366","url":null,"abstract":"In this paper, we present a new hybrid switching architecture, termed as SLIP-IN, that combines electronic packet/burst with optical circuit switching. SLIP-IN architecture takes advantages of the pre-transmission idle periods of optical lightpaths and slips into them packets or bursts of packets. In optical circuit switching (wavelength-routing) networks, capacity is immediately hard-reserved upon the arrival of a setup message, but is only used after a round-trip time delay. This idle period is significant for optical multi-gigabit networks and can be used to transmit traffic of a lower class of service. In this paper, we present the main features and dependencies of the proposed hybrid switching architecture, and further we perform a detailed evaluation by conducting network wide simulation experiments on the NSFnet backbone topology. For this purpose, we have developed an extensive network simulator, where the basic features of the architecture were modeled. The extensive network study revealed that SLIP-IN architecture can achieve and sustain an adequate data rate with a finite worst case delay.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114388641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Performance Analysis of Soft-State Lightpath Management in GMPLS-Based WDM Networks","authors":"S. Ishida, S. Arakawa, M. Murata","doi":"10.1109/BROADNETS.2006.4374353","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374353","url":null,"abstract":"In this paper, we analyze the behavior of GMPLS RSVP-TE and its variants with a Markov model and analyze the performance of RSVP-TE. From the results, we demonstrate that resource utilization of RSVP-TE can be equivalent to that of a hard-state protocol when the loss probability of signaling messages is low. We also investigate the effectiveness of message retransmission and show that using message retransmission leads to poor resource utilization in some cases.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124003597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}