Vehicular Ad-hoc Network (VANET) can be envisaged as the network of moving vehicles communicating in asynchronous and autonomous fashion. Efficient and scalable information dissemination is a major challenge due to the movement of vehicles which causes unpredictable changes in network topology. Publish/Subscribe communication paradigm provides decoupling in time, space and synchronization between communicating entities, making it most suitable for VANET like environments. In this paper, we propose our publish/subscribe framework for information dissemination in VANET. In our approach, we assumed a hybrid VANET consisting of stationary info-stations and moving vehicles where each vehicle can take the role of publisher, subscriber or broker. Every major crossing of city is equipped with stationary info-stations that act as ultimate place holders for publications and subscriptions. These info-stations are assumed to be connected to internet and form Distributed Hash Table (DHT) based broker overlay among themselves. They act as rendezvous point for publications and subscriptions and send matching publications to interested subscribers. Further, these info-stations also provide services for locating any vehicle in the network. Simulation results indicate that our approach performs well with increasing number of vehicles which suggests the applicability of our approach.
{"title":"A Publish/Subscribe Communication Infrastructure for VANET Applications","authors":"Tulika Mishra, D. Garg, M. M. Gore","doi":"10.1109/WAINA.2011.87","DOIUrl":"https://doi.org/10.1109/WAINA.2011.87","url":null,"abstract":"Vehicular Ad-hoc Network (VANET) can be envisaged as the network of moving vehicles communicating in asynchronous and autonomous fashion. Efficient and scalable information dissemination is a major challenge due to the movement of vehicles which causes unpredictable changes in network topology. Publish/Subscribe communication paradigm provides decoupling in time, space and synchronization between communicating entities, making it most suitable for VANET like environments. In this paper, we propose our publish/subscribe framework for information dissemination in VANET. In our approach, we assumed a hybrid VANET consisting of stationary info-stations and moving vehicles where each vehicle can take the role of publisher, subscriber or broker. Every major crossing of city is equipped with stationary info-stations that act as ultimate place holders for publications and subscriptions. These info-stations are assumed to be connected to internet and form Distributed Hash Table (DHT) based broker overlay among themselves. They act as rendezvous point for publications and subscriptions and send matching publications to interested subscribers. Further, these info-stations also provide services for locating any vehicle in the network. Simulation results indicate that our approach performs well with increasing number of vehicles which suggests the applicability of our approach.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131970414","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}
Self-stabilizing systems, intended to run for a long time, commonly have to cope with transient faults during their mission. We model the behavior of a distributed self-stabilizing system under such a fault model as a Markov chain. Adding fault detection to a self-correcting non-masking fault tolerant system is required to progress from non-masking systems towards their masking fault tolerant functional equivalents. We introduce a novel measure, called limiting window availability (LWA) and apply it on self-stabilizing systems in order to quantify the probability of (masked) stabilization against the time that is needed for stabilization. We show how to calculate LWA based on Markov chains: first, by a straightforward Markov chain modeling and second, by using a suitable abstraction resulting in a space-reduced Markov chain. The proposed abstraction can in particular be applied to spot fault tolerance bottlenecks in the system design.
{"title":"The Degree of Masking Fault Tolerance vs. Temporal Redundancy","authors":"Nils Müllner, Oliver E. Theel","doi":"10.1109/WAINA.2011.137","DOIUrl":"https://doi.org/10.1109/WAINA.2011.137","url":null,"abstract":"Self-stabilizing systems, intended to run for a long time, commonly have to cope with transient faults during their mission. We model the behavior of a distributed self-stabilizing system under such a fault model as a Markov chain. Adding fault detection to a self-correcting non-masking fault tolerant system is required to progress from non-masking systems towards their masking fault tolerant functional equivalents. We introduce a novel measure, called limiting window availability (LWA) and apply it on self-stabilizing systems in order to quantify the probability of (masked) stabilization against the time that is needed for stabilization. We show how to calculate LWA based on Markov chains: first, by a straightforward Markov chain modeling and second, by using a suitable abstraction resulting in a space-reduced Markov chain. The proposed abstraction can in particular be applied to spot fault tolerance bottlenecks in the system design.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131662771","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}
Active XML (AXML) as an intensional XML Data aims to exploit potential computing power of XML, Web services and P2P architecture. It is considered as a powerful extension of XML to deal with dynamic XML data from autonomous and heterogeneous data sources at very large scale via Web services. However, AXML is still immature, so there are various issues to be investigated before it can be accepted widely. This paper will focus towards analyzing the current AXML representation and proposing improvements. It is expected that the new AXML representation will lay out foundation for improvements of AXML systems.
{"title":"Towards Improvement of Active XML Representation","authors":"Binh Viet Phan, E. Pardede, J. Rahayu","doi":"10.1109/WAINA.2011.150","DOIUrl":"https://doi.org/10.1109/WAINA.2011.150","url":null,"abstract":"Active XML (AXML) as an intensional XML Data aims to exploit potential computing power of XML, Web services and P2P architecture. It is considered as a powerful extension of XML to deal with dynamic XML data from autonomous and heterogeneous data sources at very large scale via Web services. However, AXML is still immature, so there are various issues to be investigated before it can be accepted widely. This paper will focus towards analyzing the current AXML representation and proposing improvements. It is expected that the new AXML representation will lay out foundation for improvements of AXML systems.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123373646","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}
M. Asim, H. Mokhtar, Muhammad Zahid Khan, M. Merabti
In the past few years wireless sensor networks have received a greater interest in application such as disaster management, border protection, combat field reconnaissance and security surveillance. Sensor nodes are expected to operate autonomously in unattended environments and potentially in large numbers. WSNs cannot be deployed manually in a hostile or harsh environment. Thus, WSNs can be formed by dropping them from the air. However, random deployment of sensor nodes can leave holes in terms of coverage in the sensing area. Moreover, sensor nodes failure may cause connectivity loss and in some cases network partitioning. The mobile devices can be used as an orthogonal method to address the network connectivity, coverage, and network life time problems in WSNs. Mobile sensors are useful as they can move to locations that meet sensing coverage requirements. In this paper we propose a novel sensor relocation scheme where redundant mobile nodes are moved to heal coverage holes in the network. We evaluate this work by simulations and show that our approach outperforms others in terms of relocation time and total energy consumption.
{"title":"A Sensor Relocation Scheme for Wireless Sensor Networks","authors":"M. Asim, H. Mokhtar, Muhammad Zahid Khan, M. Merabti","doi":"10.1109/WAINA.2011.67","DOIUrl":"https://doi.org/10.1109/WAINA.2011.67","url":null,"abstract":"In the past few years wireless sensor networks have received a greater interest in application such as disaster management, border protection, combat field reconnaissance and security surveillance. Sensor nodes are expected to operate autonomously in unattended environments and potentially in large numbers. WSNs cannot be deployed manually in a hostile or harsh environment. Thus, WSNs can be formed by dropping them from the air. However, random deployment of sensor nodes can leave holes in terms of coverage in the sensing area. Moreover, sensor nodes failure may cause connectivity loss and in some cases network partitioning. The mobile devices can be used as an orthogonal method to address the network connectivity, coverage, and network life time problems in WSNs. Mobile sensors are useful as they can move to locations that meet sensing coverage requirements. In this paper we propose a novel sensor relocation scheme where redundant mobile nodes are moved to heal coverage holes in the network. We evaluate this work by simulations and show that our approach outperforms others in terms of relocation time and total energy consumption.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"340 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116239","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}
Server virtualization helps us system and network administrators manage computer resources and reduce power consumption. However, to make efficient use of virtualization, its various loads, especially I/O operations, require careful consideration. Here we conducted three experiments to examine the effects of I/O load in a virtualization environment. First, We measured the performance of I/O operations executed on a virtual machine (VM) and the power consumption of the host machine, varying the I/O schedulers on both machines. The results varied according to the combinations of the I/O schedulers. Four of the 16 combinations in particular showed low I/O performance and high power consumption. We then investigated the effect of I/O priority to VM processes with a completely fair queuing scheduler on I/O performance. In this case, the I/O execution of high-priority required less than half the time of that of a lower priority process. Finally, we investigated the effects of I/O priority while jointly varying the block size of I/O requests issued by the VMs. I/O execution was effective when the block size was large but not when it was small.
{"title":"Using I/O Schedulers to Reduce I/O Load in Virtualization Environments","authors":"Tsuyoshi Ota, S. Okamoto","doi":"10.1109/WAINA.2011.22","DOIUrl":"https://doi.org/10.1109/WAINA.2011.22","url":null,"abstract":"Server virtualization helps us system and network administrators manage computer resources and reduce power consumption. However, to make efficient use of virtualization, its various loads, especially I/O operations, require careful consideration. Here we conducted three experiments to examine the effects of I/O load in a virtualization environment. First, We measured the performance of I/O operations executed on a virtual machine (VM) and the power consumption of the host machine, varying the I/O schedulers on both machines. The results varied according to the combinations of the I/O schedulers. Four of the 16 combinations in particular showed low I/O performance and high power consumption. We then investigated the effect of I/O priority to VM processes with a completely fair queuing scheduler on I/O performance. In this case, the I/O execution of high-priority required less than half the time of that of a lower priority process. Finally, we investigated the effects of I/O priority while jointly varying the block size of I/O requests issued by the VMs. I/O execution was effective when the block size was large but not when it was small.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121786313","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}
This paper proposes an extension of Proxy Mobile IPv6 (PMIPv6) with bicasting for multi-homing and mobility support. In the proposed scheme, the Local Mobility Anchor (LMA) extends its Binding Cache Entry (BCE) for support of multiple bindings, and a mobile node (MN) performs the binding update to LMA. To support the handover, the LMA begins the bicasting of data packets to the New-Mobile Access Gateway (N-MAG) as well as Previous-Mobile Access Gateway (P-MAG). The proposed scheme is compared with the existing PMIPv6 handover by ns-2 simulations. From the numerical analysis, we can see that the proposed scheme can reduce the possible packet losses and handover latency, compared to the existing scheme, during handover in the multi-homing environment.
{"title":"Extension of Proxy Mobile IPv6 with Bicasting for Support of Multi-homing and Mobility in Wireless Networks","authors":"J. Kim, S. Koh","doi":"10.1109/WAINA.2011.96","DOIUrl":"https://doi.org/10.1109/WAINA.2011.96","url":null,"abstract":"This paper proposes an extension of Proxy Mobile IPv6 (PMIPv6) with bicasting for multi-homing and mobility support. In the proposed scheme, the Local Mobility Anchor (LMA) extends its Binding Cache Entry (BCE) for support of multiple bindings, and a mobile node (MN) performs the binding update to LMA. To support the handover, the LMA begins the bicasting of data packets to the New-Mobile Access Gateway (N-MAG) as well as Previous-Mobile Access Gateway (P-MAG). The proposed scheme is compared with the existing PMIPv6 handover by ns-2 simulations. From the numerical analysis, we can see that the proposed scheme can reduce the possible packet losses and handover latency, compared to the existing scheme, during handover in the multi-homing environment.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122889662","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}
Five service types with different priorities are defined to meet the QoS needs for different users, there are UGS, ertPS, rtPS, nrtPS, and BE on the IEEE 802.16 network. First, SS has to send connection request to BS before it is ready to transmit data. Then, SS can be allowed to transmit data white holding the allocated bandwidth from BS. Actually, BS utilizes CAC to identify whether enough bandwidth to serve the new connection requests from SS or not. When the numbers of SS are increasing, the more requests in bandwidth are higher. However, the CAC is to allocate bandwidth in sequence, it may not satisfy the QoS demand. Based on conventional CAC, we propose an enhanced CAC with QoS scheme, called ECQ, to support efficient bandwidth allocation for connection requests of different service types on the IEEE 802.16 PMP mode. Hence, we use QualNet tool to perform some experiments, simulation results indicate that the proposed ECQ scheme can obtain lower CBP about 17.1% and higher Packet Arrival Ratio and Total Packets Received about 19.16% and 29.2% than CAC. Finally, the goals of proposed ECQ are to fix the CAC issue that resource is hold by a specified service type and to achieve better performance on the IEEE 802.16 network.
{"title":"Enhanced CAC with QoS Scheme for Improving the Efficiency of Resource Allocation on the IEEE 802.16 Network","authors":"Shin-Jer Yang, Chun-Hsiu Cheng, Rei-Yao Wu","doi":"10.1109/WAINA.2011.44","DOIUrl":"https://doi.org/10.1109/WAINA.2011.44","url":null,"abstract":"Five service types with different priorities are defined to meet the QoS needs for different users, there are UGS, ertPS, rtPS, nrtPS, and BE on the IEEE 802.16 network. First, SS has to send connection request to BS before it is ready to transmit data. Then, SS can be allowed to transmit data white holding the allocated bandwidth from BS. Actually, BS utilizes CAC to identify whether enough bandwidth to serve the new connection requests from SS or not. When the numbers of SS are increasing, the more requests in bandwidth are higher. However, the CAC is to allocate bandwidth in sequence, it may not satisfy the QoS demand. Based on conventional CAC, we propose an enhanced CAC with QoS scheme, called ECQ, to support efficient bandwidth allocation for connection requests of different service types on the IEEE 802.16 PMP mode. Hence, we use QualNet tool to perform some experiments, simulation results indicate that the proposed ECQ scheme can obtain lower CBP about 17.1% and higher Packet Arrival Ratio and Total Packets Received about 19.16% and 29.2% than CAC. Finally, the goals of proposed ECQ are to fix the CAC issue that resource is hold by a specified service type and to achieve better performance on the IEEE 802.16 network.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127589389","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}
Handover efficiency in wireless and mobile communication networks is an important factor in providing QoS guarantees for real time applications. The 802.11 standard requires a Mobile Node (MN) to scan all the possible channels (11 in the US) to discover available Access Points (AP’s) during a handover. In a given 802.11 cell several channels are expected to be empty. Due to a full scan the MN ends up wasting time scanning empty channels, which results in a high handover delay. This handover delay can be reduced by simple refining the scanning procedure to a limited set of channels, currently being used throughout the network or by the surrounding access points. In this paper we propose to use the Media Independent Information Server (MIIS) to inform the MN of the channel configuration information of the network or the surrounding AP’s. In our scheme the MN acquires channel configuration information from MIIS server and then uses that information to scan a limited set of channels being used by the surrounding access points or through out the network rather than scanning all possible channels resulting in reduced handover delay. We define a parameter NET_CHANNEL_CONFIG which is passed in the query by the MN to the MIIS, so that the MIIS knows which information is being requested by the MN. We also define an Information Element Container IE_CONTAINER_802.11_CHINFO which is used by MIIS to return the requested channel configuration information of the network to the MN. We call our scheme Intelligent Scan.
{"title":"An Intelligent Scan Mechanism for 802.11 Networks by Using Media Independent Information Server (MIIS)","authors":"Muhammad Qasim Khan, S. Andresen","doi":"10.1109/WAINA.2011.26","DOIUrl":"https://doi.org/10.1109/WAINA.2011.26","url":null,"abstract":"Handover efficiency in wireless and mobile communication networks is an important factor in providing QoS guarantees for real time applications. The 802.11 standard requires a Mobile Node (MN) to scan all the possible channels (11 in the US) to discover available Access Points (AP’s) during a handover. In a given 802.11 cell several channels are expected to be empty. Due to a full scan the MN ends up wasting time scanning empty channels, which results in a high handover delay. This handover delay can be reduced by simple refining the scanning procedure to a limited set of channels, currently being used throughout the network or by the surrounding access points. In this paper we propose to use the Media Independent Information Server (MIIS) to inform the MN of the channel configuration information of the network or the surrounding AP’s. In our scheme the MN acquires channel configuration information from MIIS server and then uses that information to scan a limited set of channels being used by the surrounding access points or through out the network rather than scanning all possible channels resulting in reduced handover delay. We define a parameter NET_CHANNEL_CONFIG which is passed in the query by the MN to the MIIS, so that the MIIS knows which information is being requested by the MN. We also define an Information Element Container IE_CONTAINER_802.11_CHINFO which is used by MIIS to return the requested channel configuration information of the network to the MN. We call our scheme Intelligent Scan.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127830400","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}
Toshihiro Ajiki, H. Fukuda, Tomohiro Kokogawa, Junko Itou, J. Munemori
We have developed an image editing application, Quiccamera and an idea generation consistent support system, GUNGEN-SPIRAL II. Quiccamera was created for the idea collection part of GUNGEN-SPIRAL II. Quiccamera can upload data briefly. GUNGEN-SPIRAL II is a Web-based system, which can support shared ideas and the circulation of information for an idea generation method, the KJ method. We applied these two systems to disaster data. From the results of the experiment, we found that we could easily upload ideas using handwriting and a pictograph stamp for photographs with Quiccamera. The evaluation of the pictograph stamp in particular was high. The correspondence of anti-disaster measures created by GUNGEN-SPIRAL II was found to be sufficient.
{"title":"Application to the Disaster Data of an Idea Generation Consistent Support System","authors":"Toshihiro Ajiki, H. Fukuda, Tomohiro Kokogawa, Junko Itou, J. Munemori","doi":"10.1109/WAINA.2011.83","DOIUrl":"https://doi.org/10.1109/WAINA.2011.83","url":null,"abstract":"We have developed an image editing application, Quiccamera and an idea generation consistent support system, GUNGEN-SPIRAL II. Quiccamera was created for the idea collection part of GUNGEN-SPIRAL II. Quiccamera can upload data briefly. GUNGEN-SPIRAL II is a Web-based system, which can support shared ideas and the circulation of information for an idea generation method, the KJ method. We applied these two systems to disaster data. From the results of the experiment, we found that we could easily upload ideas using handwriting and a pictograph stamp for photographs with Quiccamera. The evaluation of the pictograph stamp in particular was high. The correspondence of anti-disaster measures created by GUNGEN-SPIRAL II was found to be sufficient.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128020697","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}
In this paper, the performance of Gigabit Ethernet is evaluated using Windows Vista and Windows Server 2008 as operating systems. Maximum bandwidth achieved for Gigabit Ethernet was approximately 700Mbps that is much lower than the theoretical limit of 1000Mbps.
本文以Windows Vista和Windows Server 2008为操作系统，对千兆以太网的性能进行了评估。千兆以太网实现的最大带宽约为700Mbps，远低于1000Mbps的理论限制。
{"title":"Evaluation of Gigabit Ethernet Local Area Networks in Windows Vista-Server 2008 Environment","authors":"S. S. Kolahi, Burjiz K. Soorty","doi":"10.1109/WAINA.2011.79","DOIUrl":"https://doi.org/10.1109/WAINA.2011.79","url":null,"abstract":"In this paper, the performance of Gigabit Ethernet is evaluated using Windows Vista and Windows Server 2008 as operating systems. Maximum bandwidth achieved for Gigabit Ethernet was approximately 700Mbps that is much lower than the theoretical limit of 1000Mbps.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133838563","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
扫码关注我们
求助内容：
应助结果提醒方式：