Moonsuk Jang

Node Mapping Algorithm between Torus and Petersen-Torus Networks

In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.

A Comparison of Features of Ajax's Data Formats for the Medicinal Plants Application

The use of Ajax techniques of websites brings web application with more interactive and dynamic interfaces without refreshing the page. This paper presents Ajax framework, jQuery use on the client and generation of simple response data on the server through implementation of medicinal plants web apps. Also this paper describes the features of data format in asynchronous communication. So we easily can understand how to deal with server-side response generation and client-side data processing.

One-to-One Embedding between Hyper Petersen and Petersen-Torus Networks

Once a designed network is embedded into a newly designed network, a developed algorithm in the designed network is reusable in a newly designed network. Petersen-Torus has been designed recently, and Hyper Petersen has already been designed as a well-known interconnection network. In this study, it was proven that Hyper Petersen network whose degree increases with the increased number of nodes can be embedded into a Petersen-Torus network having fixed degree. Hyper Petersen log2 n 2 + 3 was embedded into Petersen-Torus PT(n,n) with expansion 1, dilation 1.5n+2, and congestion 5n. The embedding algorithm was designed for expansion 1, and congestion and dilation are in proportion to O(n) owing to the aspect of Hyper Petersen that the degree increases.

Node Mapping Algorithm between Hypercube and Petersen-Torus Networks

In this study, it was proven that hypercube interconnection network whose degree increases with increased dimensions might be embedded into PT network whose degree is fixed. Hypercube Q log 2 n2+3 was embedded into PT(n,n) at expansion 10/8, dilation 1.5n+2, and congestion 4 n. The mapping algorithm was designed for expansion to approach 1, and congestion and dilation are in proportion to O(n) owing to the aspect of hypercube that the degree increases.

A traffic conditioning algorithm for enhancing the fairness between TCP and UDP flows in diffserv

The Differentiated Services Network (DiffServ) aims to offer differ-ing levels of quality of service to different customers and their traffic flows. One important part of the traffic conditioner in DiffServ is measuring the traffic against the traffic profile and then marking the packets accordingly. In this paper, we propose the enhanced marking algorithm, which can assure the reserved rates of TCP and UDP flows and support fair distribution of excess bandwidth. We experiment with the proposed algorithm using ns-2 simulator. The simulation results show that our proposed marking scheme is rather insensitive of the effect of UDP on TCP throughput, and performs better both in terms of throughput assurance and fair distribution of excess bandwidth in case of well-provisioned and over-provisioned network environment.

Information System for Aquaculture Farms Using WINC Service

To offer effective providing of seawater and selling produced marine products, we need information of tide and product price. Existing system cannot offer effective approaching method since it uses Web-service form under the base of Internet. In this research, we suggest providing plan of tide information in detailed areas, by using mobile interface. On mobile device, we increased the users accessibility by describing tide information to 3 types, table, graph and calendar. Next, we suggest information retrieval service of product price on mobile device. Also, they can make decision when to sell their products by using cellular phone. Especially, it is useful to aquaculture farmer to retrieve information from the server because they are restricted by where they are.

Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks

In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.