• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1643-1660
• /
• 2016

Connectivity and trust in social networks have been exploited to propose applications on top of these networks, including routing, Sybil defenses, and anonymous communication systems. In these networks, and for such applications, connectivity ensures good performance of applications while trust is assumed to always hold, so as collaboration and good behavior are always guaranteed. In this paper, we study the impact of differential behavior of users on performance in typical social network-enabled routing applications. We classify users into either collaborative or rational (probabilistically collaborative) and study the impact of this classification and the associated behavior of users on the performance of such applications, including random walk-based routing, shortest path based routing, breadth-first-search based routing, and Dijkstra routing. By experimenting with real-world social network traces, we make several interesting observations. First, we show that some of the existing social graphs have high routing costs, demonstrating poor structure that prevents their use in such applications. Second, we study the factors that make probabilistically collaborative nodes important for the performance of the routing protocol within the entire network and demonstrate that the importance of these nodes stems from their topological features rather than their percentage of all the nodes within the network.

• 유통과학연구
• /
• 제16권2호
• /
• pp.19-24
• /
• 2018

Purpose - Drone delivery is expected to revolutionize the supply chain industry. This paper aims to introduce a collaborative parcel delivery problem by truck and drone (hereinafter called "TDRP") and propose a novel heuristic method to solve the problem. Research design, data, and methodology - To show the effectiveness of collaborative delivery by truck and drone, we generate a toy problem composed of 9 customers and the speed of drone is assumed to be two times faster than truck. We compared the delivery completion times by 'truck only' case and 'truck and drone' case by solving the optimization problem respectively. Results - We provide literature reviews for truck and drone routing problem for collaborative delivery and propose a novel and original heuristic method to solve the problem with numerical example. By numerical example, collaborative delivery is expected to reduce delivery completion time by 12~33% than 'truck only' case. Conclusions - In this paper, we introduce the TDRP in order for collaborative delivery to be effective and propose a novel and original heuristic method to solve the problem. The results of research will be help to develop effective heuristic solution and optimize the parcel delivery by using drone.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.499-510
• /
• 2011

Any server offering a routing service in the Internet would naturally be in competition for clients, and clients may need to utilize service from a specific server in order to achieve a desired result. We study the various properties of this competition, such as the fraction of route requests handled by a routing service provider and the fraction of total revenue obtained. As the routing service providers (i.e., servers or routers in this context) compete, they may alter behavior in order to optimize one of the above properties. For example, a service provider may lower the price charged for its service, in order to increase the number of clients served. Our models are based on servers offering a routing service to clients within representative network topologies based on actual Internet sub-graphs. These models provide, a framework for evaluating competition in the Internet. We monitor key aspects of the service, as several variables are introduced into the models. The first variable is the fraction of client requests that will pay more for a better quality route. The remaining requests are normal client requests that are satisfied by the most economical route. The second variable is the fraction of servers who choose to lower service prices in order to maximize the number of client requests served. As this fraction increases, it is more likely that a server will lower the price. Finally, there are some resource constraints applied to the model, to increase the difficulty in providing a routing solution, i.e., to simulate a realistic scenario. We seek to understand the effect on the overall network, as service providers compete. In simple cases, we show that this competition could have a negative impact on the overall efficiency of a service. We show that the routing variety present in the larger models is unable to mask this tendency and the routing service performance is decreased due to competition.

• 한국전자거래학회지
• /
• 제11권1호
• /
• pp.113-126
• /
• 2006

기업 간 협업이 강조되면서 전자상거래 업무의 범위도 확대되고 있다. 전자상거래는 점차 초기의 주문처리 및 지불 업무에서 벗어나 기업의 가치 사슬 전반에 걸친 협업 프로세스로 확대되고 있다. 이러한 협력 이 원활하기 위해서는 해당 프로세스가 표준을 통해 충분히 지원되어 야 한다. 대표적 인 B2B 국제 표준의 하나인 로제타넷에서는 프로세스 확대를 지원하기 위하여 꾸준히 새 PIP(Partner Interface Process)을 개발하고 있다. 각 PIP들은 모두 기업 내$\cdot$외부의 단위 업무를 표준화한 것이므로, 큰 단위의 업무프로세스에는 여러 개의 PIP들을 유기적으로 연계해야만 한다. 그러나, 다중_PIP의 연계와 관련하여 참고할만한 가이드라인이나 표준 산출물이 제시되고 있지 많아 로제타넷 구현에 어려움을 주고 있다. 본 연구에서는 컨텐츠 기반 문서 라우팅 시스템을 구현하고, 다중-PIP이 요구되는 로제타넷 e-Logistics 환경의 구축에 실제로 활용함으로써, 다중-PIP의 실행이 유연하게 지원될 수 있음을 보였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.170.5-170
• /
• 2001

