Feasibility of SNMP OID compression

به نام خدا

Title: Feasibility of SNMP OID compression

Authors: Hari TS Narayanan a, , Geetha Ilangovan a , Sumitra Narayanan b

Abstract: Simple network management protocol (SNMP) object identi?er (OID) compression can improve bandwidth usage and response time. The current literature includes several OID compres- sion algorithms to reduce redundancy in SNMP protocol data units (PDUs). The overhead of OID compression could outweigh the bene?ts it offers if its tradeoffs are not well understood. The main objective of this paper is to investigate the OID compression as a viable feature for SNMP libraries. This is done by adding an OID compression algorithm to Net-SNMP, which is one of the popular open source implementations of the SNMP framework. Change to image size, lines of code added, complexity of compression code, the effect of compression on response time, and testing effort required are the parameters presented to understand the viability of OID compression.   

Publish Year: 2013

Number of Published in: Information Sciences - Science Direct

Pages: 8

موضوع: فشرده سازی تصویر، فشرده سازی داده ها

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

 

Assessing ICT User Groups

به نام خدا

Title: Assessing ICT User Groups

Authors: Benjamin Weiss, Ina Wechsung, Stefanie Marquardt

Abstract: A questionnaire to assess attitude towards information and communication technology (ICT) and experience with it is developed and evaluated. With 30 items user attributes are collected on six factors. With this questionnaire, individual users can be clustered in accordance with an existing ICT taxonomy. A revised version is proposed after the validation of the first questionnaire. This screening instrument is meant to complement existing methods of assessing competency with technology. Furthermore, the possibility to classify users within the ICT taxonomy provides additional means to analyze data from interaction experiments and to screen prospective participants for usability tests and scientific experiments.   

Publish Year: 2012

Published in: NordiCHI - ACM

Number of Pages: 9

موضوع: فناوری اطلاعات و ارتباطات

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

 

Agile and Efficient MIMO System for Smart Phone Terminals

به نام خدا

Title: Agile and Efficient MIMO System for Smart Phone Terminals

Authors: Osama N Alrabad, Elpiniki P Tsakalaki, Mauro Pelosi, Gert F Pedersen

Abstract: The paper proposes a novel multi-input multi-output (MIMO) system architecture that covers most of the high L TE bands. The system is comprised of four small loop antennas. Each antenna has two ports, one for communication and one for control. The control port is used for tuning the loop antenna where impressive frequency agility using a single capacitor is obtained. A good level of inherent isolation among the four loop antennas is maintained over the different frequency bands. The MIMO performance of the proposed system is evaluated through its spectral efficiency versus frequency. Finally, the information bandwidth of the MIMO system can be defined by comparing its spectral efficiency against the spectral efficiency of three ideal MIMO antennas.   

Publish Year: 2013

Published in: iWat - IEEE

Number of Pages: 4

موضوع: تلفنهای هوشمند

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

Interface-Based Object-Oriented Design with Mock Objects

به نام خدا

Title: Interface-Based Object-Oriented Design with Mock Objects

Authors: Nandigam, J.; Gudivada, V.N.; Hamou-Lhadj, A.; Yonglei Tao

Abstract: Interfaces are fundamental in object-oriented systems. One of the principles of reusable object-oriented design, according to Gamma et al., is program to an interface, not an implementation. Interface-based systems display three key characteristics - flexibility, extensibility, and pluggability. Designing with interfaces is therefore a better way of building object-oriented systems. Getting students in introductory software engineering and design courses to program to interfaces and develop interface-based systems is a challenge. This paper presents our experiences with the use of mock objects to promote interface-based design and effective unit testing in software engineering and design courses.   

Publish Year: 2009

Publisher: ITNG - IEEE

Number of Pages: 6

موضوع: طراحی و تحلیل شی گرا

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

Low Complexity Routing Algorithm for Rearrangeable Switching Networks

به نام خدا

Title: Low Complexity Routing Algorithm for Rearrangeable Switching Networks

Authors: Amitabha Chakrabarty Martin Collier

Abstract: Rearrangeable switching networks have been a topicof interest for a long time among the research community.Routing algorithms for this class of networks have attractedlots of researchers along with other related areas, such asmodification of the networks structure, crosspoints reduction etc.In this paper a new routing algorithm is presented for symmetricrearrangeable networks built with 2 × 2 switching element. Anew matrix based abstraction model is derived to determineconflict free routing paths for each input-output request. Eachstage of a network is mapped into a set of sub-matrices andnumber of matrices in each stage correspond to number ofsubnetworks in that stage. Once the input permutation is given,matrix cells are populated with binary values depending onthe position of the switching elements in the actual hardwareand their mapped matrix cells. These binary values control therouting decision in the underlying hardware. This new routingalgorithm is capable of connection setup for partial permutation,m = ρN , where N is the total input numbers and m is thenumber of active inputs. Overall the serial time complexity ofthis method is O(N logN)1 and O(mlogN) where all N inputsare active and with m < N active inputs respectively. Thetime complexity of this routing algorithm in a parallel machinewith N completely connected processors is O(log2N). With mactive requests the time complexity goes down to O(logmlogN),which is better than the O(log2m + logN), reported in theliterature for 212[(log2Nâˆ_4logN)12âˆ_logN ] ≤ ρ ≤ 1. Later half ofthis paper demonstrates how this routing algorithm is applicablefor crosstalk free routing in optical domain.   

Publish Year: 2013

Publisher: AINA - IEEE

Number of Pages: 8

موضوع: الگوریتم مسیر یابی، شبکه های کامپیوتری

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان