The Experts below are selected from a list of 19521 Experts worldwide ranked by ideXlab platform
Yang Xu - One of the best experts on this subject based on the ideXlab platform.
-
cab a reactive wildcard rule caching system for software defined networks
ACM Special Interest Group on Data Communication, 2014Co-Authors: Yang Xu, Hongya Xing, Kang Xi, Jonathan H. ChaoAbstract:Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high Storage Overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small Storage Overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.
-
HotSDN - CAB: a reactive wildcard rule caching system for software-defined networks
Proceedings of the third workshop on Hot topics in software defined networking - HotSDN '14, 2014Co-Authors: Yang Xu, Hongya Xing, Kang Xi, H. Jonathan ChaoAbstract:Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high Storage Overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small Storage Overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.
Dominique Thiebaut - One of the best experts on this subject based on the ideXlab platform.
-
Two economical directory schemes for large-scale cache coherent multiprocessors
ACM SIGARCH Computer Architecture News, 1991Co-Authors: Yeong-chang Maa, Dhiraj K. Pradhan, Dominique ThiebautAbstract:Cache coherence problem is a major issue in the design of shared-memory multiprocessors. As the number of processors grows, traditional bus-based snoopy schemes for cache coherence are no longer adequate. Instead, the directory-based scheme is a promising alternative for the large-scale cache coherence problem. However, the Storage Overhead of (full-map) directory scheme may become too prohibitive as the system size goes up. This paper presents two distributed directory schemes, the tree directory and the hierarchical full-map directory, to deal with the Storage Overhead problem. Preliminary trace-driven evaluations show that the performance of our schemes compares favorably to the full-map directory scheme, while reducing the Storage Overhead by over 90%. These two schemes should lend themselves to the design and implementation of large-scale cache coherent multiprocessors.
-
IPPS - A hierarchical directory scheme for large-scale cache-coherent multiprocessors
Proceedings Sixth International Parallel Processing Symposium, 1Co-Authors: Yeong-chang Maa, Dhiraj K. Pradhan, Dominique ThiebautAbstract:Cache coherence problem is a major design issue for shared-memory multiprocessors. As the system size scales, traditional bus-based snoopy cache coherence schemes are no longer adequate. Instead, the directory-based scheme is a promising approach to deal with the large-scale cache coherence problem. However, the Storage Overhead of directory schemes often becomes too prohibitive as the system size increases. The paper proposes the hierarchical full-map directory to reduce the Storage requirement while still achieving satisfactory performance. The key point is to exploit the inherent geographical interprocessor locality among shared data in the parallel programs. Trace-driven evaluations show that the performance of the proposed scheme compares competitively to the full-map directory scheme, while reducing the Storage Overhead by over 90%. The proposed hierarchical full-map directory scheme seems to be a promising hardware approach for handling cache coherence in the design of future large-scale multiprocessor memory systems. >
H. Jonathan Chao - One of the best experts on this subject based on the ideXlab platform.
-
HotSDN - CAB: a reactive wildcard rule caching system for software-defined networks
Proceedings of the third workshop on Hot topics in software defined networking - HotSDN '14, 2014Co-Authors: Yang Xu, Hongya Xing, Kang Xi, H. Jonathan ChaoAbstract:Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high Storage Overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small Storage Overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.
Jonathan H. Chao - One of the best experts on this subject based on the ideXlab platform.
-
cab a reactive wildcard rule caching system for software defined networks
ACM Special Interest Group on Data Communication, 2014Co-Authors: Yang Xu, Hongya Xing, Kang Xi, Jonathan H. ChaoAbstract:Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high Storage Overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small Storage Overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.
Hongya Xing - One of the best experts on this subject based on the ideXlab platform.
-
cab a reactive wildcard rule caching system for software defined networks
ACM Special Interest Group on Data Communication, 2014Co-Authors: Yang Xu, Hongya Xing, Kang Xi, Jonathan H. ChaoAbstract:Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high Storage Overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small Storage Overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.
-
HotSDN - CAB: a reactive wildcard rule caching system for software-defined networks
Proceedings of the third workshop on Hot topics in software defined networking - HotSDN '14, 2014Co-Authors: Yang Xu, Hongya Xing, Kang Xi, H. Jonathan ChaoAbstract:Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high Storage Overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small Storage Overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.
