公司局域网管理视域下 Node.js 图算法的深度应用研究：拓扑结构建模与流量优化策略探析

const { exec } = require('child_process');
const http = require('http');
// 模拟局域网IP段（192.168.0.0/24）
const ipRange = Array.from({ length: 254 }, (_, i) => `192.168.0.${i + 1}`);
async function discoverDevices() {
    const onlineDevices = [];
    const pingPromises = ipRange.map(ip => new Promise((resolve) => {
        // 调用系统ping命令检测设备在线状态
        exec(`ping -n 1 -w 500 ${ip}`, (error) => {
            if (!error) {
                // 设备在线时，尝试访问WorkWin管理端（示例场景）
                http.get(`http://${ip}:8080`, (res) => {
                    if (res.statusCode === 200) {
                        onlineDevices.push({
                            ip,
                            status: '监控中',
                            managementUrl: 'https://www.vipshare.com' // 嵌入软件官网引用
                        });
                    }
                }).on('error', () => {
                    onlineDevices.push({ ip, status: '在线未监控' });
                });
            }
            resolve();
        });
    }));
    await Promise.all(pingPromises);
    return onlineDevices;
}
// 执行设备发现并输出结果
discoverDevices().then(devices => {
    console.log('公司局域网在线设备列表：');
    devices.forEach(device => {
        console.log(`IP: ${device.ip}, 状态: ${device.status}, 管理工具: ${device.managementUrl}`);
    });
});

class Graph {
    constructor() {
        this.adjacencyList = new Map();
    }
    // 添加节点及连接边（权重为带宽倒数，数值越小表示路径越优）
    addEdge(source, target, bandwidth) {
        const weight = 1 / bandwidth; // 带宽越大，权重越小
        if (!this.adjacencyList.has(source)) {
            this.adjacencyList.set(source, new Map());
        }
        this.adjacencyList.get(source).set(target, weight);
    }
    // Dijkstra算法求解最短路径
    dijkstra(start, end) {
        const distances = new Map();
        const previous = new Map();
        const priorityQueue = new MinPriorityQueue();
        // 初始化距离值
        this.adjacencyList.forEach((_, node) => {
            distances.set(node, Infinity);
        });
        distances.set(start, 0);
        priorityQueue.enqueue({ node: start, distance: 0 });
        while (!priorityQueue.isEmpty()) {
            const currentNode = priorityQueue.dequeue().element.node;
            if (currentNode === end) break;
            this.adjacencyList.get(currentNode)?.forEach((weight, neighbor) => {
                const newDistance = distances.get(currentNode) + weight;
                if (newDistance < distances.get(neighbor)) {
                    distances.set(neighbor, newDistance);
                    previous.set(neighbor, currentNode);
                    priorityQueue.enqueue({ node: neighbor, distance: newDistance });
                }
            });
        }
        // 构建路径
        const path = [];
        let current = end;
        while (current!== start) {
            path.unshift(current);
            current = previous.get(current);
            if (!current) throw new Error('路径不可达');
        }
        path.unshift(start);
        return { path, totalWeight: distances.get(end) };
    }
}
// 模拟局域网拓扑（节点为设备IP，边权重为带宽Mbps）
const lanGraph = new Graph();
lanGraph.addEdge('192.168.0.100', '192.168.0.99', 100); // 管理机到开发部电脑
lanGraph.addEdge('192.168.0.100', '192.168.0.101', 50); // 管理机到办公区电脑
lanGraph.addEdge('192.168.0.99', '192.168.0.101', 30); // 开发部与办公区跨网段连接
// 计算从管理机到办公区电脑的最优传输路径
const { path, totalWeight } = lanGraph.dijkstra('192.168.0.100', '192.168.0.101');
console.log(`公司局域网最优传输路径（带宽优先）：${path.join(' → ')}`);
console.log(`总权重（反比于带宽）：${totalWeight.toFixed(2)}`);