Pub Date : 2007-12-04DOI: 10.1109/PIMRC.2007.4394712
F. Ono, K. Sakaguchi
Wireless mesh networks, consist of mesh routers and clients, have attracted researchers in the field of sensor network or wireless plant control for its potential to achieve high connectivity and wide area coverage in an ad-hoc way. The mesh routers should supply the backbone of the network with high capacity to support accumulated traffic from or to mesh clients. In the conventional mesh network it is a biggest problem of inefficient network channel capacity due to multiple access interference among the mesh routers. In this paper we will propose a novel MIMO mesh network, where the mesh routers support multiple antennas, to avoid multiple access interference and to supply higher network capacity via link multiplexing. As a MIMO transmission scheme, linear (such as Zero-Forcing) and nonlinear (such as Dirty Paper Coding / Successive Interference Cancellation) MIMO algorithm are developed for the proposed mesh network. It is found from numerical analysis that the proposed MIMO mesh network achieves extremely higher channel capacity than that of conventional mesh network.
{"title":"Multiple Access Interference Cancellation and Link Multiplexing for MIMO Mesh Network","authors":"F. Ono, K. Sakaguchi","doi":"10.1109/PIMRC.2007.4394712","DOIUrl":"https://doi.org/10.1109/PIMRC.2007.4394712","url":null,"abstract":"Wireless mesh networks, consist of mesh routers and clients, have attracted researchers in the field of sensor network or wireless plant control for its potential to achieve high connectivity and wide area coverage in an ad-hoc way. The mesh routers should supply the backbone of the network with high capacity to support accumulated traffic from or to mesh clients. In the conventional mesh network it is a biggest problem of inefficient network channel capacity due to multiple access interference among the mesh routers. In this paper we will propose a novel MIMO mesh network, where the mesh routers support multiple antennas, to avoid multiple access interference and to supply higher network capacity via link multiplexing. As a MIMO transmission scheme, linear (such as Zero-Forcing) and nonlinear (such as Dirty Paper Coding / Successive Interference Cancellation) MIMO algorithm are developed for the proposed mesh network. It is found from numerical analysis that the proposed MIMO mesh network achieves extremely higher channel capacity than that of conventional mesh network.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132926700","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317971
G. Dane, K. El-Maleh, Haohong Wang
This paper presents a new multi-mode video object segmentation scheme to automatically segment head-and-shoulder objects from a video sequence. The proposed system supports two modes of segmentation: intra-mode and inter-mode. The intra-mode segmentation integrates skin detection, facial feature localization and verification, object shape approximation, split-and-merge region growing, and object region selection and guarantees good performance of the proposed segmentation scheme. The inter-mode object segmentation makes use of background modeling and subtraction to take advantage of temporal correlation of video frame while increasing the robustness of the segmentation and speeding up the performance. The main contributions of the proposed method includes: (i) a robust and efficient background modeling in inter-mode object segmentation, (ii) a facial feature verification and a multi-face separation algorithm in intra-mode segmentation. The performance of the algorithm is illustrated by simulation results carried out on various head-and-shoulder video sequences.
{"title":"A Multi-Mode Video Object Segmentation Scheme for Wireless Video Applications","authors":"G. Dane, K. El-Maleh, Haohong Wang","doi":"10.1109/ICCCN.2007.4317971","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317971","url":null,"abstract":"This paper presents a new multi-mode video object segmentation scheme to automatically segment head-and-shoulder objects from a video sequence. The proposed system supports two modes of segmentation: intra-mode and inter-mode. The intra-mode segmentation integrates skin detection, facial feature localization and verification, object shape approximation, split-and-merge region growing, and object region selection and guarantees good performance of the proposed segmentation scheme. The inter-mode object segmentation makes use of background modeling and subtraction to take advantage of temporal correlation of video frame while increasing the robustness of the segmentation and speeding up the performance. The main contributions of the proposed method includes: (i) a robust and efficient background modeling in inter-mode object segmentation, (ii) a facial feature verification and a multi-face separation algorithm in intra-mode segmentation. The performance of the algorithm is illustrated by simulation results carried out on various head-and-shoulder video sequences.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114991684","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317911
Y. Sei, S. Honiden
Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variable- size bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed- size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration. In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.
{"title":"Ringed Filters for Peer-to-Peer Keyword Searching","authors":"Y. Sei, S. Honiden","doi":"10.1109/ICCCN.2007.4317911","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317911","url":null,"abstract":"Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variable- size bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed- size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration. In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114651314","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317842
Junichi Maruyama, G. Hasegawa, M. Murata
In this paper, we propose a new mechanism which detects tampered-TCP connections at edge routers and protects well-behaved TCP connections from the tampered-TCP connections, resulting in maintaining the fairness amongst TCP connections. The proposed mechanism monitors the TCP packets at an edge router and estimates the window size or the throughput for each TCP connection. By using estimation results, the proposed mechanism assesses whether each TCP connection is tampered or not and drops packets intentionally if necessary to improve the fairness amongst TCP connections. From the results of simulation experiments, we exhibit that the proposed mechanism can accurately identify tampered-TCP connections. We also show that the proposed mechanism can regulate throughput ratio between tampered-TCP connections and competing TCP Reno connections to about 1.
{"title":"Protection Mechanisms for Well-behaved TCP Flows from Tampered-TCP at Edge Routers","authors":"Junichi Maruyama, G. Hasegawa, M. Murata","doi":"10.1109/ICCCN.2007.4317842","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317842","url":null,"abstract":"In this paper, we propose a new mechanism which detects tampered-TCP connections at edge routers and protects well-behaved TCP connections from the tampered-TCP connections, resulting in maintaining the fairness amongst TCP connections. The proposed mechanism monitors the TCP packets at an edge router and estimates the window size or the throughput for each TCP connection. By using estimation results, the proposed mechanism assesses whether each TCP connection is tampered or not and drops packets intentionally if necessary to improve the fairness amongst TCP connections. From the results of simulation experiments, we exhibit that the proposed mechanism can accurately identify tampered-TCP connections. We also show that the proposed mechanism can regulate throughput ratio between tampered-TCP connections and competing TCP Reno connections to about 1.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117181256","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317859
Hoang Nguyen, K. Nahrstedt
We present an attack containment framework against value-changing attacks in large-scale critical infrastructures, based on early warning and cooperative response approaches. We define an information structure, called attack container, which captures the trust behavior of a group of nodes and assists to contain the damage of the attack. The attack container is then used for distributed early warning and cooperative response in our framework. The simulation results show that our containment framework can detect, mitigate and contain large-scale attacks quickly.
{"title":"Attack Containment Framework for Large-Scale Critical Infrastructures","authors":"Hoang Nguyen, K. Nahrstedt","doi":"10.1109/ICCCN.2007.4317859","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317859","url":null,"abstract":"We present an attack containment framework against value-changing attacks in large-scale critical infrastructures, based on early warning and cooperative response approaches. We define an information structure, called attack container, which captures the trust behavior of a group of nodes and assists to contain the damage of the attack. The attack container is then used for distributed early warning and cooperative response in our framework. The simulation results show that our containment framework can detect, mitigate and contain large-scale attacks quickly.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124983510","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317949
G. Hiertz, Sebastian Max, Rui Zhao, D. Denteneer, L. Berlemann
In 2003, interests in the Institute of Electronics and Electrical Engineering (IEEE) 802.11 Working Group (WG) led to the formation of Task Group (TG) "S". 802.11s develops a Wireless Mesh Network (WMN) amendment. Unlike existing Mesh products, 802.11s forms a transparent 802 broadcast domain that supports any higher layer protocols. Therefore, 802.11s provides frame forwarding and path selection at layer-2. 802.11i describes a security concept for stations that associate with an Access Point (AP). However, in a Mesh Basic Service Set (BSS) devices need to mutually authenticate to provide integrity of the network. Thus, 802.11s adds additional elements to the concepts of 802.11L While traditional Wireless Local Area Networks (WLANs) are AP centred an 802.11 Mesh is fully distributed. Hence, 802.11s considers extensions to the Medium Access Control (MAC) too. The authors have contributed to the standardization of 802.11s since 2003. As constant participants we give insight to draft 1.02 of TG "s" and provide an outlook to future evolution of 802.11's first Mesh standard.
{"title":"Principles of IEEE 802.11s","authors":"G. Hiertz, Sebastian Max, Rui Zhao, D. Denteneer, L. Berlemann","doi":"10.1109/ICCCN.2007.4317949","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317949","url":null,"abstract":"In 2003, interests in the Institute of Electronics and Electrical Engineering (IEEE) 802.11 Working Group (WG) led to the formation of Task Group (TG) \"S\". 802.11s develops a Wireless Mesh Network (WMN) amendment. Unlike existing Mesh products, 802.11s forms a transparent 802 broadcast domain that supports any higher layer protocols. Therefore, 802.11s provides frame forwarding and path selection at layer-2. 802.11i describes a security concept for stations that associate with an Access Point (AP). However, in a Mesh Basic Service Set (BSS) devices need to mutually authenticate to provide integrity of the network. Thus, 802.11s adds additional elements to the concepts of 802.11L While traditional Wireless Local Area Networks (WLANs) are AP centred an 802.11 Mesh is fully distributed. Hence, 802.11s considers extensions to the Medium Access Control (MAC) too. The authors have contributed to the standardization of 802.11s since 2003. As constant participants we give insight to draft 1.02 of TG \"s\" and provide an outlook to future evolution of 802.11's first Mesh standard.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088477","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317869
M. Veeraraghavan, Tao Li
Signaling protocols for GMPLS networks have been standardized and implemented in switch controllers. Most switch vendors allow for signaling messages to be carried over in-band signaling channels as well as through out-of-band networks. In this paper, we compare these two signaling transport options. In carrying out this analysis, we allow for both software-implemented signaling protocol processors, as is common in most off-the-shelf switches today, as well as hardware-accelerated signaling protocol engines. Our motivating application is file transfers, which have high call arrival rates and low call holding times. The resulting high signaling message load makes the question of which signaling transport solution to use important. Network delays are lower in the in-band option given that there are no IP routers on these paths, but the per-channel transmitter rates are lower for in-band channels. To study this tradeoff, we set up queueing models and obtained delay estimates. Our analysis shows that with hardware-accelerated signaling engines, in-band signaling is the better option to keep end-to-end call setup delays low. With software signaling protocol processors, the most significant component is the message processing delay, which is likely to include queueing delays, making the question of in-band or out-of-band transport less important.
{"title":"Signaling Transport Options in GMPLS Networks: In-band or Out-of-band","authors":"M. Veeraraghavan, Tao Li","doi":"10.1109/ICCCN.2007.4317869","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317869","url":null,"abstract":"Signaling protocols for GMPLS networks have been standardized and implemented in switch controllers. Most switch vendors allow for signaling messages to be carried over in-band signaling channels as well as through out-of-band networks. In this paper, we compare these two signaling transport options. In carrying out this analysis, we allow for both software-implemented signaling protocol processors, as is common in most off-the-shelf switches today, as well as hardware-accelerated signaling protocol engines. Our motivating application is file transfers, which have high call arrival rates and low call holding times. The resulting high signaling message load makes the question of which signaling transport solution to use important. Network delays are lower in the in-band option given that there are no IP routers on these paths, but the per-channel transmitter rates are lower for in-band channels. To study this tradeoff, we set up queueing models and obtained delay estimates. Our analysis shows that with hardware-accelerated signaling engines, in-band signaling is the better option to keep end-to-end call setup delays low. With software signaling protocol processors, the most significant component is the message processing delay, which is likely to include queueing delays, making the question of in-band or out-of-band transport less important.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115176458","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317947
Weverton Cordeiro, Elisangela Aguiar, W. Junior, A. Abelém, M. Stanton
One of the main problems faced by ad hoc networks is providing specific quality of service guarantees for multimedia applications, mainly due to factors such as radio signal fading and node mobility. Since mesh networks are a special type of ad hoc network, they inherit these networks' problems. This paper's main goal is to present OLSR-MD, an extension to OLSR (optimized link state routing), to provide quality of service based on link delay measurements. An evaluation of OLSR-MD in a mesh network to be deployed at the Federal University of Para, by means of ns2 (version 2.30) simulations, showed that this protocol performed better than other OLSR based alternatives studied in the simulations.
{"title":"Providing Quality of Service for Mesh Networks Using Link Delay Measurements","authors":"Weverton Cordeiro, Elisangela Aguiar, W. Junior, A. Abelém, M. Stanton","doi":"10.1109/ICCCN.2007.4317947","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317947","url":null,"abstract":"One of the main problems faced by ad hoc networks is providing specific quality of service guarantees for multimedia applications, mainly due to factors such as radio signal fading and node mobility. Since mesh networks are a special type of ad hoc network, they inherit these networks' problems. This paper's main goal is to present OLSR-MD, an extension to OLSR (optimized link state routing), to provide quality of service based on link delay measurements. An evaluation of OLSR-MD in a mesh network to be deployed at the Federal University of Para, by means of ns2 (version 2.30) simulations, showed that this protocol performed better than other OLSR based alternatives studied in the simulations.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116444863","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317952
Kun-Chan Lan, Zhe Wang, Rodney Berriman, T. Moors, Mahbub Hassan, Lavy Libman, M. Ott, B. Landfeldt, Z. Zaidi, A. Seneviratne
Wireless mesh networks (WMN) have attracted considerable interest in years as a convenient, flexible and low-cost alternative to wired communication infrastructures in many contexts. However, the great majority of research on metropolitan-scale WMN has been centered around maximization of available bandwidth, suitable for non-real-time applications such as Internet access for the general public. On the other hand, the suitability of WMN for mission-critical infrastructure applications remains by and large unknown, as protocols typically employed in WMN are, for the most part, not designed for real-time communications. In this paper, we describe the smart transport and roads communications (STaRComm) project at National ICT Australia (NICTA), which sets a goal of designing a wireless mesh network architecture to solve the communication needs of the traffic control system in Sydney, Australia. This system, known as SCATS (Sydney coordinated adaptive traffic system) and used in over 100 cities around the world, connects a hierarchy of several thousand devices - from individual traffic light controllers to regional computers and the central traffic management centre (TMC) - and places stringent requirements on the reliability and latency of the data exchanges. We discuss our experience in the deployment of an initial testbed consisting of 7 mesh nodes placed at intersections with traffic lights, and share the results and insights learned from our measurements and initial trials in the process.
{"title":"Implementation of a Wireless Mesh Network Testbed for Traffic Control","authors":"Kun-Chan Lan, Zhe Wang, Rodney Berriman, T. Moors, Mahbub Hassan, Lavy Libman, M. Ott, B. Landfeldt, Z. Zaidi, A. Seneviratne","doi":"10.1109/ICCCN.2007.4317952","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317952","url":null,"abstract":"Wireless mesh networks (WMN) have attracted considerable interest in years as a convenient, flexible and low-cost alternative to wired communication infrastructures in many contexts. However, the great majority of research on metropolitan-scale WMN has been centered around maximization of available bandwidth, suitable for non-real-time applications such as Internet access for the general public. On the other hand, the suitability of WMN for mission-critical infrastructure applications remains by and large unknown, as protocols typically employed in WMN are, for the most part, not designed for real-time communications. In this paper, we describe the smart transport and roads communications (STaRComm) project at National ICT Australia (NICTA), which sets a goal of designing a wireless mesh network architecture to solve the communication needs of the traffic control system in Sydney, Australia. This system, known as SCATS (Sydney coordinated adaptive traffic system) and used in over 100 cities around the world, connects a hierarchy of several thousand devices - from individual traffic light controllers to regional computers and the central traffic management centre (TMC) - and places stringent requirements on the reliability and latency of the data exchanges. We discuss our experience in the deployment of an initial testbed consisting of 7 mesh nodes placed at intersections with traffic lights, and share the results and insights learned from our measurements and initial trials in the process.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122327476","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317836
A. Jaekel, A. Bari, Ying Chen, S. Bandyopadhyay
Traffic grooming techniques are used to combine low-speed data streams onto high-speed lightpaths with the objective of minimizing the network cost, or maximizing the network throughput. In this paper, we first present an efficient integer linear program (ILP) formulation for traffic grooming on mesh WDM networks. Our formulation can be easily modified to implement different objective functions. Unlike previous formulations, our ILP formulation can be used for practical sized networks with several hundred requests. We then propose a second ILP for traffic grooming, with the simplifying assumption that RWA is not an issue. This second formulation is able to generate, in a reasonable time, grooming strategies, for networks with over 30 nodes, with hundreds and even thousands of low-speed data streams. Finally, we introduce a set of ILP formulations for traffic grooming, where the logical topology is specified. We have studied, using simulation, the time needed to determine grooming strategies, using the different ILP formulations.
{"title":"New Techniques for Efficient Traffic Grooming in WDM Mesh Networks","authors":"A. Jaekel, A. Bari, Ying Chen, S. Bandyopadhyay","doi":"10.1109/ICCCN.2007.4317836","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317836","url":null,"abstract":"Traffic grooming techniques are used to combine low-speed data streams onto high-speed lightpaths with the objective of minimizing the network cost, or maximizing the network throughput. In this paper, we first present an efficient integer linear program (ILP) formulation for traffic grooming on mesh WDM networks. Our formulation can be easily modified to implement different objective functions. Unlike previous formulations, our ILP formulation can be used for practical sized networks with several hundred requests. We then propose a second ILP for traffic grooming, with the simplifying assumption that RWA is not an issue. This second formulation is able to generate, in a reasonable time, grooming strategies, for networks with over 30 nodes, with hundreds and even thousands of low-speed data streams. Finally, we introduce a set of ILP formulations for traffic grooming, where the logical topology is specified. We have studied, using simulation, the time needed to determine grooming strategies, using the different ILP formulations.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122933815","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：