Spelling suggestions: "subject:"networks inn architecture"" "subject:"networks iin architecture""
1 |
Workload balancing in parallel video encoding /Chu, Kai-cheung. January 2000 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2000. / Includes bibliographical references.
|
2 |
Dualtrust a trust management model for swarm-based autonomic computing systems /Maiden, Wendy Marie. January 2010 (has links) (PDF)
Thesis (M.A. in electrical engineering and computer science)--Washington State University, May 2010. / Title from PDF title page (viewed on May 3, 2010). "Department of Electrical Engineering and Computer Science." Includes bibliographical references (p. 110-117).
|
3 |
Cooperative Partial Detection for MIMO Relay NetworksJanuary 2011 (has links)
Cooperative communication has recently re-emerged as a possible paradigm shift to realize the promises of the ever increasing wireless communication market; how- ever, there have been few, if any, studies to translate theoretical results into feasi- ble schemes with their particular practical challenges. The multiple-input multiple- output (MIMO) technique is another method that has been recently employed in different standards and protocols, often as an optional scenario, to further improve the reliability and data rate of different wireless communication applications. In this work, we look into possible methods and algorithms for combining these two tech- niques to take advantage of the benefits of both.
In this thesis, we will consider methods that consider the limitations of practical solutions, which, to the best of our knowledge, are the first time to be considered in this context. We will present complexity reduction techniques for MIMO systems in cooperative systems. Furthermore, we will present architectures for flexible and configurable MIMO detectors. These architectures could support a range of data rates, modulation orders and numbers of antennas, and therefore, are crucial in the different nodes of cooperative systems. The breadth-first search employed in our realization presents a large opportunity to exploit the parallelism of the FPGA in order to achieve high data rates. Algorithmic modifications to address potential sequential bottlenecks in the traditional bread-first search-based SD are highlighted in the thesis.
We will present a novel Cooperative Partial Detection (CPD) approach in MIMO relay channels, where instead of applying the conventional full detection in the relay, the relay performs a partial detection and forwards the detected parts of the message to the destination. We will demonstrate how this approach leads to controlling the complexity in the relay and helping it choose how much it is willing to cooperate based on its available resources. We will discuss the complexity implications of this method, and more importantly, present hardware verification and over-the-air experimentation of CPD using the Wireless Open-access Research Platform (WARP). / NSF grants EIA-0321266, CCF-0541363, CNS-0551692, CNS-0619767, EECS-0925942, and CNS-0923479, Nokia, Xilinx, Nokia Siemens Networks, Texas Instruments, and Azimuth Systems.
|
4 |
Network-on-chip implementation and performance improvement through workload characterization and congestion awarenessGratz, Paul V., January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2008. / Vita. Includes bibliographical references.
|
5 |
Fast performance evaluation and design space exploration of multiprocessor distributed computing platformZhang, Yukan. January 2009 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Electrical and Computer Engineering, 2009. / Includes bibliographical references.
|
6 |
A study of architecture and performance of IBM Cyclops64 interconnection networkZhang, Ying Ping. January 2005 (has links)
Thesis (M.E.E.)--University of Delaware, 2005. / Principal faculty advisor: Guang R. Gao, Dept. of Electrical & Computer Engineering. Includes bibliographical references.
|
7 |
Building a secure short duration transaction network : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science in the University of Canterbury /Gin, Andrew. January 2007 (has links)
Thesis (M. Sc.)--University of Canterbury, 2007. / Typescript (photocopy). Includes bibliographical references (p. 149-159). Also available via the World Wide Web.
|
8 |
An efficient algorithm and architecture for network processorsBatra, Shalini, January 2007 (has links)
Thesis (M.S.)--Mississippi State University. Department of Electrical and Computer Engineering. / Title from title screen. Includes bibliographical references.
|
9 |
Parallel And Pipelined Architectures For High Speed Ip Packet ForwardingErdem, Oguzhan 01 August 2011 (has links) (PDF)
A substantial increase in the number of internet users and the traffic volume bring new challenges
for network router design. The current routers need to support higher link data rates and large number of line cards to accommodate the growth of the internet traffic, which necessitate an increase in physical space, power and memory use.
Packet forwarding, which is one of the major tasks of a router, has been a performance bottleneck
in internet infrastructure. In general, most of the packet forwarding algorithms are implemented in software. However, hardware based solutions has also been popular in recent years because of their high throughput performance. Besides throughput, memory efficiency, incremental/dynamic updates and power consumption are the basic performance challenges for packet forwarding architectures. Hardware-based packet forwarding engines for network routers can be categorized into two groups that are ternary content addressable memory (TCAM) based and dynamic/static random access memory (DRAM/SRAM) based solutions. TCAM-based architectures are simple and hence popular solutions for today&rsquo / s routers. However, they are expensive, power-hungry, and oer little adaptability to new addressing and routing protocols. On the other hand, SRAM has higher density, lower power consumption, and higher speed. The common data structure used in SRAM-based solutions for performing longest prefix matching (LPM) is some type of a tree. In these solutions, multiple memory
accesses are required to find the longest matched prefix. Therefore, parallel and pipelining techniques are used to improve the throughput.
This thesis studies TCAM and SRAM based parallel and pipelined architectures for high performance packet forwarding. We proposed to use a memory efficient disjoint prefix set algorithm on TCAM based parallel IP packet forwarding engine to improve its performance. As a fundamental contribution of this thesis, we designed an SRAM based parallel, intersecting and variable length multi-pipeline array structure (SAFIL) for trie-based internet protocol (IP) lookup. We also proposed a novel dual port SRAM based high throughput IP lookup engine (SAFILD) which is built upon SAFIL. As an alternative to traditional binary trie, we proposed a memory efficient data structure called compact clustered trie (CCT) for IP lookup. Furthermore, we developed a novel combined length-infix pipelined search (CLIPS) architecture for high performance IPv4/v6 lookup on FPGA. Finally, we designed a memory efficient
clustered hierarchical search structure (CHSS) for packet classification. A linear pipelined SRAM-based architecture for CHSS which is implemented on FPGA is also proposed.
|
10 |
Generic telecommunications protocol processor; a programmable architecture.Taylor, Rawdon J. W. January 1900 (has links)
Thesis (M. Eng.)--Carleton University, 1999. / Also available in electronic format on the Internet.
|
Page generated in 0.0837 seconds