دانلود و نمایش مقالات مرتبط با طراحی و تجزیه و تحلیل الگوریتم::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - طراحی و تجزیه و تحلیل الگوریتم

تعداد مقالات یافته شده: 3
ردیف عنوان نوع
1 Clustering Enabled Wireless Channel Modeling Using Big Data Algorithms
مدل سازی خوشه بندی کانال بی سیم فعال با استفاده از الگوریتم های داده های بزرگ-2018
Recently, rapid growth in data services has ushered in the so-called big data era, and data mining and analysis techniques have been widely adopted to extract value from data for different applications. Channel modeling also benefits in this era, in particular by exploiting algorithmic techniques developed for big data applications. In this article, the challenges and opportunities in clustering-enabled wireless channel modeling are discussed in this context. First, some well known clustering techniques, which are potentially capable of enabling clustered channel modeling, are presented. Next, the motivation of cluster-based channel modeling is presented. The typical concepts of clusters used in channel models are summarized, and the state-of-the-art clustering and tracking algorithms are reviewed and compared. Finally, several promising research problems for channel clustering are highlighted.
Keywords: Clustering algorithms, Channel models, Partitioning algorithms, Wireless communication,Data models,Delays, Algorithm design and analysis
مقاله انگلیسی
2 Design and analysis of optimization algorithms to minimize cryptographic processing in BGP security protocols
طراحی و تجزیه و تحلیل الگوریتم های بهینه سازی برای به حداقل رساندن پردازش رمزنگاری در پروتکل های امنیتی BGP-2017
The Internet is subject to attacks due to vulnerabilities in its routing protocols. One proposed approach to attain greater security is to cryptographically protect network reachability announcements exchanged between Border Gateway Protocol (BGP) routers. This study proposes and evaluates the performance and efficiency of various optimization algorithms for validation of digitally signed BGP updates. In particular, this investigation focuses on the BGPSEC (BGP with SECurity extensions) protocol, currently under consid eration for standardization in the Internet Engineering Task Force. We analyze three basic BGPSEC update processing algorithms: Unoptimized, Cache Common Segments (CCS) optimization, and Best Path Only (BPO) optimization. We further propose and study cache management schemes to be used in conjunction with the CCS and BPO algorithms. The performance metrics used in the analyses are: (1) routing table convergence time after BGPSEC peering reset or router reboot events and (2) peak-second signature veri fication workload. Both analytical modeling and detailed trace-driven simulation were performed. Results show that the BPO algorithm is 330% to 628% faster than the unoptimized algorithm for routing table convergence in a typical Internet core-facing provider edge router.
Keywords: Routing security | Border Gateway Protocol security | BGPSEC | Performance optimization | Route processor efficiency
مقاله انگلیسی
3 Communication Cost Efficient Virtualized Network Function Placement for Big Data Processing
Communication Cost Efficient Virtualized Network Function Placement for Big Data Processing-2016
The data explosion in the emerging big data era imposes a big burden on the network infrastructure. This vision has urged the evolution of computer networks. By softwarizing traditional dedicated hardware based functions to virtualized network function (VNF) that can run on standard commodity servers, network function virtualization (NFV) technology promises increased networking efficiency, flexibility and scalability. From the perspective of network service providers, with the consideration of big data traffic volume, one primary concern is on the communication cost, which is highly influenced by the VNF placement strategy. In this paper, we are motivated to investigate the issue on communication cost efficient VNF placement problem for big data processing, with joint consideration of network flow balancing and the predetermined network service semantics. We formulate this problem into a mixed-integer linear programming (MILP) form and then propose a low-complexity relaxationbased heuristic algorithm accordingly. The high efficiency of our proposal is validated by extensive simulation studies.
Keywords: Noise measurement | Big data | Distributed databases | Algorithm design and analysis | Servers | Heuristic algorithms | Semantics
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 3629 :::::::: بازدید دیروز: 0 :::::::: بازدید کل: 3629 :::::::: افراد آنلاین: 72