Pub Date : 2011-11-15DOI: 10.1109/LANMAN.2011.6076937
Chingfang Hsu, H. Zeng, Jyun-Yu Ke
In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.
{"title":"A congestion-aware rerouting scheme in RPR networks","authors":"Chingfang Hsu, H. Zeng, Jyun-Yu Ke","doi":"10.1109/LANMAN.2011.6076937","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076937","url":null,"abstract":"In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124730164","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076929
G. Calarco, M. Casoni
We present a novel approach to heterogeneous networks study based on the implementation of a modular, extensible, and scalable testbed that uses virtualized network emulators. Our goal is to reproduce complex networks scenarios by interconnecting several emulators, concurrently running within a single hardware platform. This paper analyzes the testbed performance with simple emulation trials, to verify if it is suitable for assessing multipart networks evaluations.
{"title":"NetBoxIT: Virtual emulation integrated testbed for the heterogeneous networks design","authors":"G. Calarco, M. Casoni","doi":"10.1109/LANMAN.2011.6076929","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076929","url":null,"abstract":"We present a novel approach to heterogeneous networks study based on the implementation of a modular, extensible, and scalable testbed that uses virtualized network emulators. Our goal is to reproduce complex networks scenarios by interconnecting several emulators, concurrently running within a single hardware platform. This paper analyzes the testbed performance with simple emulation trials, to verify if it is suitable for assessing multipart networks evaluations.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132164061","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076930
R. Rojas-Cessa, Khondaker M. Salehin, K. Egoh
Software routers (SRs) are an alternative low-cost and moderate-performance router solutions implemented with general-purpose workstations able to host multiple network interface cards (NICs). Workstations can be programmed to forward packets between different NICs and to participate in routing functions. Virtualization can be used to model new protocols or hardware systems in software and without modifying the host's kernel. However virtualized routers are expected to suffer from performance degradation because of software execution overhead. In this paper, we investigate the performance impact of a virtual software router (VSR) in comparison to that of a SR. We present the performance of VSRs hosted by different workstations — with different number of processing cores.
{"title":"Experimental performance evaluation of a virtual software router","authors":"R. Rojas-Cessa, Khondaker M. Salehin, K. Egoh","doi":"10.1109/LANMAN.2011.6076930","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076930","url":null,"abstract":"Software routers (SRs) are an alternative low-cost and moderate-performance router solutions implemented with general-purpose workstations able to host multiple network interface cards (NICs). Workstations can be programmed to forward packets between different NICs and to participate in routing functions. Virtualization can be used to model new protocols or hardware systems in software and without modifying the host's kernel. However virtualized routers are expected to suffer from performance degradation because of software execution overhead. In this paper, we investigate the performance impact of a virtual software router (VSR) in comparison to that of a SR. We present the performance of VSRs hosted by different workstations — with different number of processing cores.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115915080","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076934
W. Colitti, K. Steenhaut, Niccolo De Caro, B. Buta, V. Dobrota
IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) and IPv6 Routing Protocol for Low-power and Lossy networks (RPL) have accelerated the integration of Wireless Sensor Networks (WSNs) and smart objects with the Internet. At the same time, the development of the Constrained Application Protocol (CoAP) has made it possible to provide resource constrained devices with web service functionalities. CoAP is an HTTP like web transfer protocol able to extend the REpresentational State Transfer (REST) architecture to LoWPANs. The major difference between CoAP and HTTP is the different transport layer protocol (UDP instead of TCP) and the header compression which makes the packet size significantly smaller. This work provides an evaluation of CoAP compared to HTTP. The performance is evaluated in terms of mote's energy consumption and response time. The aim of the paper is to demonstrate, with a quantitative and qualitative analysis, that CoAP is more suited to REST based WSNs compared to HTTP. The results have been obtained by means of simulation as well as tests on real sensor motes.
IPv6 over Low-power Wireless Personal Area Networks (6LoWPAN)和IPv6 Routing Protocol for Low-power and Lossy Networks (RPL)加速了无线传感器网络(wsn)和智能对象与互联网的融合。同时，受限应用协议(Constrained Application Protocol, CoAP)的发展使得向资源受限的设备提供web服务功能成为可能。CoAP是一种类似HTTP的web传输协议，能够将REpresentational State transfer (REST)架构扩展到lowpan。CoAP和HTTP之间的主要区别是不同的传输层协议(UDP而不是TCP)和报头压缩，这使得数据包大小显着变小。这项工作提供了与HTTP相比的CoAP评估。性能是根据mote的能耗和响应时间来评估的。本文的目的是通过定量和定性分析来证明，与HTTP相比，CoAP更适合基于REST的wsn。通过仿真和实际传感器数据的测试得到了结果。
{"title":"Evaluation of constrained application protocol for wireless sensor networks","authors":"W. Colitti, K. Steenhaut, Niccolo De Caro, B. Buta, V. Dobrota","doi":"10.1109/LANMAN.2011.6076934","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076934","url":null,"abstract":"IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) and IPv6 Routing Protocol for Low-power and Lossy networks (RPL) have accelerated the integration of Wireless Sensor Networks (WSNs) and smart objects with the Internet. At the same time, the development of the Constrained Application Protocol (CoAP) has made it possible to provide resource constrained devices with web service functionalities. CoAP is an HTTP like web transfer protocol able to extend the REpresentational State Transfer (REST) architecture to LoWPANs. The major difference between CoAP and HTTP is the different transport layer protocol (UDP instead of TCP) and the header compression which makes the packet size significantly smaller. This work provides an evaluation of CoAP compared to HTTP. The performance is evaluated in terms of mote's energy consumption and response time. The aim of the paper is to demonstrate, with a quantitative and qualitative analysis, that CoAP is more suited to REST based WSNs compared to HTTP. The results have been obtained by means of simulation as well as tests on real sensor motes.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123513586","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076936
B. Jaumard, Honghui Li
Segment p-cycles offer an interesting compromise between the classical (link) p-cycles and the path p-cycles (also known as FIPP p-cycles), inheriting most advantages of both p-cycle schemes. In their original form, segment p-cycles do not offer 100% node protection, i.e., do not guarantee any protection against node failure for the endpoints of the segments. Indeed, if we allow some p-cycle overlapping, it is possible to ensure 100% node protection: this is the focus of the present study. We propose a new efficient design approach for segment p-cycles, called segment Np-cycles, which ensure 100% protection against any single failure, either link or node (endpoints of requests are excluded). In order to evaluate the performances of segment Np-cycles, we develop a new optimization model based on column generation (CG) techniques. The use of such techniques eliminates the need to explicitly enumerate all segment Np-cycle configurations, but instead leads to a process where only improving segment Np-cycle configurations are generated. Numerical results demonstrate that segment Np-cycles are comparable, sometimes even more efficient, than path p-cycles with respect to their capacity requirement. In addition, in order to ensure 100% node protection, they only require a marginal extra spare capacity than the regular segment p-cycles.
{"title":"Segment p-cycle design with full node protection in WDM mesh networks","authors":"B. Jaumard, Honghui Li","doi":"10.1109/LANMAN.2011.6076936","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076936","url":null,"abstract":"Segment p-cycles offer an interesting compromise between the classical (link) p-cycles and the path p-cycles (also known as FIPP p-cycles), inheriting most advantages of both p-cycle schemes. In their original form, segment p-cycles do not offer 100% node protection, i.e., do not guarantee any protection against node failure for the endpoints of the segments. Indeed, if we allow some p-cycle overlapping, it is possible to ensure 100% node protection: this is the focus of the present study. We propose a new efficient design approach for segment p-cycles, called segment Np-cycles, which ensure 100% protection against any single failure, either link or node (endpoints of requests are excluded). In order to evaluate the performances of segment Np-cycles, we develop a new optimization model based on column generation (CG) techniques. The use of such techniques eliminates the need to explicitly enumerate all segment Np-cycle configurations, but instead leads to a process where only improving segment Np-cycle configurations are generated. Numerical results demonstrate that segment Np-cycles are comparable, sometimes even more efficient, than path p-cycles with respect to their capacity requirement. In addition, in order to ensure 100% node protection, they only require a marginal extra spare capacity than the regular segment p-cycles.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128893452","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076946
L. Battestilli, T. Nelms, S. Hunter, G. R. Shippy
We propose a scale-out solution for deep packet processing (DPP) appliances, which uses a standard Ethernet switch in combination with a load balancing controller. The majority of the data-plane traffic is distributed via the switch's built-in traffic distribution function and no connection state is kept. If the load balancing controller detects a skew in the load of the DPP appliances, it updates the traffic rules in the switch to redirect new connections to less busy DPP appliances. This adaptive solution is beneficial for load-balancing at high data rates because state is kept for only the redirected connections. For typical traffic patterns, our solution reduces the packet drops with minimal connection redirection. We show an example capture, where we are able to improve the packet drop rate by 94.8% with only 3% of the connections being redirected.
{"title":"High-performing scale-out solution for deep packet processing via adaptive load-balancing","authors":"L. Battestilli, T. Nelms, S. Hunter, G. R. Shippy","doi":"10.1109/LANMAN.2011.6076946","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076946","url":null,"abstract":"We propose a scale-out solution for deep packet processing (DPP) appliances, which uses a standard Ethernet switch in combination with a load balancing controller. The majority of the data-plane traffic is distributed via the switch's built-in traffic distribution function and no connection state is kept. If the load balancing controller detects a skew in the load of the DPP appliances, it updates the traffic rules in the switch to redirect new connections to less busy DPP appliances. This adaptive solution is beneficial for load-balancing at high data rates because state is kept for only the redirected connections. For typical traffic patterns, our solution reduces the packet drops with minimal connection redirection. We show an example capture, where we are able to improve the packet drop rate by 94.8% with only 3% of the connections being redirected.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125194566","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076941
Oscar Puñal, J. Gross
Next generation wireless local area networks, like the upcoming IEEE 802.11ac, strive for large frequency band-widths to cope with the rising traffic demands. Bandwidths of 80 MHz or even 160 MHz are being considered, where a significant frequency diversity among OFDM subcarriers is likely to exist. With a potentially large number of highly attenuated subcarriers it is not clear if the system should better avoid their usage for payload transmission. Such an approach can improve the error performance, however, with every disabled subcarrier the raw data rate is lowered. This trade-off has not been analyzed in the literature despite its significant impact. In this paper we present and evaluate, by means of simulations, schemes that switch off subcarriers and dynamically distribute power on the active ones (while using the same modulation) so as to increase the goodput of an 80 MHz IEEE 802.11 system. We further propose a close-to optimal approach that is light-weight in complexity. If applied on top of realistic channel models the latter outperforms non-adaptive schemes by up to 13 dB and other power loading approaches by more than 5 dB.
{"title":"Combined subcarrier switch off and power loading for 80 MHz bandwidth WLANs","authors":"Oscar Puñal, J. Gross","doi":"10.1109/LANMAN.2011.6076941","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076941","url":null,"abstract":"Next generation wireless local area networks, like the upcoming IEEE 802.11ac, strive for large frequency band-widths to cope with the rising traffic demands. Bandwidths of 80 MHz or even 160 MHz are being considered, where a significant frequency diversity among OFDM subcarriers is likely to exist. With a potentially large number of highly attenuated subcarriers it is not clear if the system should better avoid their usage for payload transmission. Such an approach can improve the error performance, however, with every disabled subcarrier the raw data rate is lowered. This trade-off has not been analyzed in the literature despite its significant impact. In this paper we present and evaluate, by means of simulations, schemes that switch off subcarriers and dynamically distribute power on the active ones (while using the same modulation) so as to increase the goodput of an 80 MHz IEEE 802.11 system. We further propose a close-to optimal approach that is light-weight in complexity. If applied on top of realistic channel models the latter outperforms non-adaptive schemes by up to 13 dB and other power loading approaches by more than 5 dB.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116515817","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076927
Arun Kumar Somani, Daniel Congreve
We consider scheduling resources on linear networks where each request is for a set of contiguous resources and for a different amount of time. Allocating spectrum to satisfy variable size data communication requests, utilizing linear resource on a light-trail network for higher efficiency, scheduling communication path for a segmented light-trails network or a multi-hop network with no intermediate storage (receive and forward paradigm), or allocating resources on any linear pipeline, would benefit from such a resource allocation scheme which is proposed here. The problem is similar to a two-dimensional bin packing problem, which is known to be NP-hard, but with an additional constraint that one coordinate location for an object is already fixed. That makes the problem different and interesting to solve. We develop an efficient algorithm and show that it find minimal length schedule with very high probability and demonstrate that a minimum length schedule is not determined by the usage durations of individual resources.
{"title":"Scheduling linear network for space and time efficiency","authors":"Arun Kumar Somani, Daniel Congreve","doi":"10.1109/LANMAN.2011.6076927","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076927","url":null,"abstract":"We consider scheduling resources on linear networks where each request is for a set of contiguous resources and for a different amount of time. Allocating spectrum to satisfy variable size data communication requests, utilizing linear resource on a light-trail network for higher efficiency, scheduling communication path for a segmented light-trails network or a multi-hop network with no intermediate storage (receive and forward paradigm), or allocating resources on any linear pipeline, would benefit from such a resource allocation scheme which is proposed here. The problem is similar to a two-dimensional bin packing problem, which is known to be NP-hard, but with an additional constraint that one coordinate location for an object is already fixed. That makes the problem different and interesting to solve. We develop an efficient algorithm and show that it find minimal length schedule with very high probability and demonstrate that a minimum length schedule is not determined by the usage durations of individual resources.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129859987","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076935
D. Staessens, Sachin Sharma, D. Colle, M. Pickavet, P. Demeester
Software Defined Networking is a networking paradigm which allows network operators to manage networking elements using software running on an external server. This is accomplished by a split in the architecture between the forwarding element and the control element. Two technologies which allow this split for packet networks are For CES and Openflow. We present energy efficiency and resilience aspects of carrier grade networks which can be met by Openflow. We implement flow restoration and run extensive experiments in an emulated carrier grade network. We show that Openflow can restore traffic quite fast, but its dependency on a centralized controller means that it will be hard to achieve 50 ms restoration in large networks serving many flows. In order to achieve 50 ms recovery, protection will be required in carrier grade networks.
{"title":"Software defined networking: Meeting carrier grade requirements","authors":"D. Staessens, Sachin Sharma, D. Colle, M. Pickavet, P. Demeester","doi":"10.1109/LANMAN.2011.6076935","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076935","url":null,"abstract":"Software Defined Networking is a networking paradigm which allows network operators to manage networking elements using software running on an external server. This is accomplished by a split in the architecture between the forwarding element and the control element. Two technologies which allow this split for packet networks are For CES and Openflow. We present energy efficiency and resilience aspects of carrier grade networks which can be met by Openflow. We implement flow restoration and run extensive experiments in an emulated carrier grade network. We show that Openflow can restore traffic quite fast, but its dependency on a centralized controller means that it will be hard to achieve 50 ms restoration in large networks serving many flows. In order to achieve 50 ms recovery, protection will be required in carrier grade networks.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124067692","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076928
M. Fiorani, M. Casoni, W. Cerroni
In this paper the performance of a hybrid optical network composed of multiple Ethernet Passive Optical Networks (EPONs) at the access connected to an Optical Burst Switching (OBS) core is evaluated. The EPONs make use of the IPACT algorithm to manage the upstream transmissions, whereas the OBS edge node employs a time-based assembly scheme for burst aggregation. This leads to interoperability issues between access and core which are investigated in this paper. The hybrid network scalability is proved by assessing the transport layer performance with different numbers of EPONs served by the same burst assembler and different numbers of Optical Network Units (ONUs) per EPON. The impact of the main design parameters affecting the interaction between EPONs and OBS is estimated. The transport layer performance is evaluated considering heterogeneous traffic flows by simulating both TCP and UDP sources.
{"title":"Transport layer performance of hybrid networks combining multiple EPONs and OBS","authors":"M. Fiorani, M. Casoni, W. Cerroni","doi":"10.1109/LANMAN.2011.6076928","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076928","url":null,"abstract":"In this paper the performance of a hybrid optical network composed of multiple Ethernet Passive Optical Networks (EPONs) at the access connected to an Optical Burst Switching (OBS) core is evaluated. The EPONs make use of the IPACT algorithm to manage the upstream transmissions, whereas the OBS edge node employs a time-based assembly scheme for burst aggregation. This leads to interoperability issues between access and core which are investigated in this paper. The hybrid network scalability is proved by assessing the transport layer performance with different numbers of EPONs served by the same burst assembler and different numbers of Optical Network Units (ONUs) per EPON. The impact of the main design parameters affecting the interaction between EPONs and OBS is estimated. The transport layer performance is evaluated considering heterogeneous traffic flows by simulating both TCP and UDP sources.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128806080","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
扫码关注我们
求助内容：
应助结果提醒方式：