start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=427 end-page=432 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=200511 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=A Method of Dynamic Interconnection of VLANs for Large Scale VLAN Environment en-subtitle= kn-subtitle= en-abstract= kn-abstract=

VLAN (Virtual LAN) is a technology which can configure logical networks independent of the physi cal network structure. With VLAN, users in common spaces (such as meeting rooms) can access to their department networks temporarily because changing of logical network structure is achieved only by con figuration of VLAN switches. However, in the general configuration method, because VLANs are managed statically by admin istrators, various problems such as high adminis trative cost and conflict or insufficiency of VLAN IDs may arise especially in large scale organiza tions where VLANs are managed by each depart ment. To solve these problems, we propose a method which provides an interconnection between a tem porary configured VLAN in a common space and a VLAN of a userfs department. In the proposed method, a user in a common space can access to his/her department network seamlessly by convert ing a temporary VLAN-ID in the common space and a VLAN-ID used in his/her department each other automatically. The effectiveness of the pro posed method is confirmed by the experiment on the actual network using VLAN managers, VLAN ID converters and authentication servers based on the proposed method.

en-copyright= kn-copyright= en-aut-name=OkayamaKiyohiko en-aut-sei=Okayama en-aut-mei=Kiyohiko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamaiNariyoshi en-aut-sei=Yamai en-aut-mei=Nariyoshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=MiyashitaTakuya en-aut-sei=Miyashita en-aut-mei=Takuya kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=KawanoKeita en-aut-sei=Kawano en-aut-mei=Keita kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=OkamotoTakuji en-aut-sei=Okamoto en-aut-mei=Takuji kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Tsuyama National College of Technology affil-num=4 en-affil= kn-affil=Okayama University affil-num=5 en-affil= kn-affil=Okayama University of Science END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=89 end-page=94 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=200511 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=A framework for mobile agent systems with the capability of preceding and following users en-subtitle= kn-subtitle= en-abstract= kn-abstract=

As one of mobile agent applications, many systems which provide continuous service for users moving on a network have been proposed. In these systems, because a movement of mobile agents is performed after a user movement, users must wait for arrival of mobile agents. To reduce users' waiting time, we propose a fundamental framework for mobile agent systems where an agent can move precedently before a user movement. In our frame-work, it is assumed that computers are connected on a network and users with rewritable devices move on the network. The framework supports precedent movement ofmobile agents based on prediction using movement history of users. Because the prediction may be wrong, the framework also provides the following movement of mobile agents. Moreover, the framework provides a recovery method of mobile agents in service in case that mobile agents disappear due to problems such as their bugs. Because we provide some APIs, via which various functions of our framework are accessed, developers of mobile agent systems can easily use our framework using the APIs. We implemented an experimental agent system using the APIs and confirmed that the framework perforned correctly using the experimental system.

en-copyright= kn-copyright= en-aut-name=YokohiraTokumi en-aut-sei=Yokohira en-aut-mei=Tokumi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=OkayamaKiyohiko en-aut-sei=Okayama en-aut-mei=Kiyohiko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=MurakamiTakashi en-aut-sei=Murakami en-aut-mei=Takashi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=TakarakoKayo en-aut-sei=Takarako en-aut-mei=Kayo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Okayama University affil-num=4 en-affil= kn-affil=Okayama University END