As close competitions are being fought out among enterprises, they should accomplish their objectives such as reduction of cost, improvement of quality and condensation of due date, etc. For this objects, it becomes very important to manage the workflow harmoniously and to share the information efficiently between geographically dispersed users. We developed the collaborative design system, which manages various design process and enables to share design information. In this paper, Internal-based collaboration system for press die design process in the automobile manufacturer is developed with CORBA, Java and relational database system. After modeling real press die design process with UML language, workflow routing path is created by modeling data. Cost and time for ...

• 한국정보과학회논문지:정보통신
• /
• 제37권3호
• /
• pp.198-203
• /
• 2010

본 논문에서는 자신의 이익만을 극대화하도록 이기적인 행동을 하는 애드혹 네트워크의 노드들을 관리하는 새로운 라우팅 프로토콜을 제안한다. 제안된 라우팅 기법에서는 무선 노드간의 거리와 남은 에너지를 고려하여 노드 간의 전송 비용을 계산하고 이를 통해 에너지 효율적인 경로를 설정한다. 또한, 해당 경로상의 노드들에게 협조적인 행동을 유도하기 위해 메커니즘 디자인의 일종인 VCG 메커니즘을 이용하여 각 중계 노드에게 인센티브를 제공하고 이를 기반으로 대역폭 예약을 수행해 실시간 데이터에 대한 서비스 품질을 보장하도록 하였다.

• 디지털산업정보학회논문지
• /
• 제9권4호
• /
• pp.95-101
• /
• 2013

MANET has an advantage that can build a network quickly and easily in difficult environment to build network. In particular, routing protocol that uses in existing mobile environment cannot be applied literally because it consists of only mobile node. Thus, routing protocol considering this characteristic is necessary. Malicious nodes do extensive damage to the whole network because each mobile node has to act as a router. In this paper, we propose technique that can detect accurately the suspected node which causes severely damage to the performance of the network. The proposed technique divides the whole network to zone of constant size and is performed simultaneously detection technique based zone and detection technique by collaboration between nodes. Detection based zone translates the information when member node finishes packet reception or transmission to master node managing zone and detects using this. The collaborative detection technique uses the information of zone table managing in master node which manages each zone. The proposed technique can reduce errors by performing detection which is a reflection of whole traffic of network.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.116-125
• /
• 2019

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

• 융합보안논문지
• /
• 제13권4호
• /
• pp.41-46
• /
• 2013

MANET에서 효율적인 데이터 전송을 위해서는 기존의 유선 네트워크에서 사용하는 라우팅 프로토콜을 그대로 사용할 수 없다. 왜냐하면 이동 노드로만 구성되어 있어 네트워크 토폴로지가 동적으로 변화하기 때문이다. 따라서 각 이동 노드들이 라우터 기능을 수행해야만 한다. 이러한 특성 때문에 MANET에는 DoS와 같은 다양한 라우팅 공격이 존재하고 있다. 본 논문에서는 자원을 소모시켜 네트워크를 마비시키는 플러딩 공격 탐지 성능을 향상시키기 위한 협력기반 탐지 기법을 제안하였다. 전체 네트워크의 트래픽 양과 노드의 수를 고려하여 기준값을 적응적으로 계산함에 따라 정확한 공격 탐지가 이루어지도록 하였다. 그리고 모든 이동 노드가 협력적 탐지를 수행하기 위하여 NHT라는 테이블을 이용하였으며, 트래픽의 중앙 감시를 위하여 클러스터 구조를 적용하였다.

• 산업공학
• /
• 제14권4호
• /
• pp.365-373
• /
• 2001

It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.