Journal of Information and Computing Science JICS Volume 3, Number 1

Journal Home
Volume 19 - 2024
- Vol. 19, Issue 2 pp.81-190
- Vol. 19, Issue 1 pp.1-80
Volume 18 - 2023
- Vol. 18, Issue 2 pp.81-160
- Vol. 18, Issue 1 pp.1-80
Volume 17 - 2022
- Vol. 17, Issue 2 pp.83-160
- Vol. 17, Issue 1 pp.1-80
Volume 16 - 2021
- Vol. 16, Issue 2 pp.83-159
- Vol. 16, Issue 1 pp.1-80
Volume 15 - 2020
- Vol. 15, Issue 2 pp.83-160
- Vol. 15, Issue 1 pp.1-73
Volume 14 - 2019
- Vol. 14, Issue 4 pp.243-320
- Vol. 14, Issue 3 pp.163-240
- Vol. 14, Issue 2 pp.83-160
- Vol. 14, Issue 1 pp.1-80
Volume 13 - 2018
- Vol. 13, Issue 4 pp.243-320
- Vol. 13, Issue 3 pp.163-240
- Vol. 13, Issue 2 pp.83-160
- Vol. 13, Issue 1 pp.1-80
Volume 12 - 2017
- Vol. 12, Issue 4 pp.243-320
- Vol. 12, Issue 3 pp.163-240
- Vol. 12, Issue 2 pp.83-160
- Vol. 12, Issue 1 pp.1-80
Volume 11 - 2016
- Vol. 11, Issue 4 pp.243-320
- Vol. 11, Issue 3 pp.163-240
- Vol. 11, Issue 2 pp.83-160
- Vol. 11, Issue 1 pp.1-80
Volume 10 - 2015
- Vol. 10, Issue 4 pp.243-320
- Vol. 10, Issue 3 pp.163-240
- Vol. 10, Issue 2 pp.83-160
- Vol. 10, Issue 1 pp.1-80
Volume 9 - 2014
- Vol. 9, Issue 4 pp.243-320
- Vol. 9, Issue 3 pp.163-240
- Vol. 9, Issue 2 pp.83-153
- Vol. 9, Issue 1 pp.1-80
Volume 8 - 2013
- Vol. 8, Issue 4 pp.243-320
- Vol. 8, Issue 3 pp.163-240
- Vol. 8, Issue 2 pp.83-160
- Vol. 8, Issue 1 pp.1-80
Volume 7 - 2012
- Vol. 7, Issue 4 pp.243-320
- Vol. 7, Issue 3 pp.163-240
- Vol. 7, Issue 2 pp.83-160
- Vol. 7, Issue 1 pp.1-80
Volume 6 - 2011
- Vol. 6, Issue 4 pp.243-320
- Vol. 6, Issue 3 pp.163-240
- Vol. 6, Issue 2 pp.83-160
- Vol. 6, Issue 1 pp.1-80
Volume 5 - 2010
- Vol. 5, Issue 4 pp.243-320
- Vol. 5, Issue 3 pp.163-240
- Vol. 5, Issue 2 pp.83-160
- Vol. 5, Issue 1 pp.1-80
Volume 4 - 2009
- Vol. 4, Issue 4 pp.243-320
- Vol. 4, Issue 3 pp.161-239
- Vol. 4, Issue 2 pp.83-160
- Vol. 4, Issue 1 pp.1-80
Volume 3 - 2008
- Vol. 3, Issue 4 pp.243-268
- Vol. 3, Issue 3 pp.163-224
- Vol. 3, Issue 2 pp.83-152
- Vol. 3, Issue 1 pp.1-72
Volume 2 - 2007
- Vol. 2, Issue 4 pp.243-298
- Vol. 2, Issue 3 pp.163-240
- Vol. 2, Issue 2 pp.85-160
- Vol. 2, Issue 1 pp.1-80
Volume 1 - 2006
- Vol. 1, Issue 5 pp.259-317
- Vol. 1, Issue 4 pp.195-256
- Vol. 1, Issue 3 pp.129-192
- Vol. 1, Issue 2 pp.65-128
- Vol. 1, Issue 1 pp.1-64

Volume 3, Number 1

Previous Issue Next Issue

Modeling of Distributed Manufacturing Systems

J. Info. Comput. Sci. , 3 (2008), pp. 03-13.

[An open-access article; the PDF is free to any online user.]

Full PDF 156 2751 Abstract

Stochastic Optimization of Distributed Sampling System Placement for Passive Measurement

J. Info. Comput. Sci. , 3 (2008), pp. 14-20.

[An open-access article; the PDF is free to any online user.]

Full PDF 153 2458 Abstract

Extended Watchdog Mechanism for Wireless Sensor Networks

J. Info. Comput. Sci. , 3 (2008), pp. 21-38.

[An open-access article; the PDF is free to any online user.]

Full PDF 155 2534 Abstract

Abstract

Flow-level traffic measurement is important for network traffic accounting, traffic engineering, and network security. However, flow-level measurement in high speed networks poses great challenges due to the requirements of high packet processing speed and large memory size (high time/space complexity). To reduce these demanding requirements, sampling is usually used and samplers are deployed in the network. But sampling incurs information loss. To address this issue, this paper studies the tradeoff between sampling loss and complexity in distributed sampling system. We formulate the distributed sampling problem as a constrained optimization problem; specifically, maximizing the measurement coverage (i.e., the percentage of sampled traffic among the total traffic) and minimizing the complexity/budget. Considering the stochastic nature of traffic flows, we further formulate the optimization problem under two stochastic criteria: Stochastic Expected Value Optimization criterion (which is concerned with average performance) and Stochastic Chance Constrained Optimization criterion (which is concerned with the distribution of performance measure). Then we propose a Hybrid Intelligent algorithm to decide the optimal deployment strategy for monitors’ placement and the sampling rate at each monitor. Equipped with the proposed algorithm, we are able to address the optimal tradeoff between measurement coverage and deployment cost for networks with random traffic, which has not been studied before. The extensive simulations and experiments demonstrate the effectiveness of our models and algorithm: with careful deployment, monitoring over a small fraction of nodes in a high speed network is sufficient to maintain a high level of measurement coverage.

Dynamical Behaviors of a new Chaotic System and its Adaptive Control

J. Info. Comput. Sci. , 3 (2008), pp. 39-48.

[An open-access article; the PDF is free to any online user.]

Full PDF 162 2539 Abstract

Numerical Solution of Nonlinear Volterra Integral Equations of the Second Kind by Power Series

J. Info. Comput. Sci. , 3 (2008), pp. 49-56.

[An open-access article; the PDF is free to any online user.]

Full PDF 158 2419 Abstract

Projection Algorithm with Line Search for Solving the Convex Feasibility Problem

J. Info. Comput. Sci. , 3 (2008), pp. 57-61.

[An open-access article; the PDF is free to any online user.]

Full PDF 157 2778 Abstract

Permanent: Evaluation by Parallel Algorithm

J. Info. Comput. Sci. , 3 (2008), pp. 62-68.

[An open-access article; the PDF is free to any online user.]

Full PDF 162 2474 Abstract

Hyperchaos Synchronization Between two Different Hyperchaotic Systems

J. Info. Comput. Sci. , 3 (2008), pp. 69-72.

[An open-access article; the PDF is free to any online user.]

Full PDF 161 2383 Abstract

The citation has been copied to your clipboard

- LOGIN -

- E-mail verification -

- REGISTER -