Institutions
|
About Us
|
Help
|
Gaeilge
0
1000
Home
Browse
Advanced Search
Search History
Marked List
Statistics
A
A
A
Show search options
Hide search options
Search using:
All
Any
None of these
Exact Phrase
in
Keyword (All Fields)
Title
Author
Subject
Institution
Funder
All
Any
None of these
Exact Phrase
in
Keyword (All Fields)
Title
Author
Subject
Institution
Funder
All
Any
None of these
Exact Phrase
in
Keyword (All Fields)
Title
Author
Subject
Institution
Funder
From
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
1986
1985
1984
1983
1982
1981
1980
1979
1978
1977
1976
1975
1974
1973
1972
1971
1970
1969
1968
1967
1966
1965
1964
1963
1962
1961
1960
1959
1958
1957
1956
1955
1954
1953
1952
1951
1950
1949
1948
1947
1946
1944
1943
1942
1941
1940
1939
1938
1937
1936
1935
1934
1933
1932
1931
1930
1929
1928
1927
1925
1923
1920
1919
1917
1915
1914
1913
1912
1911
1909
1908
1907
1906
1905
1904
1903
1902
1901
1900
1899
1898
1897
1896
1895
1894
1893
1892
1891
1890
1889
1888
1887
1886
1885
1884
1883
1882
1881
1880
1879
1878
1877
1876
1875
1874
1873
1872
1871
1870
1869
1867
1866
1865
1864
1862
1861
1859
1858
1857
1856
1855
1854
1853
1852
1851
1849
To
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
1986
1985
1984
1983
1982
1981
1980
1979
1978
1977
1976
1975
1974
1973
1972
1971
1970
1969
1968
1967
1966
1965
1964
1963
1962
1961
1960
1959
1958
1957
1956
1955
1954
1953
1952
1951
1950
1949
1948
1947
1946
1944
1943
1942
1941
1940
1939
1938
1937
1936
1935
1934
1933
1932
1931
1930
1929
1928
1927
1925
1923
1920
1919
1917
1915
1914
1913
1912
1911
1909
1908
1907
1906
1905
1904
1903
1902
1901
1900
1899
1898
1897
1896
1895
1894
1893
1892
1891
1890
1889
1888
1887
1886
1885
1884
1883
1882
1881
1880
1879
1878
1877
1876
1875
1874
1873
1872
1871
1870
1869
1867
1866
1865
1864
1862
1861
1859
1858
1857
1856
1855
1854
1853
1852
1851
1849
Optionally, filter by:
(Leave unchecked to search all fields)
Item Type
Book
Book chapter
Conference item
Contribution to newspaper/magazine
Doctoral thesis
Journal article
Master thesis (research)
Master thesis (taught)
Multimedia
Patent
Report
Review
Working paper
Other
Peer Review Status
Peer reviewed
Non peer reviewed
Unknown
Institution
Dublin City University
Dublin Institute of Technology
NUI Galway
NUI Maynooth
Trinity College Dublin
University College Cork
University College Dublin
University of Limerick
Funder
Enterprise Ireland (EI)
Environmental Protection Agency (EPA)
Health Research Board (HRB)
Higher Education Authority (HEA)
Irish Aid
Irish Research Council for Humanities and Social Sciences (IRCHSS)
Irish Research Council for Science Engineering and Technology (IRCSET)
Marine Institute
Science Foundation Ireland (SFI)
Teagasc
Language
Irish
English
Danish
French
German
Interlingue; Occidental
Italian
Japanese
Spanish; Castilian
Current Search:
All of 'Hamilton' and 'Institute' in all fields;
338 items found
Sort by
Relevance
Title
Author
Item type
Date
Institution
Peer review status
Language
Order
Ascending
Descending
25
50
100
per page
1
2
3
4
5
6
7
8
9
10
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Displaying Results 76 - 100 of 338 on page 4 of 14
Marked
Mark
Channel dependent interference and decentralized colouring
(2007)
Clifford, P.; Leith, D. J.
Channel dependent interference and decentralized colouring
(2007)
Clifford, P.; Leith, D. J.
Abstract:
We consider channel allocation to mitigate interference be- tween wireless LANs. The channel allocation task is often formulated in the literature as finding a proper colouring of a single graph. We show that the interference between WLANs can be channel dependent in which case a different conflict graph is associated with each channel. Channel allocation then corresponds to a multi-graph colouring problem. This potentially has profound implications as the behaviour of many proposed colouring-based algorithms for channel allocation is unclear in a multi-graph context. We prove that a recently proposed decentralized colouring algorithm performs correctly in the multi-graph setting. We also present a new, extended version of this algorithm suited to a wide range of multi-radio architectures.
http://eprints.nuim.ie/1710/
Marked
Mark
Quadratic and copositive Lyapunov Functions and the stability of positive switched linear systems.
(2007)
Mason, Oliver; Shorten, Robert
Quadratic and copositive Lyapunov Functions and the stability of positive switched linear systems.
(2007)
Mason, Oliver; Shorten, Robert
Abstract:
We present some new results concerning the stability of positive switched linear systems. In particular, we present a necessary and suf£cient condition for the existence of copositive linear Lyapunov functions for switched systems with two constituent linear time-invariant (LTI) systems. We also extend some recent results on quadratic stability for positive switched linear systems.
http://eprints.nuim.ie/1711/
Marked
Mark
An Application of Gaussian mixtures: colour segmenting for the four legged league using HSI colour space.
(2008)
Henderson, Naomi; King, Robert; Middleton, Richard H.
An Application of Gaussian mixtures: colour segmenting for the four legged league using HSI colour space.
(2008)
Henderson, Naomi; King, Robert; Middleton, Richard H.
Abstract:
In the colour coded environment of the RoboCup 4 Legged League it is crucial to extract as much colour information as possible from an image without error. To do this requires hours of manual YUV pixel mapping and testing to ensure robustness under all possible lighting conditions. The YUV colour space is a very convenient standard for transmission of video data, but for colour classification and segmentation it suffers from being non-intuitive and sensitive to changes in lighting. Alternatively, colour classification principles can be applied in an HSI colour space; one of the convenient characteristics of the HSI colour space is that the hue value, H, represents the colour wavelength information. From this concept it is easier to separate and label colour regions in an automated process as the theoretical hue and colour wavelength relationship is known. By fitting a Gaussian model using mixtures to HSI histograms we can generate boundaries of colour classes in HSI colour space.
http://eprints.nuim.ie/1712/
Marked
Mark
Stabilization with Disturbance Attenuation over a Gaussian Channel
(2007)
Freudenberg, J.S.; Middleton, R.H.; Braslavsky, J.H.
Stabilization with Disturbance Attenuation over a Gaussian Channel
(2007)
Freudenberg, J.S.; Middleton, R.H.; Braslavsky, J.H.
Abstract:
We propose a linear control and communication scheme for the purposes of stabilization and disturbance attenuation when a discrete Gaussian channel is present in the feedback loop. Specifically, the channel input is amplified by a constant gain before transmission and the channel output is processed through a linear time invariant filter to produce the control signal. We show how the gain and filter may be chosen to minimize the variance of the plant output. For an order one plant, our scheme achieves the theoretical minimum taken over a much broader class of compensators.
http://eprints.nuim.ie/1722/
Marked
Mark
A reactive approach for mining project evaluation under price uncertainty.
(2007)
Zhang, Meimei; Middleton, Richard H.; Stone, Peter M.; Menabde, Merab
A reactive approach for mining project evaluation under price uncertainty.
(2007)
Zhang, Meimei; Middleton, Richard H.; Stone, Peter M.; Menabde, Merab
Abstract:
Projects in the mining industry are undertaken with the objective of maximizing economic value, which is near-universally measured by the Net Present Value (NPV), considering all capital expenditure and operating cash flow. This industry is usually considered high risk because of historically volatile commodity prices (directly impacting revenues) and the fact that very large capital expenditures are required upfront for the construction of processing, mining and transport infrastructure. In order to optimize overall investment returns in a mining project, it is thus essential to use the best possible project valuation method so that the sizing of initial capital expenditures are appropriate to the expected returns and risks. A commonly used method for mining project evaluation calculates the expected NPV of a mine plan based upon the expected future commodity price given the current spot price. This method often undervalues a mining project since it ignores future price uncertainty...
http://eprints.nuim.ie/1714/
Marked
Mark
BodySpace: inferring body pose for natural control of a music player
(2007)
Strachan, Steven; Murray-Smith, Roderick; O’Modhrain, Sile
BodySpace: inferring body pose for natural control of a music player
(2007)
Strachan, Steven; Murray-Smith, Roderick; O’Modhrain, Sile
Abstract:
We describe the BodySpace system, which uses inertial sensing and pattern recognition to allow the gestural control of a music player by placing the device at different parts of the body. We demonstrate a new approach to the segmentation and recognition of gestures for this kind of application and show how simulated physical model-based techniques can shape gestural interaction.
http://eprints.nuim.ie/1704/
Marked
Mark
Show me the way to Monte Carlo: density based trajectory navigation.
(2007)
Strachan, Steven; Williamson, John; Murray-Smith, Roderick
Show me the way to Monte Carlo: density based trajectory navigation.
(2007)
Strachan, Steven; Williamson, John; Murray-Smith, Roderick
Abstract:
We demonstrate the use of uncertain prediction in a system for pedestrian navigation via audio with a combination of Global Positioning System data, a music player, inertial sensing, magnetic bearing data and Monte Carlo sampling for a density following task, where a listener’s music is modulated according to the changing predictions of user position with respect to a target density, in this case a trajectory or path. We show that this system enables eyes-free navigation around set trajectories or paths unfamiliar to the user and demonstrate that the system may be used effectively for varying trajectory width and context.
http://eprints.nuim.ie/1705/
Marked
Mark
Dynamics of tilt-based browsing on mobile devices.
(2007)
Cho, Sung-Jung ; Murray-Smith, Roderick; Choi, Changkyu; Sung, Younghoon ; Lee, Kwanghy...
Dynamics of tilt-based browsing on mobile devices.
(2007)
Cho, Sung-Jung ; Murray-Smith, Roderick; Choi, Changkyu; Sung, Younghoon ; Lee, Kwanghyeon; Kim, Yeun-Bae
Abstract:
A tilt-controlled photo browsing method for small mobile devices is presented. The implementation uses continuous inputs from an accelerometer, and a multimodal (visual, audio and vibrotactile) display coupled with the states of this model. The model is based on a simple physical model, with its characteristics shaped to enhance usability. We show how the dynamics of the physical model can be shaped to make the handling qualities of the mobile device fit the browsing task. We implemented the proposed algorithm on Samsung MITs PDA with tri-axis accelerometer and a vibrotactile motor. The experiment used seven novice users browsing from 100 photos. We compare a tilt-based interaction method with a buttonbased browser and an iPod wheel. We discuss the usability performance and contrast this with subjective experience from the users. The iPod wheel has significantly poorer performance than button pushing or tilt interaction, despite its commercial popularity.
http://eprints.nuim.ie/1706/
Marked
Mark
On the Dynamics of TCP’s Higher Moments
(2007)
Shorten, Robert N.; Kellett, Christopher M.; Leith, Douglas J.
On the Dynamics of TCP’s Higher Moments
(2007)
Shorten, Robert N.; Kellett, Christopher M.; Leith, Douglas J.
Abstract:
In this paper we extend a recently derived positive systems model for TCP to capture the dynamics of TCP’s higher order moments in drop-tail environments. Experimental results are given to illustrate the accuracy of our model.
http://eprints.nuim.ie/1707/
Marked
Mark
Router-based algorithms for improving internet quality of service.
(2007)
Stanojević, Rade
Router-based algorithms for improving internet quality of service.
(2007)
Stanojević, Rade
Abstract:
We begin this thesis by generalizing some results related to a recently proposed positive system model of TCP congestion control algorithms. Then, motivated by a mean ¯eld analysis of the positive system model, a novel, stateless, queue management scheme is designed: Multi-Level Comparisons with index l (MLC(l)). In the limit, MLC(l) enforces max-min fairness in a network of TCP flows. We go further, showing that counting past drops at a congested link provides su±cient information to enforce max-min fairness among long-lived flows and to reduce the flow completion times of short-lived flows. Analytical models are presented, and the accuracy of predictions are validated by packet level ns2 simulations. We then move our attention to e±cient measurement and monitoring techniques. A small active counter architecture is presented that addresses the problem of accurate approximation of statistics counter values at very-high speeds that can be both updated and estimated on a per-packet ba...
http://eprints.nuim.ie/1708/
Marked
Mark
The LOST Algorithm: finding lines and separating speech mixtures
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
The LOST Algorithm: finding lines and separating speech mixtures
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
Robust clustering of data into linear subspaces is a frequently encountered problem. Here, we treat clustering of one-dimensional subspaces that cross the origin. This problem arises in blind source separation, where the subspaces correspond directly to columns of a mixing matrix. We propose the LOST algorithm, which identifies such subspaces using a procedure similar in spirit to EM. This line finding procedure combined with a transformation into a sparse domain and an L1-norm minimisation constitutes a blind source separation algorithm for the separation of instantaneous mixtures with an arbitrary number of mixtures and sources. We perform an extensive investigation on the general separation performance of the LOST algorithm using randomly generated mixtures, and empirically estimate the performance of the algorithm in the presence of noise. Furthermore, we implement a simple scheme whereby the number of sources present in the mixtures can be detected automatically
http://eprints.nuim.ie/1699/
Marked
Mark
Next generation TCP: open questions.
(2008)
Leith, Douglas J.; Shorten, Robert N.
Next generation TCP: open questions.
(2008)
Leith, Douglas J.; Shorten, Robert N.
Abstract:
While there has been significant progress in recent years in the development of TCP congestion control algorithms for high BDP paths, consensus remains lacking with regard to a number of basic issues. The aim of the present paper is to highlight some of these key bottleneck issues and present a number of new results with a view to promoting discussion and fostering progress. Issues highlighted include: impact of shape of cwnd evolution (concave, convex etc), increased variability in throughputs in unsynchronised environments when more aggressive algorithms are used, impact of proposed changes on convergence rates and network responsiveness and the associated impact on user experience.
http://eprints.nuim.ie/1701/
Marked
Mark
Multimodal, Embodied and Location-Aware Interaction
(2007)
Strachan, Steven
Multimodal, Embodied and Location-Aware Interaction
(2007)
Strachan, Steven
Abstract:
This work demonstrates the development of mobile, location-aware, eyes-free applications which utilise multiple sensors to provide a continuous, rich and embodied interaction. We bring together ideas from the fields of gesture recognition, continuous multimodal interaction, probability theory and audio interfaces to design and develop location-aware applications and embodied interaction in both a small-scale, egocentric body-based case and a large-scale, exocentric `world-based' case. BodySpace is a gesture-based application, which utilises multiple sensors and pattern recognition enabling the human body to be used as the interface for an application. As an example, we describe the development of a gesture controlled music player, which functions by placing the device at different parts of the body. We describe a new approach to the segmentation and recognition of gestures for this kind of application and show how simulated physical model-based interaction techniques and the us...
http://eprints.nuim.ie/1703/
Marked
Mark
Best achievable tracking performance in sampled-data systems via LTI controllers.
(2008)
Chen, Jie; Hara, Shinji; Qiu, Li; Middleton, Richard H.
Best achievable tracking performance in sampled-data systems via LTI controllers.
(2008)
Chen, Jie; Hara, Shinji; Qiu, Li; Middleton, Richard H.
Abstract:
In this paper we study the problem of tracking a step reference signal using sampled-data control systems. We are interested in the tracking performance, defined as the integral square of the tracking error response between the system’s output and the reference input. This performance is deemed the best achievable by a sampled-data controller with a linear time-invariant discrete-time compensator if it is the minimal attainable by all such controllers that stabilize the system. Our primary objective is to investigate the fundamental tracking performance limit in sampled-data systems, and to understand whether and how sampling and hold in a sampled-data system may impose intrinsic barriers to performance. We consider two tracking performance measures, with one defined with respect to the unit step signal, and another with respect to a delayed step signal and averaged over one sampling period. We derive an analytical closed-form expression in each case for the best achievable performa...
http://eprints.nuim.ie/1695/
Marked
Mark
Making available base-RTT for use in congestion control applications.
(2008)
Leith, D.J; Shorten, R.N.; McCullagh, G.; Dunn, Larry; Baker, Fred
Making available base-RTT for use in congestion control applications.
(2008)
Leith, D.J; Shorten, R.N.; McCullagh, G.; Dunn, Larry; Baker, Fred
Abstract:
In this paper we revisit the interaction between baseRTT estimation and congestion control action. We develop a simple AIMD-based scheme that allows network buffers to drain and thus demonstrate in a constructive manner that, with proper design, it is indeed possible for flows traversing a bottleneck link to estimate their base RTT reliably.
http://eprints.nuim.ie/1696/
Marked
Mark
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, where the resultant algorithm has multiplicative updates and utilises the beta divergence as its reconstruction objective. In combination with a spectral magnitude transform of speech, this method discovers auditory objects that resemble speech phones along with their associated sparse activation patterns. We use these in a supervised separation scheme for monophonic mixtures, finding improved separation performance in comparison to classic convolutive NMF.
http://eprints.nuim.ie/1697/
Marked
Mark
Piezoelectric power scavenging of mechanical vibration energy
(2007)
Singh, U.K.; Middleton, R.H.
Piezoelectric power scavenging of mechanical vibration energy
(2007)
Singh, U.K.; Middleton, R.H.
Abstract:
The process of acquiring the energy surrounding a system and converting it into usable electrical energy is termed power harvesting. With piezoceramic materials, it is possible to harvest power from vibrating structures. It has been proven that micro-to milliwatts of power can be generated from vibrating systems. The project targets the transformation of mechanical vibration into electrical energy using piezoelectric material. In some mining applications, eg water jet drilling; large high frequency vibrations may be present. If successfully harvested, this energy could be used to eliminate batteries in wireless sensors. This article presents a model of a piezoelectric transducer, a mechanical vibration spectrum, the simulation of the model, prototype of the power scavenging circuit, experimental results and its future perspectives.
http://eprints.nuim.ie/1694/
Marked
Mark
Exploring delay-based tcp congestion control
(2008)
McCullagh, Gavin D.
Exploring delay-based tcp congestion control
(2008)
McCullagh, Gavin D.
Abstract:
The thesis begins with a short review of TCP and new congestion control schemes in Chapter 2. Following this, chapter 3 explores the question of whether correlation between congestion and the delay signal of each flow on a link is really necessary for delay-based congestion control to function. It also explores the behaviour of the delay-based AIMD (DB-AIMD) algorithm in various network environments. Chapter 4 presents an experimental study into the effectiveness of a particular delay-based methodology for emptying network queues where congestion is detected. Finally, chapter 5 discussed some practical issues involved in how one measures RTT in practice for the purposes of congestion control.
http://eprints.nuim.ie/1693/
Marked
Mark
Wireless Network Measurement: VoIP and 802.11e.
(2007)
Dangerfield, Ian
Wireless Network Measurement: VoIP and 802.11e.
(2007)
Dangerfield, Ian
Abstract:
802.11 wireless networks are a convenient way to provide ‘last-hop’ network connections in many environments. However the distributed nature of their operation poses problems in providing quality of service guarantees, which are vital for providing interactive services such as Voice over IP. In this thesis we will review the operation of 802.11 and it’s extended MAC layer, 802.11e. We will then review some analytical models used to explore the behaviour of the 802.11 MAC and test some of the assumptions underlying these models. We confirm that our testbed operates according to the standards before using it to explore the behaviour of VoIP traffic, using it as a test case to examine the provision of quality of service guarantees via the extended 802.11e MAC. This work is based on several papers [9] [19] [10].
http://eprints.nuim.ie/1692/
Marked
Mark
Many-sources large deviations for max-weight scheduling
(2008)
Kittipiyakul, Somsak; Javidi, Tara; Subramanian, Vijay G.
Many-sources large deviations for max-weight scheduling
(2008)
Kittipiyakul, Somsak; Javidi, Tara; Subramanian, Vijay G.
Abstract:
In this paper, we establish a many-sources large deviations principle (LDP) for the stationary workload of a multi-queue single-server system with simplex capacity, operated under a stabilizing and non-idling maximum-weight scheduling policy. Assuming a many-sources sample path LDP for the arrival processes, we establish an LDP for the workload process by employing Garcia’s extended contraction principle that is applicable to quasi-continuous mappings. The LDP result can be used to calculate asymptotic buffer overflow probabilities accounting for the multiplexing gain, when the arrival process is an average of i.i.d. processes. We express the rate function for the stationary workloads in term of the rate functions of the finite-horizon workloads when the arrival processes have i.i.d. increments.
http://eprints.nuim.ie/1686/
Marked
Mark
On a class of optimal rateless codes
(2008)
Subramanian, Vijay G.; Leith, Douglas J.
On a class of optimal rateless codes
(2008)
Subramanian, Vijay G.; Leith, Douglas J.
Abstract:
Abstract—In this paper we analyze a class of systematic fountain/rateless codes constructed using Bernoulli(1=2) random variables. Using simple bounds we then show that this class of codes stochastically minimizes the number of coded packets receptions needed to successfully decode all the information packets. This optimality holds over a large class of random codes that includes Bernoulli(q) random codes with q ≤ 1/2 and LT codes. We then conclude by demonstrating asymptotic optimality for intermediate decoding of the same codes.
http://eprints.nuim.ie/1684/
Marked
Mark
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, where the resultant algorithm has multiplicative updates and utilises the beta divergence as its reconstruction objective. In combination with a spectral magnitude transform of speech, this method discovers auditory objects that resemble speech phones along with their associated sparse activation patterns. We use these in a supervised separation scheme for monophonic mixtures, finding improved separation performance in comparison to classic convolutive NMF.
http://eprints.nuim.ie/1685/
Marked
Mark
Complexity analysis of a decentralised graph colouring algorithm
(2008)
Duffy, K.R.; O’Connell, N.; Sapozhnikov, A.
Complexity analysis of a decentralised graph colouring algorithm
(2008)
Duffy, K.R.; O’Connell, N.; Sapozhnikov, A.
Abstract:
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph’s global structure is particuarly challenging. In this article we analyse the complexity of a decentralised colouring algorithm that has recently been proposed for channel selection in wireless computer networks.
http://eprints.nuim.ie/1677/
Marked
Mark
On the fair coexistence of loss and delay-based TCP
(2008)
Budzisz, Lukasz; Stanojević, Rade; Schlote, Arieh; Shorten, Robert; Baker, Fred
On the fair coexistence of loss and delay-based TCP
(2008)
Budzisz, Lukasz; Stanojević, Rade; Schlote, Arieh; Shorten, Robert; Baker, Fred
Abstract:
Abstract—Delay-based TCP variants continue to attract a large amount of attention in the networking community. Potentially, they offer the possibility to efficiently use network resources while at the same time achieving low queueing delay and virtually zero packet loss. One major impediment to the deployment of delay-based TCP variants is their inability to coexist fairly with standard loss-based TCP. In this paper we propose a simple strategy to make the fair coexistence possible and to ensure that delay-based flows will revert back to the delay-based operation when loss-based flows are no longer present. Analytical and ns-2 simulation results are presented to validate the proposed algorithm.
http://eprints.nuim.ie/1679/
Marked
Mark
Small active counters
(2007)
Stanojević, Rade
Small active counters
(2007)
Stanojević, Rade
Abstract:
The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications require a large number of counters in order to identify important traffic characteristics. And secondly, at high speeds, current memory devices have significant limitations in terms of speed (DRAM) and size (SRAM). For some applications no information on counters is needed on a per-packet basis and several methods have been proposed to handle this problem with low SRAM memory requirements. However, for a number of applications it is essential to have the counter information on every packet arrival. In this paper we propose two, computationally and memory efficient, randomized algorithms for approximating the counter values. We prove that proposed estimators are unbiased and give variance bounds. A case study on Multistage Filters (MSF) over the real Internet traces shows a significant improvement by using the active ...
http://eprints.nuim.ie/1682/
Displaying Results 76 - 100 of 338 on page 4 of 14
1
2
3
4
5
6
7
8
9
10
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Item Type
Book chapter (38)
Conference item (64)
Doctoral thesis (13)
Journal article (206)
Master thesis (research) (7)
Multimedia (1)
Report (6)
Working paper (1)
Other (2)
Institution
NUI Maynooth (328)
University College Dublin (1)
Dublin Institute of Technology (9)
Peer Review Status
Peer reviewed (255)
Non peer reviewed (83)
Year
2012 (3)
2011 (12)
2010 (37)
2009 (53)
2008 (59)
2007 (67)
2006 (50)
2005 (21)
2004 (8)
2003 (6)
2002 (3)
2001 (2)
2000 (5)
1999 (5)
1998 (4)
1997 (1)
1996 (2)
built by Enovation Solutions