By Topic

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.

10-12 May 2004

Filter Results

Displaying Results 1 - 25 of 112
  • Exploring core based tree (CBT) in WDM networks

    Publication Year: 2004, Page(s):489 - 494
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1388 KB) | HTML iconHTML

    In this paper, we explore the routing and wavelength assignment problem for the CBT service in a WDM network where k sources need to send data to a common core node. We formally model the problem as a problem of finding k shortest lightpaths from sources to the core subject to the constraint of wavelength collision free. We define and study several subproblems, each addressing a different objectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing multiple light multicast trees in WDM optical networks

    Publication Year: 2004, Page(s):482 - 488
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1533 KB) | HTML iconHTML

    Multicast routing is a fundamental problem in any telecommunication network. We address the multicast issue in a WDM optical network without wavelength conversion capability. To realize a multicast request in such network, it is required to establish multiple light multicast trees (MLMT) sometimes due to the fact that the requested network resources are being occupied by other routing traffic and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal simulation of meshes with dynamically separable buses by meshes with statically partitioned buses

    Publication Year: 2004, Page(s):475 - 480
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1467 KB) | HTML iconHTML

    This paper studies the simulation problem of meshes with separable buses (MSB) by meshes with multiple partitioned buses (MMPB). The MSB and the MMPB are the mesh-connected computers enhanced by the addition of broadcasting buses along every row and column. The broadcasting buses of the MSB, called separable buses, can be dynamically sectioned into smaller bus segments by program control, while th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor mapping technique for communication free data redistribution on symmetrical matrix

    Publication Year: 2004, Page(s):214 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1454 KB) | HTML iconHTML

    In this paper, we present the processor mapping technique to eliminate amount of data exchange in runtime data redistribution on symmetric matrices. The main idea of the proposed technique is to develop mathematical functions for mapping destination processors to a new sequence of processor id. The realigned order of destination processors is then used to perform data redistribution in the receivi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperation of RSVP, DiffServ for frequent and fast intersubnet handoff

    Publication Year: 2004, Page(s):429 - 432
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1403 KB) | HTML iconHTML

    For the problems raised by frequent and fast intersubnet handoff, some methods based on resource reservation protocol (RSVP) extensions or differentiated services (DiffServ) model have been proposed. The merit and drawbacks of these methods are described in this paper respectively. Then a new scheme is proposed which include the merit of RSVP and DiffServ. It can explicitly provide enough quality ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a parallel-plane switching network

    Publication Year: 2004, Page(s):463 - 468
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1677 KB) | HTML iconHTML

    The design and evaluation of a parallel-plane interconnection network are presented in this paper. The proposed network can be used in data networks as well as in distributed computing systems. The proposed network is a cyclic, deflection-routing based, and hierarchical network and is constructed recursively using the Manhattan-type topology as the basic building block. This network exhibits subst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of data distributions with load-balancing for sparse arrays

    Publication Year: 2004, Page(s):207 - 212
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1466 KB) | HTML iconHTML

    In our previous work, we have studied three data distribution schemes, Send Followed Compress (SFC), Compress Followed Send (CFS), and Encoding- Decoding (ED), for sparse arrays based on the traditional matrix representation (TMR) scheme. Since multidimensional arrays can also be represented by the extended Karnaugh map representation (EKMR) scheme, in this paper, we first apply the SFC/CFS/ED sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge number of 3-connected diameter 3 graphs

    Publication Year: 2004, Page(s):364 - 367
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1325 KB) | HTML iconHTML

    Let the decay number, ζ(G) be the minimum number of components of a cotree of a connected graph G. Let Ω be the collection of all 3-connected diameter 3 graphs. In this paper, we prove that if k is the minimum number such that q ≥ 2p - k for each (p,q)-graph G ε Ω, and 1 is the minimum number such that ζ(H) ≤ l - 1 for each graph H ε Ω, then k=l. Further... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A marking scheme using Huffman codes for IP traceback

    Publication Year: 2004, Page(s):421 - 428
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1420 KB) | HTML iconHTML

    In (distributed) denial of service attack ((D)DoS), attackers send a huge number of packets with spoofed source addresses to disguise themselves toward a target host or network Various IP traceback techniques such as link testing, marking, and logging to find out the real source of attacking packets have been proposed. We present a marking scheme (with marking and traceback algorithms) in which a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ring embedding in faulty augmented cubes

    Publication Year: 2004, Page(s):155 - 160
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1388 KB) | HTML iconHTML

    In this paper, we consider the fault hamiltonicity and the fault Hamiltonian connectivity of the augmented cubes AQn. Assume that F ⊆ V(AQn) ∪ E(AQn) and n ≥ 4. We prove that AQn - F is Hamiltonian if |F| ≤ 2n-3 and that AQn - F is Hamiltonian connected if |F| ≤ 2n - 4. Moreover, these bounds are tight. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neighborhood property of OTIS-mesh optoelectronic computer

    Publication Year: 2004, Page(s):458 - 462
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1315 KB) | HTML iconHTML

    It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time with the help of a new indexing scheme called processor data i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to distribute program workload on software DSM clusters

    Publication Year: 2004, Page(s):201 - 206
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1425 KB) | HTML iconHTML

    The workload distribution approaches used by software distributed shared memory (DSM) clusters always distribute the working threads of applications according to the computational power of processors. However, in addition to computational cost, the cost of memory accesses is an important factor for determining program performance. Neglecting this cost will result in making wrong decisions in workl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research of capability of existing network for broadband applications: simulation with x-DSL technology on Indonesian condition

    Publication Year: 2004, Page(s):357 - 362
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1345 KB) | HTML iconHTML

    This paper considers research activities into how much insulation resistance influences data communication via a xDSL system. In Indonesia, insulation resistance has been the only important electrical parameter of copper cable/networks for a long time. Before 2000, knowing whether the cable is good or bad depended on the value of insulation resistance. There is no other measurement for the cable c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive clustering approach to dynamic load balancing

    Publication Year: 2004, Page(s):415 - 420
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB) | HTML iconHTML

    With the rapidly increasing reliance to distributed systems following the prosperity of low cost networking and the Internet, development of effective techniques for task distribution becomes one of the important issues in distributed computing. During the past few years, most of the load balancing algorithms in practical use employed migration policy with a fixed number of tasks in each step. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some analysis on mobile-agent based network routing

    Publication Year: 2004, Page(s):12 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1347 KB) | HTML iconHTML

    Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. This paper focuses on the application of mobile agents in network routing. Two important activity properties of mobile agents are identified: the probability of success (the probability of finding ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fault tolerance of 3-dimensional mesh networks

    Publication Year: 2004, Page(s):149 - 154
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1366 KB) | HTML iconHTML

    In this paper, we study the fault tolerance of 3D mesh networks under a more realistic model in which each network node has an independent failure probability. We develop a novel technique to formally derive lower bounds on the connectivity probability for 3D mesh networks. Our study shows that 3D mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate algorithms for document placement in distributed Web servers

    Publication Year: 2004, Page(s):61 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1460 KB) | HTML iconHTML

    We study approximate algorithms for document placement in distributed Web servers in this paper. With a set S of documents as input, we first give an approximate algorithm for document placement which serves as the fundamental concept of this paper in Section 3. This result improves the load and space bounds of Chen and Choi (2001). Based on this algorithm, we developed an algorithm under the case... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Games networks play a game theoretic approach to networks

    Publication Year: 2004, Page(s):451 - 456
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1333 KB) | HTML iconHTML

    Traditional network protocols such as TCP/IP require cooperation between traffic sources to achieve optimal network performance. This approach does not always work, as evident by frequent congestion problems in the Internet. Recent research in protocol design using game theory removes this limitation by modeling traffic sources as competing players and results in efficient and fair distribution of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the client-server incremental computing

    Publication Year: 2004, Page(s):86 - 91
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB) | HTML iconHTML

    We discuss the problem of finding a dominating sequence for sending the input data items from a low-end client to a server for computational intensive tasks under the realistic assumption of unpredictable communication behaviors. Under the assumption, the client sends the input data items using a specified sequence to maximum the number of computations performed at the server at any moment. The se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High performance hierarchical torus network under matrix transpose traffic patterns

    Publication Year: 2004, Page(s):111 - 116
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1475 KB) | HTML iconHTML

    Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A hierarchical torus network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing in dynamic networks

    Publication Year: 2004, Page(s):193 - 200
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1559 KB) | HTML iconHTML

    Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area mainly focused on static networks. However, observations show that diffusive algorithms, originally designed for these networks, can also be applied in nonstatic scenarios. In this paper we prove that the general diffusion scheme can be deployed on dynamic networks and show tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Next generation Internet

    Publication Year: 2004, Page(s):351 - 356
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1353 KB) | HTML iconHTML

    The emergence of the next generation Internet (NGI) is mainly oriented toward a series of serious challenges that cannot be solved through limited improvement under the current network architecture. Therefore NGI means a series of revolutionary changes including the architecture. The fundamental concept of NGI is illustrated and the current situation of the development of NGI is comprehensively di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying transcriptional regulatory sites in the human genome using an integrated computation

    Publication Year: 2004, Page(s):637 - 642
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1353 KB) | HTML iconHTML

    Recently, biological databases and analytical methods have become available for analyzing gene expression and transcriptional regulatory sequences. However, users must make the complicated analyses to query the data in various databases, and to analyze the gene upstreams using various predictive tools. Beyond methods for predicting transcriptional regulatory sites, new automated and integrated met... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile agents based topology discovery algorithms and modelling

    Publication Year: 2004, Page(s):502 - 507
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1380 KB) | HTML iconHTML

    Mobile agents have been successfully developed/or collecting and processing network management information in the Internet, telecommunications network and other type of networks. Topological information of a network is important to the network administrator and users. Mobile agent based topology discovery algorithms are proposed for both Internet and multicast networks in this paper. Statistical m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic small-world graphs and the eigenvalue power law of Internet

    Publication Year: 2004, Page(s):374 - 379
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB) | HTML iconHTML

    Many relevant real-life networks like the WWW, Internet, transportation and communication networks, or even biological and social networks can be modelled by small-world scale-free graphs. These graphs have strong local clustering (vertices have many mutual neighbors), a small diameter and a distribution of degrees according to a power law. On the other hand, the knowledge of the spectrum of a gra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.